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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:40:25,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:40:25,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:40:25,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:40:25,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:40:25,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:40:25,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:40:25,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:40:25,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:40:25,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:40:25,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:40:25,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:40:25,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:40:25,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:40:25,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:40:25,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:40:25,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:40:25,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:40:25,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:40:25,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:40:25,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:40:25,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:40:25,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:40:25,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:40:25,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:40:25,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:40:25,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:40:25,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:40:25,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:40:25,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:40:25,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:40:25,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:40:25,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:40:25,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:40:25,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:40:25,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:40:25,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:40:25,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:40:25,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:40:25,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:40:25,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:40:25,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:40:25,988 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:40:25,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:40:25,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:40:25,989 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:40:25,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:40:25,990 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:40:25,990 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:40:25,990 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:40:25,991 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:40:25,991 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:40:25,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:40:25,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:40:25,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:40:25,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:40:25,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:40:25,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:40:25,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:40:25,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:40:25,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:40:25,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:40:25,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:40:25,994 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:40:25,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:40:25,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:40:25,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:40:25,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:40:25,995 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:40:25,995 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:40:25,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:40:25,995 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:40:26,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:40:26,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:40:26,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:40:26,043 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:40:26,043 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:40:26,044 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 07:40:26,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5be1ef4bb/107879da910849be9843fd5f9c4af5a2/FLAGfe6f63490 [2019-09-10 07:40:26,782 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:40:26,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 07:40:26,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5be1ef4bb/107879da910849be9843fd5f9c4af5a2/FLAGfe6f63490 [2019-09-10 07:40:26,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5be1ef4bb/107879da910849be9843fd5f9c4af5a2 [2019-09-10 07:40:26,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:40:26,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:40:26,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:40:26,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:40:26,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:40:26,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:40:26" (1/1) ... [2019-09-10 07:40:26,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64899908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:26, skipping insertion in model container [2019-09-10 07:40:26,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:40:26" (1/1) ... [2019-09-10 07:40:26,987 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:40:27,088 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:40:27,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:40:27,833 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:40:28,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:40:28,336 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:40:28,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28 WrapperNode [2019-09-10 07:40:28,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:40:28,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:40:28,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:40:28,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:40:28,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28" (1/1) ... [2019-09-10 07:40:28,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28" (1/1) ... [2019-09-10 07:40:28,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28" (1/1) ... [2019-09-10 07:40:28,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28" (1/1) ... [2019-09-10 07:40:28,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28" (1/1) ... [2019-09-10 07:40:28,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28" (1/1) ... [2019-09-10 07:40:28,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28" (1/1) ... [2019-09-10 07:40:28,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:40:28,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:40:28,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:40:28,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:40:28,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:40:28,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:40:28,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:40:28,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:40:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:40:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:40:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:40:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:40:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:40:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:40:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:40:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:40:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:40:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:40:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:40:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:40:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:40:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:40:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:40:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:40:30,703 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:40:30,703 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:40:30,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:40:30 BoogieIcfgContainer [2019-09-10 07:40:30,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:40:30,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:40:30,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:40:30,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:40:30,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:40:26" (1/3) ... [2019-09-10 07:40:30,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a88a71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:40:30, skipping insertion in model container [2019-09-10 07:40:30,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:40:28" (2/3) ... [2019-09-10 07:40:30,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a88a71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:40:30, skipping insertion in model container [2019-09-10 07:40:30,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:40:30" (3/3) ... [2019-09-10 07:40:30,714 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 07:40:30,725 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:40:30,734 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-10 07:40:30,751 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-10 07:40:30,779 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:40:30,779 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:40:30,779 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:40:30,779 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:40:30,779 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:40:30,780 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:40:30,780 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:40:30,780 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:40:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states. [2019-09-10 07:40:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:40:30,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:30,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:30,848 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:30,853 INFO L82 PathProgramCache]: Analyzing trace with hash -45640292, now seen corresponding path program 1 times [2019-09-10 07:40:30,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:30,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:30,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:30,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:30,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:31,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:31,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:40:31,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:31,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:40:31,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:40:31,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:40:31,542 INFO L87 Difference]: Start difference. First operand 575 states. Second operand 6 states. [2019-09-10 07:40:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:32,320 INFO L93 Difference]: Finished difference Result 632 states and 1018 transitions. [2019-09-10 07:40:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:40:32,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-10 07:40:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:32,341 INFO L225 Difference]: With dead ends: 632 [2019-09-10 07:40:32,341 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 07:40:32,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:40:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 07:40:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 575. [2019-09-10 07:40:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-10 07:40:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 729 transitions. [2019-09-10 07:40:32,429 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 729 transitions. Word has length 64 [2019-09-10 07:40:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:32,429 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 729 transitions. [2019-09-10 07:40:32,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:40:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 729 transitions. [2019-09-10 07:40:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:40:32,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:32,441 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 07:40:32,442 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:32,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1649351166, now seen corresponding path program 1 times [2019-09-10 07:40:32,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:32,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:32,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:32,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:32,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:32,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:32,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:32,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:32,693 INFO L87 Difference]: Start difference. First operand 575 states and 729 transitions. Second operand 5 states. [2019-09-10 07:40:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:33,083 INFO L93 Difference]: Finished difference Result 423 states and 535 transitions. [2019-09-10 07:40:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:40:33,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 07:40:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:33,087 INFO L225 Difference]: With dead ends: 423 [2019-09-10 07:40:33,087 INFO L226 Difference]: Without dead ends: 423 [2019-09-10 07:40:33,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:40:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-09-10 07:40:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2019-09-10 07:40:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-10 07:40:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 535 transitions. [2019-09-10 07:40:33,103 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 535 transitions. Word has length 64 [2019-09-10 07:40:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:33,103 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 535 transitions. [2019-09-10 07:40:33,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:40:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 535 transitions. [2019-09-10 07:40:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:40:33,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:33,105 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 07:40:33,106 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1630759173, now seen corresponding path program 1 times [2019-09-10 07:40:33,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:33,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:33,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:33,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:33,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:33,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:33,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:33,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:33,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:33,244 INFO L87 Difference]: Start difference. First operand 423 states and 535 transitions. Second operand 5 states. [2019-09-10 07:40:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:33,702 INFO L93 Difference]: Finished difference Result 589 states and 765 transitions. [2019-09-10 07:40:33,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:40:33,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 07:40:33,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:33,706 INFO L225 Difference]: With dead ends: 589 [2019-09-10 07:40:33,706 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 07:40:33,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:40:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 07:40:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2019-09-10 07:40:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-10 07:40:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 721 transitions. [2019-09-10 07:40:33,723 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 721 transitions. Word has length 64 [2019-09-10 07:40:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:33,723 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 721 transitions. [2019-09-10 07:40:33,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:40:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 721 transitions. [2019-09-10 07:40:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:40:33,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:33,727 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 07:40:33,727 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1724870339, now seen corresponding path program 1 times [2019-09-10 07:40:33,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:33,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:33,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:33,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:33,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:33,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:40:33,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:33,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:40:33,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:40:33,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:40:33,865 INFO L87 Difference]: Start difference. First operand 541 states and 721 transitions. Second operand 5 states. [2019-09-10 07:40:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:34,081 INFO L93 Difference]: Finished difference Result 488 states and 651 transitions. [2019-09-10 07:40:34,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:40:34,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 07:40:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:34,085 INFO L225 Difference]: With dead ends: 488 [2019-09-10 07:40:34,085 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 07:40:34,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:40:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 07:40:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-10 07:40:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 651 transitions. [2019-09-10 07:40:34,099 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 651 transitions. Word has length 66 [2019-09-10 07:40:34,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:34,099 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 651 transitions. [2019-09-10 07:40:34,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:40:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 651 transitions. [2019-09-10 07:40:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:40:34,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:34,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:34,101 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash 726626472, now seen corresponding path program 1 times [2019-09-10 07:40:34,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:34,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:34,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:34,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:34,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:34,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:34,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:40:34,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:34,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:40:34,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:40:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:40:34,320 INFO L87 Difference]: Start difference. First operand 488 states and 651 transitions. Second operand 8 states. [2019-09-10 07:40:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:34,860 INFO L93 Difference]: Finished difference Result 841 states and 1154 transitions. [2019-09-10 07:40:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:40:34,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-09-10 07:40:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:34,866 INFO L225 Difference]: With dead ends: 841 [2019-09-10 07:40:34,866 INFO L226 Difference]: Without dead ends: 841 [2019-09-10 07:40:34,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:40:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-10 07:40:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 488. [2019-09-10 07:40:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 650 transitions. [2019-09-10 07:40:34,925 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 650 transitions. Word has length 68 [2019-09-10 07:40:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:34,925 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 650 transitions. [2019-09-10 07:40:34,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:40:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 650 transitions. [2019-09-10 07:40:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:40:34,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:34,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:34,927 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:34,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:34,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1014461784, now seen corresponding path program 1 times [2019-09-10 07:40:34,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:34,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:34,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:34,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:34,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:35,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:35,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:35,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:35,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:35,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:35,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:35,083 INFO L87 Difference]: Start difference. First operand 488 states and 650 transitions. Second operand 9 states. [2019-09-10 07:40:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:36,347 INFO L93 Difference]: Finished difference Result 1029 states and 1452 transitions. [2019-09-10 07:40:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:40:36,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:40:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:36,355 INFO L225 Difference]: With dead ends: 1029 [2019-09-10 07:40:36,356 INFO L226 Difference]: Without dead ends: 1029 [2019-09-10 07:40:36,356 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 07:40:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-09-10 07:40:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 488. [2019-09-10 07:40:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 649 transitions. [2019-09-10 07:40:36,377 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 649 transitions. Word has length 68 [2019-09-10 07:40:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:36,377 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 649 transitions. [2019-09-10 07:40:36,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 649 transitions. [2019-09-10 07:40:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:40:36,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:36,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:36,379 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:36,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1312203704, now seen corresponding path program 1 times [2019-09-10 07:40:36,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:36,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:36,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:36,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:36,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:36,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:36,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:36,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:36,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:36,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:36,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:36,574 INFO L87 Difference]: Start difference. First operand 488 states and 649 transitions. Second operand 9 states. [2019-09-10 07:40:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:37,559 INFO L93 Difference]: Finished difference Result 1261 states and 1762 transitions. [2019-09-10 07:40:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:40:37,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:40:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:37,568 INFO L225 Difference]: With dead ends: 1261 [2019-09-10 07:40:37,569 INFO L226 Difference]: Without dead ends: 1261 [2019-09-10 07:40:37,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:40:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-09-10 07:40:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 488. [2019-09-10 07:40:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 648 transitions. [2019-09-10 07:40:37,594 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 648 transitions. Word has length 68 [2019-09-10 07:40:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:37,594 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 648 transitions. [2019-09-10 07:40:37,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 648 transitions. [2019-09-10 07:40:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:40:37,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:37,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:37,597 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:37,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1888529039, now seen corresponding path program 1 times [2019-09-10 07:40:37,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:37,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:37,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:37,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:37,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:37,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:37,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:37,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:37,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:37,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:37,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:37,808 INFO L87 Difference]: Start difference. First operand 488 states and 648 transitions. Second operand 9 states. [2019-09-10 07:40:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:38,946 INFO L93 Difference]: Finished difference Result 1235 states and 1719 transitions. [2019-09-10 07:40:38,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:40:38,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:40:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:38,955 INFO L225 Difference]: With dead ends: 1235 [2019-09-10 07:40:38,955 INFO L226 Difference]: Without dead ends: 1235 [2019-09-10 07:40:38,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:40:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-10 07:40:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 488. [2019-09-10 07:40:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 647 transitions. [2019-09-10 07:40:38,988 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 647 transitions. Word has length 69 [2019-09-10 07:40:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:38,988 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 647 transitions. [2019-09-10 07:40:38,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 647 transitions. [2019-09-10 07:40:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:40:38,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:38,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:38,992 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:38,992 INFO L82 PathProgramCache]: Analyzing trace with hash 251258957, now seen corresponding path program 1 times [2019-09-10 07:40:38,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:38,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:38,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:38,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:39,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:39,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:39,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:39,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:39,250 INFO L87 Difference]: Start difference. First operand 488 states and 647 transitions. Second operand 9 states. [2019-09-10 07:40:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:40,449 INFO L93 Difference]: Finished difference Result 1261 states and 1759 transitions. [2019-09-10 07:40:40,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:40:40,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:40:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:40,463 INFO L225 Difference]: With dead ends: 1261 [2019-09-10 07:40:40,463 INFO L226 Difference]: Without dead ends: 1261 [2019-09-10 07:40:40,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:40:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-09-10 07:40:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 488. [2019-09-10 07:40:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 645 transitions. [2019-09-10 07:40:40,485 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 645 transitions. Word has length 70 [2019-09-10 07:40:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:40,486 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 645 transitions. [2019-09-10 07:40:40,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 645 transitions. [2019-09-10 07:40:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:40:40,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:40,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:40,488 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:40,488 INFO L82 PathProgramCache]: Analyzing trace with hash 120874925, now seen corresponding path program 1 times [2019-09-10 07:40:40,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:40,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:40,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:40,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:40,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:40,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:40,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:40,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:40,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:40,698 INFO L87 Difference]: Start difference. First operand 488 states and 645 transitions. Second operand 9 states. [2019-09-10 07:40:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:41,818 INFO L93 Difference]: Finished difference Result 1235 states and 1715 transitions. [2019-09-10 07:40:41,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:40:41,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:40:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:41,831 INFO L225 Difference]: With dead ends: 1235 [2019-09-10 07:40:41,831 INFO L226 Difference]: Without dead ends: 1235 [2019-09-10 07:40:41,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:40:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-10 07:40:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 488. [2019-09-10 07:40:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 643 transitions. [2019-09-10 07:40:41,854 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 643 transitions. Word has length 70 [2019-09-10 07:40:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:41,855 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 643 transitions. [2019-09-10 07:40:41,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 643 transitions. [2019-09-10 07:40:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:40:41,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:41,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:41,857 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1647730477, now seen corresponding path program 1 times [2019-09-10 07:40:41,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:41,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:41,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:42,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:42,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:42,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:42,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:42,026 INFO L87 Difference]: Start difference. First operand 488 states and 643 transitions. Second operand 9 states. [2019-09-10 07:40:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:42,925 INFO L93 Difference]: Finished difference Result 1029 states and 1444 transitions. [2019-09-10 07:40:42,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:40:42,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:40:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:42,930 INFO L225 Difference]: With dead ends: 1029 [2019-09-10 07:40:42,931 INFO L226 Difference]: Without dead ends: 1029 [2019-09-10 07:40:42,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:40:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-09-10 07:40:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 488. [2019-09-10 07:40:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 641 transitions. [2019-09-10 07:40:42,965 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 641 transitions. Word has length 70 [2019-09-10 07:40:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:42,965 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 641 transitions. [2019-09-10 07:40:42,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 641 transitions. [2019-09-10 07:40:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:40:42,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:42,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:42,967 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1135659117, now seen corresponding path program 1 times [2019-09-10 07:40:42,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:42,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:42,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:42,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:42,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:43,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:43,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:43,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:43,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:43,138 INFO L87 Difference]: Start difference. First operand 488 states and 641 transitions. Second operand 9 states. [2019-09-10 07:40:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:44,168 INFO L93 Difference]: Finished difference Result 1235 states and 1711 transitions. [2019-09-10 07:40:44,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:40:44,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:40:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:44,175 INFO L225 Difference]: With dead ends: 1235 [2019-09-10 07:40:44,176 INFO L226 Difference]: Without dead ends: 1235 [2019-09-10 07:40:44,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:40:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-10 07:40:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 488. [2019-09-10 07:40:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 640 transitions. [2019-09-10 07:40:44,196 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 640 transitions. Word has length 70 [2019-09-10 07:40:44,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:44,196 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 640 transitions. [2019-09-10 07:40:44,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 640 transitions. [2019-09-10 07:40:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:40:44,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:44,198 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:44,198 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:44,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1963584653, now seen corresponding path program 1 times [2019-09-10 07:40:44,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:44,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:44,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:44,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:44,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:44,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:44,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:44,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:44,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:44,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:44,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:44,365 INFO L87 Difference]: Start difference. First operand 488 states and 640 transitions. Second operand 9 states. [2019-09-10 07:40:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:45,264 INFO L93 Difference]: Finished difference Result 1235 states and 1710 transitions. [2019-09-10 07:40:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:40:45,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:40:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:45,271 INFO L225 Difference]: With dead ends: 1235 [2019-09-10 07:40:45,271 INFO L226 Difference]: Without dead ends: 1235 [2019-09-10 07:40:45,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:40:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-10 07:40:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 488. [2019-09-10 07:40:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 639 transitions. [2019-09-10 07:40:45,291 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 639 transitions. Word has length 70 [2019-09-10 07:40:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:45,292 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 639 transitions. [2019-09-10 07:40:45,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 639 transitions. [2019-09-10 07:40:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:40:45,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:45,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:45,293 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash -483426451, now seen corresponding path program 1 times [2019-09-10 07:40:45,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:45,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:45,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:45,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:45,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:40:45,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:45,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:40:45,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:40:45,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:40:45,449 INFO L87 Difference]: Start difference. First operand 488 states and 639 transitions. Second operand 9 states. [2019-09-10 07:40:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:46,622 INFO L93 Difference]: Finished difference Result 1261 states and 1750 transitions. [2019-09-10 07:40:46,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:40:46,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:40:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:46,628 INFO L225 Difference]: With dead ends: 1261 [2019-09-10 07:40:46,629 INFO L226 Difference]: Without dead ends: 1261 [2019-09-10 07:40:46,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:40:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-09-10 07:40:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 488. [2019-09-10 07:40:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:40:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 638 transitions. [2019-09-10 07:40:46,647 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 638 transitions. Word has length 70 [2019-09-10 07:40:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:46,647 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 638 transitions. [2019-09-10 07:40:46,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:40:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 638 transitions. [2019-09-10 07:40:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:40:46,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:46,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:46,649 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 13599436, now seen corresponding path program 1 times [2019-09-10 07:40:46,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:46,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:46,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:47,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:47,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:40:47,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:47,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:40:47,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:40:47,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:40:47,493 INFO L87 Difference]: Start difference. First operand 488 states and 638 transitions. Second operand 16 states. [2019-09-10 07:40:48,266 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:40:48,543 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:40:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:50,106 INFO L93 Difference]: Finished difference Result 1199 states and 1609 transitions. [2019-09-10 07:40:50,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:40:50,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-10 07:40:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:50,112 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 07:40:50,112 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 07:40:50,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:40:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 07:40:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 487. [2019-09-10 07:40:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-10 07:40:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 636 transitions. [2019-09-10 07:40:50,129 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 636 transitions. Word has length 71 [2019-09-10 07:40:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:50,130 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 636 transitions. [2019-09-10 07:40:50,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:40:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 636 transitions. [2019-09-10 07:40:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:40:50,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:50,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:50,132 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:50,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1414423564, now seen corresponding path program 1 times [2019-09-10 07:40:50,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:50,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:50,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:50,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:50,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:40:50,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:50,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:40:50,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:40:50,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:40:50,956 INFO L87 Difference]: Start difference. First operand 487 states and 636 transitions. Second operand 17 states. [2019-09-10 07:40:51,602 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:40:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:52,909 INFO L93 Difference]: Finished difference Result 937 states and 1296 transitions. [2019-09-10 07:40:52,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:40:52,909 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-09-10 07:40:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:52,915 INFO L225 Difference]: With dead ends: 937 [2019-09-10 07:40:52,915 INFO L226 Difference]: Without dead ends: 937 [2019-09-10 07:40:52,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:40:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-09-10 07:40:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 475. [2019-09-10 07:40:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-10 07:40:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 620 transitions. [2019-09-10 07:40:52,930 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 620 transitions. Word has length 71 [2019-09-10 07:40:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:52,931 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 620 transitions. [2019-09-10 07:40:52,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:40:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 620 transitions. [2019-09-10 07:40:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:40:52,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:52,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:52,932 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:52,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:52,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1732820084, now seen corresponding path program 1 times [2019-09-10 07:40:52,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:52,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:52,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:52,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:52,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:53,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:53,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:40:53,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:53,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:40:53,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:40:53,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:40:53,538 INFO L87 Difference]: Start difference. First operand 475 states and 620 transitions. Second operand 14 states. [2019-09-10 07:40:54,196 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:40:54,325 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:40:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:40:55,309 INFO L93 Difference]: Finished difference Result 834 states and 1155 transitions. [2019-09-10 07:40:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:40:55,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-10 07:40:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:40:55,315 INFO L225 Difference]: With dead ends: 834 [2019-09-10 07:40:55,315 INFO L226 Difference]: Without dead ends: 834 [2019-09-10 07:40:55,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:40:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-09-10 07:40:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 456. [2019-09-10 07:40:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-10 07:40:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-09-10 07:40:55,331 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 71 [2019-09-10 07:40:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:40:55,332 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-09-10 07:40:55,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:40:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-09-10 07:40:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:40:55,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:40:55,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:40:55,335 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:40:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:40:55,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1601198802, now seen corresponding path program 1 times [2019-09-10 07:40:55,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:40:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:55,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:40:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:40:55,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:40:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:40:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:40:56,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:40:56,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 07:40:56,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:40:56,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:40:56,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:40:56,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:40:56,659 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 20 states. [2019-09-10 07:40:56,814 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:40:57,210 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 07:40:57,371 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-10 07:40:57,613 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:40:57,848 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:40:58,149 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:40:58,382 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:40:58,618 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:40:59,603 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:41:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:00,504 INFO L93 Difference]: Finished difference Result 810 states and 1082 transitions. [2019-09-10 07:41:00,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:41:00,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-09-10 07:41:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:00,511 INFO L225 Difference]: With dead ends: 810 [2019-09-10 07:41:00,511 INFO L226 Difference]: Without dead ends: 810 [2019-09-10 07:41:00,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:41:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-09-10 07:41:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 467. [2019-09-10 07:41:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-10 07:41:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 614 transitions. [2019-09-10 07:41:00,523 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 614 transitions. Word has length 72 [2019-09-10 07:41:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:00,523 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 614 transitions. [2019-09-10 07:41:00,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:41:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 614 transitions. [2019-09-10 07:41:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:41:00,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:00,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:00,525 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:00,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1134979118, now seen corresponding path program 1 times [2019-09-10 07:41:00,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:00,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:00,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:01,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:01,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:41:01,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:01,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:41:01,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:41:01,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:41:01,816 INFO L87 Difference]: Start difference. First operand 467 states and 614 transitions. Second operand 21 states. [2019-09-10 07:41:01,967 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:41:02,590 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:41:02,743 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:41:02,939 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:41:03,210 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 07:41:03,547 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 07:41:03,770 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:41:03,981 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:41:04,174 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:41:04,456 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:41:04,689 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:41:04,897 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:41:05,148 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:41:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:06,379 INFO L93 Difference]: Finished difference Result 928 states and 1238 transitions. [2019-09-10 07:41:06,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:41:06,379 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-09-10 07:41:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:06,383 INFO L225 Difference]: With dead ends: 928 [2019-09-10 07:41:06,383 INFO L226 Difference]: Without dead ends: 928 [2019-09-10 07:41:06,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:41:06,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-10 07:41:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 467. [2019-09-10 07:41:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-10 07:41:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 613 transitions. [2019-09-10 07:41:06,394 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 613 transitions. Word has length 72 [2019-09-10 07:41:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:06,394 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 613 transitions. [2019-09-10 07:41:06,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:41:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 613 transitions. [2019-09-10 07:41:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:41:06,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:06,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:06,396 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash -325456334, now seen corresponding path program 1 times [2019-09-10 07:41:06,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:06,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:06,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:07,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:07,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:41:07,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:07,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:41:07,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:41:07,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:41:07,131 INFO L87 Difference]: Start difference. First operand 467 states and 613 transitions. Second operand 17 states. [2019-09-10 07:41:07,772 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:41:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:08,441 INFO L93 Difference]: Finished difference Result 560 states and 752 transitions. [2019-09-10 07:41:08,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:41:08,442 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-09-10 07:41:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:08,445 INFO L225 Difference]: With dead ends: 560 [2019-09-10 07:41:08,445 INFO L226 Difference]: Without dead ends: 560 [2019-09-10 07:41:08,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:41:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-10 07:41:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 447. [2019-09-10 07:41:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-10 07:41:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 588 transitions. [2019-09-10 07:41:08,453 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 588 transitions. Word has length 72 [2019-09-10 07:41:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:08,454 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 588 transitions. [2019-09-10 07:41:08,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:41:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 588 transitions. [2019-09-10 07:41:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:41:08,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:08,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:08,455 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash -535876087, now seen corresponding path program 1 times [2019-09-10 07:41:08,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:08,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:08,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:09,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:09,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:41:09,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:09,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:41:09,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:41:09,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:41:09,144 INFO L87 Difference]: Start difference. First operand 447 states and 588 transitions. Second operand 16 states. [2019-09-10 07:41:09,812 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 07:41:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:10,885 INFO L93 Difference]: Finished difference Result 1076 states and 1527 transitions. [2019-09-10 07:41:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:41:10,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-09-10 07:41:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:10,890 INFO L225 Difference]: With dead ends: 1076 [2019-09-10 07:41:10,891 INFO L226 Difference]: Without dead ends: 1076 [2019-09-10 07:41:10,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:41:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-10 07:41:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 430. [2019-09-10 07:41:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 07:41:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 567 transitions. [2019-09-10 07:41:10,919 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 567 transitions. Word has length 72 [2019-09-10 07:41:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:10,919 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 567 transitions. [2019-09-10 07:41:10,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:41:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 567 transitions. [2019-09-10 07:41:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:41:10,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:10,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:10,921 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:10,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1933470062, now seen corresponding path program 1 times [2019-09-10 07:41:10,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:10,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:10,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:10,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:10,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:11,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:11,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:41:11,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:11,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:41:11,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:41:11,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:41:11,307 INFO L87 Difference]: Start difference. First operand 430 states and 567 transitions. Second operand 11 states. [2019-09-10 07:41:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:11,932 INFO L93 Difference]: Finished difference Result 923 states and 1276 transitions. [2019-09-10 07:41:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:41:11,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-10 07:41:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:11,938 INFO L225 Difference]: With dead ends: 923 [2019-09-10 07:41:11,938 INFO L226 Difference]: Without dead ends: 923 [2019-09-10 07:41:11,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:41:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-10 07:41:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 426. [2019-09-10 07:41:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 07:41:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 563 transitions. [2019-09-10 07:41:11,949 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 563 transitions. Word has length 73 [2019-09-10 07:41:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:11,949 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 563 transitions. [2019-09-10 07:41:11,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:41:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 563 transitions. [2019-09-10 07:41:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:41:11,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:11,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:11,951 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2086852327, now seen corresponding path program 1 times [2019-09-10 07:41:11,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:11,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:11,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:11,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:12,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:12,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:41:12,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:12,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:41:12,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:41:12,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:41:12,499 INFO L87 Difference]: Start difference. First operand 426 states and 563 transitions. Second operand 12 states. [2019-09-10 07:41:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:13,638 INFO L93 Difference]: Finished difference Result 2226 states and 3209 transitions. [2019-09-10 07:41:13,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:41:13,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 07:41:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:13,646 INFO L225 Difference]: With dead ends: 2226 [2019-09-10 07:41:13,646 INFO L226 Difference]: Without dead ends: 2226 [2019-09-10 07:41:13,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:41:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2019-09-10 07:41:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 392. [2019-09-10 07:41:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-10 07:41:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 516 transitions. [2019-09-10 07:41:13,667 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 516 transitions. Word has length 73 [2019-09-10 07:41:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:13,668 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 516 transitions. [2019-09-10 07:41:13,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:41:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 516 transitions. [2019-09-10 07:41:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:41:13,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:13,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:13,669 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1799415509, now seen corresponding path program 1 times [2019-09-10 07:41:13,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:13,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:13,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:13,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:14,254 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 07:41:14,511 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-10 07:41:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:15,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:15,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:41:15,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:15,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:41:15,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:41:15,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:41:15,481 INFO L87 Difference]: Start difference. First operand 392 states and 516 transitions. Second operand 21 states. [2019-09-10 07:41:15,725 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:41:15,955 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 07:41:16,123 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:41:16,304 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:41:16,528 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:41:16,911 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:41:17,257 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:41:17,699 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 07:41:18,140 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 07:41:18,568 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 07:41:19,013 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 07:41:19,583 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-09-10 07:41:19,980 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:41:20,364 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 07:41:20,691 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:41:20,954 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:41:21,342 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:41:21,665 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:41:21,853 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:41:22,245 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:41:22,736 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:41:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:23,386 INFO L93 Difference]: Finished difference Result 1270 states and 1810 transitions. [2019-09-10 07:41:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:41:23,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 73 [2019-09-10 07:41:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:23,392 INFO L225 Difference]: With dead ends: 1270 [2019-09-10 07:41:23,393 INFO L226 Difference]: Without dead ends: 1270 [2019-09-10 07:41:23,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:41:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-09-10 07:41:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 388. [2019-09-10 07:41:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-10 07:41:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 511 transitions. [2019-09-10 07:41:23,402 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 511 transitions. Word has length 73 [2019-09-10 07:41:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:23,403 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 511 transitions. [2019-09-10 07:41:23,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:41:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 511 transitions. [2019-09-10 07:41:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:41:23,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:23,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:23,404 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1717982386, now seen corresponding path program 1 times [2019-09-10 07:41:23,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:23,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:23,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:23,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:23,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:23,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:23,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:41:23,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:23,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:41:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:41:23,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:41:23,534 INFO L87 Difference]: Start difference. First operand 388 states and 511 transitions. Second operand 9 states. [2019-09-10 07:41:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:24,176 INFO L93 Difference]: Finished difference Result 670 states and 903 transitions. [2019-09-10 07:41:24,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:41:24,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-10 07:41:24,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:24,179 INFO L225 Difference]: With dead ends: 670 [2019-09-10 07:41:24,179 INFO L226 Difference]: Without dead ends: 670 [2019-09-10 07:41:24,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:41:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-10 07:41:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 388. [2019-09-10 07:41:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-10 07:41:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 509 transitions. [2019-09-10 07:41:24,186 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 509 transitions. Word has length 74 [2019-09-10 07:41:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:24,187 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 509 transitions. [2019-09-10 07:41:24,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:41:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 509 transitions. [2019-09-10 07:41:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:41:24,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:24,188 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:24,189 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2063860178, now seen corresponding path program 1 times [2019-09-10 07:41:24,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:24,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:24,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:24,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:41:24,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:24,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:41:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:41:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:41:24,381 INFO L87 Difference]: Start difference. First operand 388 states and 509 transitions. Second operand 9 states. [2019-09-10 07:41:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:25,435 INFO L93 Difference]: Finished difference Result 884 states and 1220 transitions. [2019-09-10 07:41:25,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:41:25,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:41:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:25,440 INFO L225 Difference]: With dead ends: 884 [2019-09-10 07:41:25,441 INFO L226 Difference]: Without dead ends: 884 [2019-09-10 07:41:25,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:41:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-09-10 07:41:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 388. [2019-09-10 07:41:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-10 07:41:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 508 transitions. [2019-09-10 07:41:25,450 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 508 transitions. Word has length 75 [2019-09-10 07:41:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:25,450 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 508 transitions. [2019-09-10 07:41:25,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:41:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 508 transitions. [2019-09-10 07:41:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:41:25,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:25,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:25,452 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:25,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:25,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1495566453, now seen corresponding path program 1 times [2019-09-10 07:41:25,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:25,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:25,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:25,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:25,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:25,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:25,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:41:25,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:25,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:41:25,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:41:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:41:25,582 INFO L87 Difference]: Start difference. First operand 388 states and 508 transitions. Second operand 9 states. [2019-09-10 07:41:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:26,247 INFO L93 Difference]: Finished difference Result 672 states and 901 transitions. [2019-09-10 07:41:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:41:26,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:41:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:26,252 INFO L225 Difference]: With dead ends: 672 [2019-09-10 07:41:26,252 INFO L226 Difference]: Without dead ends: 672 [2019-09-10 07:41:26,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:41:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-10 07:41:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 388. [2019-09-10 07:41:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-10 07:41:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 507 transitions. [2019-09-10 07:41:26,269 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 507 transitions. Word has length 75 [2019-09-10 07:41:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:26,270 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 507 transitions. [2019-09-10 07:41:26,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:41:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 507 transitions. [2019-09-10 07:41:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:41:26,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:26,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:26,272 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:26,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1970985129, now seen corresponding path program 1 times [2019-09-10 07:41:26,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:26,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:26,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:26,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:26,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:26,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:41:26,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:26,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:41:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:41:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:41:26,961 INFO L87 Difference]: Start difference. First operand 388 states and 507 transitions. Second operand 21 states. [2019-09-10 07:41:27,175 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:41:27,956 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 07:41:28,127 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:41:28,311 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:41:28,481 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:41:28,623 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:41:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:31,013 INFO L93 Difference]: Finished difference Result 1905 states and 2759 transitions. [2019-09-10 07:41:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:41:31,014 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-10 07:41:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:31,020 INFO L225 Difference]: With dead ends: 1905 [2019-09-10 07:41:31,020 INFO L226 Difference]: Without dead ends: 1905 [2019-09-10 07:41:31,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=283, Invalid=1357, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:41:31,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2019-09-10 07:41:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 401. [2019-09-10 07:41:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-09-10 07:41:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 522 transitions. [2019-09-10 07:41:31,033 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 522 transitions. Word has length 76 [2019-09-10 07:41:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:31,034 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 522 transitions. [2019-09-10 07:41:31,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:41:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 522 transitions. [2019-09-10 07:41:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:41:31,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:31,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:31,035 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:31,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1254231081, now seen corresponding path program 1 times [2019-09-10 07:41:31,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:31,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:31,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:31,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:31,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:31,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:31,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:41:31,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:31,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:41:31,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:41:31,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:41:31,442 INFO L87 Difference]: Start difference. First operand 401 states and 522 transitions. Second operand 12 states. [2019-09-10 07:41:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:32,314 INFO L93 Difference]: Finished difference Result 1109 states and 1548 transitions. [2019-09-10 07:41:32,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:41:32,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2019-09-10 07:41:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:32,322 INFO L225 Difference]: With dead ends: 1109 [2019-09-10 07:41:32,322 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 07:41:32,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:41:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 07:41:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 394. [2019-09-10 07:41:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 07:41:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 514 transitions. [2019-09-10 07:41:32,331 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 514 transitions. Word has length 77 [2019-09-10 07:41:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:32,331 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 514 transitions. [2019-09-10 07:41:32,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:41:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 514 transitions. [2019-09-10 07:41:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:41:32,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:32,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:32,333 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:32,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:32,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1521511757, now seen corresponding path program 1 times [2019-09-10 07:41:32,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:32,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:32,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:32,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:32,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:32,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:32,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:41:32,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:32,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:41:32,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:41:32,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:41:32,764 INFO L87 Difference]: Start difference. First operand 394 states and 514 transitions. Second operand 13 states. [2019-09-10 07:41:33,453 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-09-10 07:41:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:33,892 INFO L93 Difference]: Finished difference Result 844 states and 1177 transitions. [2019-09-10 07:41:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:41:33,893 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-09-10 07:41:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:33,895 INFO L225 Difference]: With dead ends: 844 [2019-09-10 07:41:33,895 INFO L226 Difference]: Without dead ends: 844 [2019-09-10 07:41:33,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:41:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-09-10 07:41:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 374. [2019-09-10 07:41:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-10 07:41:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 492 transitions. [2019-09-10 07:41:33,902 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 492 transitions. Word has length 77 [2019-09-10 07:41:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:33,903 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 492 transitions. [2019-09-10 07:41:33,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:41:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 492 transitions. [2019-09-10 07:41:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:41:33,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:33,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:33,904 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:33,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2017824198, now seen corresponding path program 1 times [2019-09-10 07:41:33,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:33,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:33,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:34,617 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-09-10 07:41:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:35,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:35,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 07:41:35,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:35,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:41:35,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:41:35,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:41:35,342 INFO L87 Difference]: Start difference. First operand 374 states and 492 transitions. Second operand 22 states. [2019-09-10 07:41:35,512 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:41:36,069 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:41:36,278 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 07:41:36,532 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 07:41:36,778 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 07:41:37,032 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:41:37,262 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:41:37,483 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:41:37,721 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:41:37,952 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:41:38,152 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:41:38,347 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:41:38,579 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:41:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:39,723 INFO L93 Difference]: Finished difference Result 607 states and 828 transitions. [2019-09-10 07:41:39,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:41:39,724 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-09-10 07:41:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:39,725 INFO L225 Difference]: With dead ends: 607 [2019-09-10 07:41:39,725 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 07:41:39,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:41:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 07:41:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 380. [2019-09-10 07:41:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-10 07:41:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 498 transitions. [2019-09-10 07:41:39,731 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 498 transitions. Word has length 77 [2019-09-10 07:41:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:39,731 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 498 transitions. [2019-09-10 07:41:39,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:41:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 498 transitions. [2019-09-10 07:41:39,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:41:39,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:39,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:39,733 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:39,733 INFO L82 PathProgramCache]: Analyzing trace with hash -426565732, now seen corresponding path program 1 times [2019-09-10 07:41:39,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:39,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:39,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:39,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:39,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:40,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:40,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:41:40,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:40,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:41:40,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:41:40,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:41:40,056 INFO L87 Difference]: Start difference. First operand 380 states and 498 transitions. Second operand 10 states. [2019-09-10 07:41:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:41,154 INFO L93 Difference]: Finished difference Result 1237 states and 1798 transitions. [2019-09-10 07:41:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:41:41,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-09-10 07:41:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:41,156 INFO L225 Difference]: With dead ends: 1237 [2019-09-10 07:41:41,156 INFO L226 Difference]: Without dead ends: 1237 [2019-09-10 07:41:41,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:41:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2019-09-10 07:41:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 347. [2019-09-10 07:41:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-10 07:41:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 463 transitions. [2019-09-10 07:41:41,164 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 463 transitions. Word has length 78 [2019-09-10 07:41:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:41,164 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 463 transitions. [2019-09-10 07:41:41,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:41:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 463 transitions. [2019-09-10 07:41:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:41:41,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:41,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:41,166 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:41,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash 123664725, now seen corresponding path program 1 times [2019-09-10 07:41:41,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:41,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:41,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:41,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:41,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:41,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:41,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:41,246 INFO L87 Difference]: Start difference. First operand 347 states and 463 transitions. Second operand 3 states. [2019-09-10 07:41:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:41,281 INFO L93 Difference]: Finished difference Result 539 states and 740 transitions. [2019-09-10 07:41:41,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:41,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:41:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:41,283 INFO L225 Difference]: With dead ends: 539 [2019-09-10 07:41:41,283 INFO L226 Difference]: Without dead ends: 539 [2019-09-10 07:41:41,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-10 07:41:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2019-09-10 07:41:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-10 07:41:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 739 transitions. [2019-09-10 07:41:41,293 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 739 transitions. Word has length 100 [2019-09-10 07:41:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:41,294 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 739 transitions. [2019-09-10 07:41:41,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 739 transitions. [2019-09-10 07:41:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:41:41,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:41,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:41,297 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:41,297 INFO L82 PathProgramCache]: Analyzing trace with hash 584012325, now seen corresponding path program 1 times [2019-09-10 07:41:41,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:41,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:41,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:41,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:41,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:41,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:41,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:41,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:41,365 INFO L87 Difference]: Start difference. First operand 537 states and 739 transitions. Second operand 3 states. [2019-09-10 07:41:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:41,389 INFO L93 Difference]: Finished difference Result 895 states and 1248 transitions. [2019-09-10 07:41:41,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:41,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:41:41,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:41,391 INFO L225 Difference]: With dead ends: 895 [2019-09-10 07:41:41,391 INFO L226 Difference]: Without dead ends: 895 [2019-09-10 07:41:41,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-09-10 07:41:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 893. [2019-09-10 07:41:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-09-10 07:41:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1247 transitions. [2019-09-10 07:41:41,401 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1247 transitions. Word has length 102 [2019-09-10 07:41:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:41,402 INFO L475 AbstractCegarLoop]: Abstraction has 893 states and 1247 transitions. [2019-09-10 07:41:41,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1247 transitions. [2019-09-10 07:41:41,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:41:41,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:41,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:41,404 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:41,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:41,404 INFO L82 PathProgramCache]: Analyzing trace with hash 650505837, now seen corresponding path program 1 times [2019-09-10 07:41:41,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:41,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:41,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:41,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:41,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:41,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:41,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:41,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:41,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:41,475 INFO L87 Difference]: Start difference. First operand 893 states and 1247 transitions. Second operand 3 states. [2019-09-10 07:41:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:41,507 INFO L93 Difference]: Finished difference Result 1279 states and 1796 transitions. [2019-09-10 07:41:41,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:41,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:41:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:41,510 INFO L225 Difference]: With dead ends: 1279 [2019-09-10 07:41:41,510 INFO L226 Difference]: Without dead ends: 1279 [2019-09-10 07:41:41,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-09-10 07:41:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1277. [2019-09-10 07:41:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1277 states. [2019-09-10 07:41:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1795 transitions. [2019-09-10 07:41:41,524 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1795 transitions. Word has length 102 [2019-09-10 07:41:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:41,524 INFO L475 AbstractCegarLoop]: Abstraction has 1277 states and 1795 transitions. [2019-09-10 07:41:41,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1795 transitions. [2019-09-10 07:41:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:41:41,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:41,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:41,526 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash 184976012, now seen corresponding path program 1 times [2019-09-10 07:41:41,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:41,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:41,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:41,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:41,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:41:41,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:41,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:41:41,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:41:41,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:41:41,597 INFO L87 Difference]: Start difference. First operand 1277 states and 1795 transitions. Second operand 5 states. [2019-09-10 07:41:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:41,820 INFO L93 Difference]: Finished difference Result 4643 states and 6442 transitions. [2019-09-10 07:41:41,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:41:41,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:41:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:41,829 INFO L225 Difference]: With dead ends: 4643 [2019-09-10 07:41:41,829 INFO L226 Difference]: Without dead ends: 4643 [2019-09-10 07:41:41,829 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 07:41:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2019-09-10 07:41:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 2509. [2019-09-10 07:41:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2509 states. [2019-09-10 07:41:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3535 transitions. [2019-09-10 07:41:41,866 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3535 transitions. Word has length 102 [2019-09-10 07:41:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:41,866 INFO L475 AbstractCegarLoop]: Abstraction has 2509 states and 3535 transitions. [2019-09-10 07:41:41,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:41:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3535 transitions. [2019-09-10 07:41:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:41:41,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:41,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:41,868 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:41,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:41,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2060125324, now seen corresponding path program 1 times [2019-09-10 07:41:41,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:41,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:41,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:41,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:41,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:41,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:41:41,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:41,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:41:41,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:41:41,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:41:41,963 INFO L87 Difference]: Start difference. First operand 2509 states and 3535 transitions. Second operand 5 states. [2019-09-10 07:41:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:42,202 INFO L93 Difference]: Finished difference Result 8091 states and 11194 transitions. [2019-09-10 07:41:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:41:42,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:41:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:42,217 INFO L225 Difference]: With dead ends: 8091 [2019-09-10 07:41:42,218 INFO L226 Difference]: Without dead ends: 8091 [2019-09-10 07:41:42,218 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 07:41:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8091 states. [2019-09-10 07:41:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8091 to 5069. [2019-09-10 07:41:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5069 states. [2019-09-10 07:41:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 7111 transitions. [2019-09-10 07:41:42,303 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 7111 transitions. Word has length 102 [2019-09-10 07:41:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:42,304 INFO L475 AbstractCegarLoop]: Abstraction has 5069 states and 7111 transitions. [2019-09-10 07:41:42,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:41:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 7111 transitions. [2019-09-10 07:41:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:41:42,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:42,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:42,308 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:42,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1870756212, now seen corresponding path program 1 times [2019-09-10 07:41:42,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:42,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:42,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:42,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:42,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:42,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:42,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:41:42,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:42,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:41:42,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:41:42,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:41:42,403 INFO L87 Difference]: Start difference. First operand 5069 states and 7111 transitions. Second operand 5 states. [2019-09-10 07:41:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:42,678 INFO L93 Difference]: Finished difference Result 13961 states and 19180 transitions. [2019-09-10 07:41:42,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:41:42,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:41:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:42,704 INFO L225 Difference]: With dead ends: 13961 [2019-09-10 07:41:42,704 INFO L226 Difference]: Without dead ends: 13961 [2019-09-10 07:41:42,705 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 07:41:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13961 states. [2019-09-10 07:41:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13961 to 8333. [2019-09-10 07:41:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8333 states. [2019-09-10 07:41:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8333 states to 8333 states and 11567 transitions. [2019-09-10 07:41:42,839 INFO L78 Accepts]: Start accepts. Automaton has 8333 states and 11567 transitions. Word has length 102 [2019-09-10 07:41:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:42,840 INFO L475 AbstractCegarLoop]: Abstraction has 8333 states and 11567 transitions. [2019-09-10 07:41:42,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:41:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 8333 states and 11567 transitions. [2019-09-10 07:41:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:41:42,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:42,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:42,844 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1130297204, now seen corresponding path program 1 times [2019-09-10 07:41:42,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:42,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:42,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:42,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:42,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:41:42,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:42,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:41:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:41:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:41:42,920 INFO L87 Difference]: Start difference. First operand 8333 states and 11567 transitions. Second operand 5 states. [2019-09-10 07:41:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:43,155 INFO L93 Difference]: Finished difference Result 17923 states and 24298 transitions. [2019-09-10 07:41:43,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:41:43,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:41:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:43,188 INFO L225 Difference]: With dead ends: 17923 [2019-09-10 07:41:43,188 INFO L226 Difference]: Without dead ends: 17923 [2019-09-10 07:41:43,188 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 07:41:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17923 states. [2019-09-10 07:41:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17923 to 10341. [2019-09-10 07:41:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10341 states. [2019-09-10 07:41:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10341 states to 10341 states and 14063 transitions. [2019-09-10 07:41:43,415 INFO L78 Accepts]: Start accepts. Automaton has 10341 states and 14063 transitions. Word has length 102 [2019-09-10 07:41:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:43,415 INFO L475 AbstractCegarLoop]: Abstraction has 10341 states and 14063 transitions. [2019-09-10 07:41:43,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:41:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 10341 states and 14063 transitions. [2019-09-10 07:41:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:41:43,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:43,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:43,420 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash 946884168, now seen corresponding path program 1 times [2019-09-10 07:41:43,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:43,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:43,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:43,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:43,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:43,502 INFO L87 Difference]: Start difference. First operand 10341 states and 14063 transitions. Second operand 3 states. [2019-09-10 07:41:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:43,556 INFO L93 Difference]: Finished difference Result 15471 states and 20776 transitions. [2019-09-10 07:41:43,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:43,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 07:41:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:43,578 INFO L225 Difference]: With dead ends: 15471 [2019-09-10 07:41:43,578 INFO L226 Difference]: Without dead ends: 15471 [2019-09-10 07:41:43,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15471 states. [2019-09-10 07:41:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15471 to 11289. [2019-09-10 07:41:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11289 states. [2019-09-10 07:41:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11289 states to 11289 states and 15271 transitions. [2019-09-10 07:41:43,738 INFO L78 Accepts]: Start accepts. Automaton has 11289 states and 15271 transitions. Word has length 103 [2019-09-10 07:41:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:43,738 INFO L475 AbstractCegarLoop]: Abstraction has 11289 states and 15271 transitions. [2019-09-10 07:41:43,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 11289 states and 15271 transitions. [2019-09-10 07:41:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:41:43,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:43,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:43,741 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1566165679, now seen corresponding path program 1 times [2019-09-10 07:41:43,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:43,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:43,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:43,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:43,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:43,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:43,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:43,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:43,809 INFO L87 Difference]: Start difference. First operand 11289 states and 15271 transitions. Second operand 3 states. [2019-09-10 07:41:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:43,857 INFO L93 Difference]: Finished difference Result 10835 states and 14480 transitions. [2019-09-10 07:41:43,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:43,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:41:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:43,873 INFO L225 Difference]: With dead ends: 10835 [2019-09-10 07:41:43,873 INFO L226 Difference]: Without dead ends: 10835 [2019-09-10 07:41:43,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10835 states. [2019-09-10 07:41:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10835 to 10833. [2019-09-10 07:41:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10833 states. [2019-09-10 07:41:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10833 states to 10833 states and 14479 transitions. [2019-09-10 07:41:44,002 INFO L78 Accepts]: Start accepts. Automaton has 10833 states and 14479 transitions. Word has length 104 [2019-09-10 07:41:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:44,002 INFO L475 AbstractCegarLoop]: Abstraction has 10833 states and 14479 transitions. [2019-09-10 07:41:44,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 10833 states and 14479 transitions. [2019-09-10 07:41:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:41:44,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:44,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:44,004 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1336267628, now seen corresponding path program 1 times [2019-09-10 07:41:44,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:44,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:44,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:44,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:44,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:44,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:44,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:44,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:44,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:44,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:44,067 INFO L87 Difference]: Start difference. First operand 10833 states and 14479 transitions. Second operand 3 states. [2019-09-10 07:41:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:44,114 INFO L93 Difference]: Finished difference Result 11871 states and 15808 transitions. [2019-09-10 07:41:44,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:44,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:41:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:44,131 INFO L225 Difference]: With dead ends: 11871 [2019-09-10 07:41:44,131 INFO L226 Difference]: Without dead ends: 11871 [2019-09-10 07:41:44,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2019-09-10 07:41:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 11869. [2019-09-10 07:41:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11869 states. [2019-09-10 07:41:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 15807 transitions. [2019-09-10 07:41:44,248 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 15807 transitions. Word has length 105 [2019-09-10 07:41:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:44,249 INFO L475 AbstractCegarLoop]: Abstraction has 11869 states and 15807 transitions. [2019-09-10 07:41:44,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 15807 transitions. [2019-09-10 07:41:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:41:44,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:44,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:44,251 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1361931859, now seen corresponding path program 1 times [2019-09-10 07:41:44,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:44,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:44,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:44,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:44,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:44,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:41:44,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:44,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:41:44,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:41:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:41:44,357 INFO L87 Difference]: Start difference. First operand 11869 states and 15807 transitions. Second operand 6 states. [2019-09-10 07:41:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:44,475 INFO L93 Difference]: Finished difference Result 17527 states and 23107 transitions. [2019-09-10 07:41:44,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:41:44,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-10 07:41:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:44,497 INFO L225 Difference]: With dead ends: 17527 [2019-09-10 07:41:44,497 INFO L226 Difference]: Without dead ends: 17527 [2019-09-10 07:41:44,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:41:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17527 states. [2019-09-10 07:41:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17527 to 12013. [2019-09-10 07:41:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12013 states. [2019-09-10 07:41:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12013 states to 12013 states and 15903 transitions. [2019-09-10 07:41:44,646 INFO L78 Accepts]: Start accepts. Automaton has 12013 states and 15903 transitions. Word has length 105 [2019-09-10 07:41:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:44,647 INFO L475 AbstractCegarLoop]: Abstraction has 12013 states and 15903 transitions. [2019-09-10 07:41:44,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:41:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12013 states and 15903 transitions. [2019-09-10 07:41:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:41:44,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:44,657 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:44,657 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:44,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:44,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1412769504, now seen corresponding path program 1 times [2019-09-10 07:41:44,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:44,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:44,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:44,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:44,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:44,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:44,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:44,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:44,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:44,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:44,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:44,746 INFO L87 Difference]: Start difference. First operand 12013 states and 15903 transitions. Second operand 3 states. [2019-09-10 07:41:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:44,801 INFO L93 Difference]: Finished difference Result 14687 states and 18968 transitions. [2019-09-10 07:41:44,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:44,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 07:41:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:44,818 INFO L225 Difference]: With dead ends: 14687 [2019-09-10 07:41:44,818 INFO L226 Difference]: Without dead ends: 14687 [2019-09-10 07:41:44,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14687 states. [2019-09-10 07:41:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14687 to 10909. [2019-09-10 07:41:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10909 states. [2019-09-10 07:41:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10909 states to 10909 states and 14103 transitions. [2019-09-10 07:41:44,952 INFO L78 Accepts]: Start accepts. Automaton has 10909 states and 14103 transitions. Word has length 131 [2019-09-10 07:41:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:44,952 INFO L475 AbstractCegarLoop]: Abstraction has 10909 states and 14103 transitions. [2019-09-10 07:41:44,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 10909 states and 14103 transitions. [2019-09-10 07:41:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:41:44,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:44,957 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:44,958 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1770437427, now seen corresponding path program 1 times [2019-09-10 07:41:44,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:44,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:44,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:44,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:41:45,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:45,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:41:45,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:45,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:41:45,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:41:45,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:41:45,102 INFO L87 Difference]: Start difference. First operand 10909 states and 14103 transitions. Second operand 6 states. [2019-09-10 07:41:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:45,386 INFO L93 Difference]: Finished difference Result 43025 states and 55409 transitions. [2019-09-10 07:41:45,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:41:45,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 07:41:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:45,436 INFO L225 Difference]: With dead ends: 43025 [2019-09-10 07:41:45,436 INFO L226 Difference]: Without dead ends: 43025 [2019-09-10 07:41:45,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:41:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43025 states. [2019-09-10 07:41:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43025 to 17893. [2019-09-10 07:41:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17893 states. [2019-09-10 07:41:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17893 states to 17893 states and 23019 transitions. [2019-09-10 07:41:45,715 INFO L78 Accepts]: Start accepts. Automaton has 17893 states and 23019 transitions. Word has length 132 [2019-09-10 07:41:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:45,715 INFO L475 AbstractCegarLoop]: Abstraction has 17893 states and 23019 transitions. [2019-09-10 07:41:45,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:41:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 17893 states and 23019 transitions. [2019-09-10 07:41:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:41:45,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:45,720 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:45,720 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:45,720 INFO L82 PathProgramCache]: Analyzing trace with hash 468797645, now seen corresponding path program 1 times [2019-09-10 07:41:45,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:45,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:45,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:45,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:45,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:45,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:45,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:45,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:41:45,851 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1709], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1935], [1940], [1943], [1947], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1991], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:41:45,909 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:45,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:46,162 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:47,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:47,014 INFO L272 AbstractInterpreter]: Visited 121 different actions 555 times. Merged at 45 different actions 375 times. Widened at 20 different actions 79 times. Performed 2182 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2182 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 14 different actions. Largest state had 271 variables. [2019-09-10 07:41:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:47,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:47,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:47,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:47,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:47,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:41:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:47,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:41:47,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:41:47,396 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:41:47,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:41:47,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:41:47,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:47,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:41:47,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:41:47,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:41:47,473 INFO L87 Difference]: Start difference. First operand 17893 states and 23019 transitions. Second operand 6 states. [2019-09-10 07:41:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:47,772 INFO L93 Difference]: Finished difference Result 50753 states and 65309 transitions. [2019-09-10 07:41:47,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:41:47,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 07:41:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:47,895 INFO L225 Difference]: With dead ends: 50753 [2019-09-10 07:41:47,895 INFO L226 Difference]: Without dead ends: 50753 [2019-09-10 07:41:47,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:41:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50753 states. [2019-09-10 07:41:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50753 to 28321. [2019-09-10 07:41:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28321 states. [2019-09-10 07:41:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28321 states to 28321 states and 36273 transitions. [2019-09-10 07:41:49,357 INFO L78 Accepts]: Start accepts. Automaton has 28321 states and 36273 transitions. Word has length 132 [2019-09-10 07:41:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:49,358 INFO L475 AbstractCegarLoop]: Abstraction has 28321 states and 36273 transitions. [2019-09-10 07:41:49,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:41:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28321 states and 36273 transitions. [2019-09-10 07:41:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:41:49,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:49,365 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:49,374 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1209256653, now seen corresponding path program 1 times [2019-09-10 07:41:49,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:49,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:49,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:49,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:49,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:49,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:41:49,537 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1709], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1918], [1921], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1991], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:41:49,542 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:49,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:49,600 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:50,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:50,050 INFO L272 AbstractInterpreter]: Visited 120 different actions 524 times. Merged at 44 different actions 362 times. Widened at 19 different actions 70 times. Performed 2202 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 16 different actions. Largest state had 271 variables. [2019-09-10 07:41:50,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:50,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:50,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:50,050 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) [2019-09-10 07:41:50,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:50,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:41:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:50,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:41:50,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:41:50,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:41:50,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:41:50,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:41:50,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:50,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:41:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:41:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:41:50,510 INFO L87 Difference]: Start difference. First operand 28321 states and 36273 transitions. Second operand 6 states. [2019-09-10 07:41:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:50,732 INFO L93 Difference]: Finished difference Result 57289 states and 73675 transitions. [2019-09-10 07:41:50,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:41:50,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 07:41:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:50,805 INFO L225 Difference]: With dead ends: 57289 [2019-09-10 07:41:50,806 INFO L226 Difference]: Without dead ends: 57289 [2019-09-10 07:41:50,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:41:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57289 states. [2019-09-10 07:41:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57289 to 35305. [2019-09-10 07:41:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35305 states. [2019-09-10 07:41:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35305 states to 35305 states and 45189 transitions. [2019-09-10 07:41:51,404 INFO L78 Accepts]: Start accepts. Automaton has 35305 states and 45189 transitions. Word has length 132 [2019-09-10 07:41:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:51,404 INFO L475 AbstractCegarLoop]: Abstraction has 35305 states and 45189 transitions. [2019-09-10 07:41:51,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:41:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 35305 states and 45189 transitions. [2019-09-10 07:41:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:41:51,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:51,410 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:51,411 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash 458609703, now seen corresponding path program 1 times [2019-09-10 07:41:51,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:51,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:51,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:51,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:51,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:41:51,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:41:51,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:41:51,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:51,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:41:51,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:41:51,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:51,686 INFO L87 Difference]: Start difference. First operand 35305 states and 45189 transitions. Second operand 3 states. [2019-09-10 07:41:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:51,796 INFO L93 Difference]: Finished difference Result 42839 states and 53560 transitions. [2019-09-10 07:41:51,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:41:51,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-10 07:41:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:51,846 INFO L225 Difference]: With dead ends: 42839 [2019-09-10 07:41:51,847 INFO L226 Difference]: Without dead ends: 42839 [2019-09-10 07:41:51,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:41:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42839 states. [2019-09-10 07:41:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42839 to 40421. [2019-09-10 07:41:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40421 states. [2019-09-10 07:41:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40421 states to 40421 states and 50991 transitions. [2019-09-10 07:41:52,423 INFO L78 Accepts]: Start accepts. Automaton has 40421 states and 50991 transitions. Word has length 133 [2019-09-10 07:41:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:52,423 INFO L475 AbstractCegarLoop]: Abstraction has 40421 states and 50991 transitions. [2019-09-10 07:41:52,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:41:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 40421 states and 50991 transitions. [2019-09-10 07:41:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:41:52,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:52,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:52,430 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:52,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:52,431 INFO L82 PathProgramCache]: Analyzing trace with hash 276122260, now seen corresponding path program 1 times [2019-09-10 07:41:52,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:52,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:52,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:52,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:52,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:52,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:52,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:52,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:41:52,567 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1709], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1957], [1962], [1965], [1971], [1973], [1976], [1991], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:41:52,570 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:52,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:52,624 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:53,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:53,217 INFO L272 AbstractInterpreter]: Visited 124 different actions 620 times. Merged at 48 different actions 433 times. Widened at 21 different actions 88 times. Performed 2473 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2473 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 49 fixpoints after 15 different actions. Largest state had 272 variables. [2019-09-10 07:41:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:53,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:53,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:53,217 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 07:41:53,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:53,239 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 07:41:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:53,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:41:53,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:41:53,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:41:53,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:41:53,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:41:53,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:41:53,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:41:53,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:41:53,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:41:53,633 INFO L87 Difference]: Start difference. First operand 40421 states and 50991 transitions. Second operand 6 states. [2019-09-10 07:41:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:41:53,835 INFO L93 Difference]: Finished difference Result 73573 states and 93175 transitions. [2019-09-10 07:41:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:41:53,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-10 07:41:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:41:53,909 INFO L225 Difference]: With dead ends: 73573 [2019-09-10 07:41:53,909 INFO L226 Difference]: Without dead ends: 73573 [2019-09-10 07:41:53,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:41:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73573 states. [2019-09-10 07:41:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73573 to 48421. [2019-09-10 07:41:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48421 states. [2019-09-10 07:41:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48421 states to 48421 states and 61055 transitions. [2019-09-10 07:41:55,469 INFO L78 Accepts]: Start accepts. Automaton has 48421 states and 61055 transitions. Word has length 133 [2019-09-10 07:41:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:41:55,469 INFO L475 AbstractCegarLoop]: Abstraction has 48421 states and 61055 transitions. [2019-09-10 07:41:55,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:41:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 48421 states and 61055 transitions. [2019-09-10 07:41:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:41:55,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:41:55,476 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:41:55,476 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:41:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1477364032, now seen corresponding path program 1 times [2019-09-10 07:41:55,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:41:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:55,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:41:55,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:41:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:55,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:55,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:41:55,766 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:41:55,767 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [199], [201], [204], [208], [210], [215], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1709], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1991], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:41:55,771 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:41:55,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:41:55,824 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:41:56,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:41:56,639 INFO L272 AbstractInterpreter]: Visited 124 different actions 864 times. Merged at 48 different actions 642 times. Widened at 23 different actions 130 times. Performed 3291 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3291 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 104 fixpoints after 21 different actions. Largest state had 272 variables. [2019-09-10 07:41:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:41:56,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:41:56,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:41:56,640 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 07:41:56,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:41:56,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:41:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:41:56,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:41:56,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:41:56,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:57,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:57,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:41:57,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:41:57,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:57,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:57,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:57,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:57,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:41:59,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:00,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:00,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 07:42:00,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:00,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:42:00,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:42:00,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:42:00,233 INFO L87 Difference]: Start difference. First operand 48421 states and 61055 transitions. Second operand 21 states. [2019-09-10 07:42:02,392 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:42:02,556 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:42:02,700 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:42:02,864 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:42:03,319 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:42:03,537 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:03,869 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:04,347 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:42:04,729 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:42:04,921 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:42:05,199 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:42:06,064 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:42:06,233 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:42:06,404 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:42:06,669 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 07:42:06,872 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:42:07,061 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:42:07,374 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:42:07,630 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:42:07,848 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:42:08,144 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:42:08,336 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:42:08,490 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:42:08,706 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:42:08,890 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:42:09,088 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:09,253 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:09,615 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:42:09,836 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:42:10,038 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:42:10,207 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:42:10,412 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:42:10,601 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:42:10,786 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:42:10,931 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:42:11,119 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:42:11,303 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:42:11,448 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:42:12,219 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:42:12,392 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:42:12,565 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:42:12,764 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:42:12,965 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:42:13,120 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:42:13,439 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:42:13,630 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:42:13,819 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:42:14,171 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:42:14,319 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:42:14,504 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:42:14,718 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:42:14,867 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:42:15,044 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:42:15,735 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 07:42:16,092 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:42:16,306 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:42:16,506 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:42:16,762 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 07:42:17,003 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:42:17,275 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:42:17,457 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:42:17,818 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:42:17,971 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:42:18,136 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:42:18,285 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:42:18,743 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:42:19,013 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:19,187 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:42:19,351 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:42:19,552 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:42:19,738 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:42:20,047 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:42:20,201 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:42:20,366 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:42:21,012 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:42:21,204 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:42:21,409 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:42:21,571 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:42:21,760 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:42:21,915 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:42:22,068 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:42:22,267 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 07:42:22,436 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:42:22,589 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:42:23,074 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:42:23,586 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:42:23,786 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:42:23,931 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 07:42:24,165 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:42:24,346 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 07:42:24,550 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:42:24,718 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:42:25,553 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:42:25,747 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:42:26,086 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:42:26,274 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:42:26,458 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:42:26,867 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:42:27,805 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:42:28,011 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:42:28,200 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:42:28,413 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:42:28,573 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:42:28,781 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:42:29,158 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:29,359 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:42:29,569 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:42:29,787 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:42:29,934 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:42:30,148 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:42:30,356 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:42:30,581 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 07:42:30,736 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:42:30,905 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 07:42:31,257 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:42:31,570 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:42:31,774 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 07:42:31,945 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:42:32,122 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:42:32,419 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:42:32,629 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:42:32,795 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:42:32,980 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:42:33,480 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 07:42:33,632 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 07:42:33,824 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:42:34,004 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:34,182 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:42:34,343 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:42:34,558 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:42:34,751 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:42:34,927 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:42:35,132 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:42:35,334 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:35,547 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:42:35,761 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:42:35,922 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:42:36,134 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:42:36,356 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:42:36,532 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:42:36,963 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:42:37,182 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 07:42:37,416 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 07:42:37,610 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:42:37,901 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:42:38,062 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:42:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:38,368 INFO L93 Difference]: Finished difference Result 371347 states and 455869 transitions. [2019-09-10 07:42:38,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2019-09-10 07:42:38,369 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 134 [2019-09-10 07:42:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:38,768 INFO L225 Difference]: With dead ends: 371347 [2019-09-10 07:42:38,768 INFO L226 Difference]: Without dead ends: 371347 [2019-09-10 07:42:38,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 217 SyntacticMatches, 34 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20581 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=8508, Invalid=45548, Unknown=0, NotChecked=0, Total=54056 [2019-09-10 07:42:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371347 states. [2019-09-10 07:42:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371347 to 146803. [2019-09-10 07:42:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146803 states. [2019-09-10 07:42:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146803 states to 146803 states and 183757 transitions. [2019-09-10 07:42:43,617 INFO L78 Accepts]: Start accepts. Automaton has 146803 states and 183757 transitions. Word has length 134 [2019-09-10 07:42:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:43,617 INFO L475 AbstractCegarLoop]: Abstraction has 146803 states and 183757 transitions. [2019-09-10 07:42:43,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:42:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 146803 states and 183757 transitions. [2019-09-10 07:42:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 07:42:43,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:43,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:43,635 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1278379019, now seen corresponding path program 1 times [2019-09-10 07:42:43,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:43,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:43,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:42:43,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:42:43,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:42:43,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:42:43,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:42:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:42:43,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:42:43,782 INFO L87 Difference]: Start difference. First operand 146803 states and 183757 transitions. Second operand 9 states. [2019-09-10 07:42:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:42:44,587 INFO L93 Difference]: Finished difference Result 219225 states and 274865 transitions. [2019-09-10 07:42:44,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:42:44,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 07:42:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:42:44,823 INFO L225 Difference]: With dead ends: 219225 [2019-09-10 07:42:44,823 INFO L226 Difference]: Without dead ends: 219225 [2019-09-10 07:42:44,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:42:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219225 states. [2019-09-10 07:42:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219225 to 146803. [2019-09-10 07:42:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146803 states. [2019-09-10 07:42:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146803 states to 146803 states and 183752 transitions. [2019-09-10 07:42:49,153 INFO L78 Accepts]: Start accepts. Automaton has 146803 states and 183752 transitions. Word has length 135 [2019-09-10 07:42:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:42:49,153 INFO L475 AbstractCegarLoop]: Abstraction has 146803 states and 183752 transitions. [2019-09-10 07:42:49,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:42:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 146803 states and 183752 transitions. [2019-09-10 07:42:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:42:49,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:42:49,172 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:42:49,172 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:42:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash 445688151, now seen corresponding path program 1 times [2019-09-10 07:42:49,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:42:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:49,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:42:49,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:42:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:49,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:49,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:42:49,491 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2019-09-10 07:42:49,491 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [199], [201], [204], [208], [210], [215], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1236], [1274], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1991], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:42:49,496 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:42:49,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:42:49,585 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:42:50,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:42:50,465 INFO L272 AbstractInterpreter]: Visited 127 different actions 873 times. Merged at 48 different actions 648 times. Widened at 24 different actions 135 times. Performed 3295 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3295 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 104 fixpoints after 20 different actions. Largest state had 272 variables. [2019-09-10 07:42:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:42:50,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:42:50,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:42:50,466 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:42:50,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:42:50,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:42:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:42:51,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:42:51,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:42:51,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:51,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:51,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:51,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:51,561 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:42:51,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:51,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:51,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:51,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:51,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:52,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:42:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:42:52,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:42:52,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2019-09-10 07:42:52,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:42:52,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:42:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:42:52,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:42:52,710 INFO L87 Difference]: Start difference. First operand 146803 states and 183752 transitions. Second operand 21 states. [2019-09-10 07:42:56,186 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 07:42:56,352 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 07:42:56,962 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:42:57,600 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:42:57,945 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:42:58,187 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 07:42:58,505 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:42:58,909 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:42:59,308 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:43:00,002 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:43:00,177 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:43:00,896 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:43:01,157 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:43:02,214 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:43:02,397 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:43:02,903 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:43:03,062 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:43:03,222 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:43:03,389 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:43:04,740 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 07:43:04,943 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 07:43:06,152 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 07:43:06,374 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 07:43:06,555 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:43:06,718 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:43:06,895 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:43:07,084 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:43:07,363 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 07:43:07,510 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:43:08,120 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:43:08,275 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:43:08,480 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:43:08,660 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 07:43:08,836 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 07:43:09,031 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:43:09,249 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:43:09,778 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:43:09,942 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 07:43:10,678 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:43:10,986 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:43:11,316 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:43:11,652 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:43:12,542 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:43:14,578 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:43:14,960 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:43:15,133 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:43:15,338 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 07:43:15,510 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-09-10 07:43:16,364 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 07:43:18,367 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:43:18,536 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:43:18,990 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 07:43:19,164 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:43:19,329 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 07:43:19,481 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-10 07:43:19,646 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-10 07:43:19,803 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 07:43:20,000 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:43:20,185 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-10 07:43:20,402 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:43:20,581 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:43:21,048 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 07:43:21,235 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 07:43:22,308 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 07:43:22,466 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-10 07:43:22,894 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 07:43:23,049 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 07:43:23,511 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:43:23,688 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:43:24,167 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:43:25,209 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:43:26,219 WARN L188 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:43:26,805 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-10 07:43:27,088 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:43:27,233 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-10 07:43:27,607 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-10 07:43:27,768 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:43:28,683 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-10 07:43:29,075 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 07:43:29,434 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-10 07:43:29,581 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 07:43:29,763 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:43:30,117 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 07:43:30,303 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:43:30,461 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:43:30,653 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-10 07:43:30,799 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-10 07:43:31,112 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:43:31,457 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-10 07:43:32,018 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 07:43:32,174 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 07:43:32,798 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:43:32,956 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:43:33,321 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 07:43:33,931 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:43:34,079 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 07:43:34,262 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:43:34,730 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-10 07:43:34,912 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:43:35,106 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:43:35,268 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:43:35,476 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:43:35,725 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-10 07:43:35,924 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 07:43:36,924 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:43:37,211 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:43:37,436 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-09-10 07:43:37,770 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:43:38,589 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 07:43:38,780 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-10 07:43:39,731 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 07:43:39,943 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:43:40,155 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-10 07:43:40,646 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-10 07:43:41,068 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 07:43:41,434 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:43:42,458 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:43:42,625 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-10 07:43:42,830 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 07:43:43,205 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:43:43,366 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:43:43,787 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-10 07:43:43,977 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:43:44,187 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:43:44,394 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 07:43:44,586 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-10 07:43:45,391 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-10 07:43:45,553 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 07:43:45,787 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:43:45,973 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:43:46,147 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-10 07:43:46,302 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 07:43:46,517 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:43:46,907 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 07:43:47,354 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:43:47,528 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:43:48,086 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:43:48,594 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:43:48,890 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 07:43:49,053 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:43:49,465 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:43:49,711 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-10 07:43:49,937 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:43:50,102 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:43:50,273 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:43:50,559 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-10 07:43:51,224 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:43:51,407 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:43:51,632 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 07:43:52,275 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:43:52,444 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:43:52,666 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-10 07:43:53,187 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:43:53,343 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:43:53,801 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 07:43:54,173 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:43:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:43:55,952 INFO L93 Difference]: Finished difference Result 797797 states and 977462 transitions. [2019-09-10 07:43:55,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 358 states. [2019-09-10 07:43:55,952 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 137 [2019-09-10 07:43:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:43:56,910 INFO L225 Difference]: With dead ends: 797797 [2019-09-10 07:43:56,910 INFO L226 Difference]: Without dead ends: 797797 [2019-09-10 07:43:56,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 236 SyntacticMatches, 19 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61953 ImplicationChecksByTransitivity, 52.2s TimeCoverageRelationStatistics Valid=16597, Invalid=132785, Unknown=0, NotChecked=0, Total=149382 [2019-09-10 07:43:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797797 states. [2019-09-10 07:44:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797797 to 216585. [2019-09-10 07:44:07,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216585 states. [2019-09-10 07:44:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216585 states to 216585 states and 269608 transitions. [2019-09-10 07:44:07,488 INFO L78 Accepts]: Start accepts. Automaton has 216585 states and 269608 transitions. Word has length 137 [2019-09-10 07:44:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:44:07,488 INFO L475 AbstractCegarLoop]: Abstraction has 216585 states and 269608 transitions. [2019-09-10 07:44:07,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:44:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 216585 states and 269608 transitions. [2019-09-10 07:44:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 07:44:07,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:44:07,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:44:07,503 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:44:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:07,504 INFO L82 PathProgramCache]: Analyzing trace with hash 744662228, now seen corresponding path program 1 times [2019-09-10 07:44:07,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:44:07,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:07,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:07,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:44:07,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:44:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:07,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:07,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:44:07,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2019-09-10 07:44:07,832 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1236], [1274], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1935], [1940], [1943], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:44:07,834 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:44:07,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:44:07,888 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:44:09,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:44:09,332 INFO L272 AbstractInterpreter]: Visited 129 different actions 672 times. Merged at 50 different actions 479 times. Widened at 20 different actions 94 times. Performed 2589 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2589 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 14 different actions. Largest state had 272 variables. [2019-09-10 07:44:09,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:44:09,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:44:09,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:44:09,333 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:44:09,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:44:09,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:44:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:44:09,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:44:09,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:44:09,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:09,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:09,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:09,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:09,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:44:10,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:44:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:44:10,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:44:10,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 07:44:10,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:44:10,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:44:10,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:44:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:44:10,475 INFO L87 Difference]: Start difference. First operand 216585 states and 269608 transitions. Second operand 21 states. [2019-09-10 07:44:10,662 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:44:12,476 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-10 07:44:12,806 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:44:13,504 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:44:13,839 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:44:13,995 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:44:14,196 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:14,470 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-10 07:44:14,699 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 07:44:14,848 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 07:44:15,024 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:44:15,515 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:44:15,686 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:15,858 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 07:44:16,383 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 07:44:16,823 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 07:44:16,995 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:44:17,438 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-09-10 07:44:17,853 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:44:18,256 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 07:44:19,047 WARN L188 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 07:44:19,275 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-09-10 07:44:19,491 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-09-10 07:44:19,696 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:19,994 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:44:20,222 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:44:20,421 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:44:20,758 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 07:44:20,989 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:21,159 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:44:21,365 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:21,533 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:44:21,713 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:21,906 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 07:44:22,130 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:22,366 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 07:44:22,618 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 07:44:23,032 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-09-10 07:44:23,437 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 07:44:23,669 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:44:23,902 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 07:44:24,093 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:24,360 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-09-10 07:44:24,591 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 07:44:24,882 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:25,131 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-09-10 07:44:25,402 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-10 07:44:25,729 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-09-10 07:44:26,197 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:44:26,606 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-09-10 07:44:27,098 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 07:44:28,040 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:44:28,251 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:44:28,444 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:28,619 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 07:44:28,857 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-09-10 07:44:29,127 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-09-10 07:44:29,413 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:44:29,591 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 07:44:29,820 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-09-10 07:44:30,657 WARN L188 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-09-10 07:44:30,945 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-10 07:44:31,211 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-09-10 07:44:31,446 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-10 07:44:31,614 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-10 07:44:31,988 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:44:32,222 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-09-10 07:44:32,452 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:32,665 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 07:44:34,568 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:44:34,767 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:44:34,972 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:44:35,205 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:44:35,578 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:35,768 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 07:44:35,950 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:44:36,103 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 07:44:36,356 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-09-10 07:44:36,583 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-09-10 07:44:36,808 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 07:44:36,974 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:44:37,681 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:44:37,967 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-10 07:44:38,188 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:44:38,355 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 07:44:38,631 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-09-10 07:44:38,876 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-09-10 07:44:39,118 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 07:44:39,315 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:44:39,635 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 07:44:39,906 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-09-10 07:44:40,929 WARN L188 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-09-10 07:44:41,168 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-09-10 07:44:41,400 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:44:41,597 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:41,811 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 07:44:41,987 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 07:44:42,167 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 07:44:42,429 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-09-10 07:44:42,726 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-09-10 07:44:42,957 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-09-10 07:44:43,217 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-09-10 07:44:43,486 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-09-10 07:44:43,785 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 07:44:44,299 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:44,455 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 07:44:44,669 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-09-10 07:44:44,878 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-10 07:44:45,047 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:45,246 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:45,427 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 07:44:45,651 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-09-10 07:44:45,915 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-09-10 07:44:46,127 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-10 07:44:46,382 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-09-10 07:44:46,640 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-09-10 07:44:46,870 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-09-10 07:44:47,054 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 07:44:47,214 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 07:44:47,439 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-10 07:44:47,654 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-10 07:44:47,843 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 07:44:48,002 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-09-10 07:44:48,355 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:44:48,509 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:44:48,741 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-09-10 07:44:48,943 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:44:49,129 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:44:49,379 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-09-10 07:44:49,603 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-10 07:44:49,893 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-09-10 07:44:50,860 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-09-10 07:44:51,211 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-10 07:44:51,414 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2019-09-10 07:44:51,635 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 07:44:51,837 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 07:44:52,163 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 07:44:52,420 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 07:44:52,681 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-09-10 07:44:52,898 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:44:53,155 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 07:44:53,410 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-10 07:44:53,620 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 07:44:53,811 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:44:53,984 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 07:44:54,135 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:44:54,342 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:44:54,602 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-10 07:44:54,815 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-09-10 07:44:55,086 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-09-10 07:44:55,391 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-09-10 07:44:55,587 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 07:44:55,814 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 07:44:56,812 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-10 07:44:57,034 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 07:44:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:44:59,778 INFO L93 Difference]: Finished difference Result 1288941 states and 1574570 transitions. [2019-09-10 07:44:59,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2019-09-10 07:44:59,778 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2019-09-10 07:44:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:45:10,014 INFO L225 Difference]: With dead ends: 1288941 [2019-09-10 07:45:10,014 INFO L226 Difference]: Without dead ends: 1288941 [2019-09-10 07:45:10,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17248 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=7424, Invalid=41638, Unknown=0, NotChecked=0, Total=49062 [2019-09-10 07:45:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288941 states. [2019-09-10 07:45:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288941 to 549997. [2019-09-10 07:45:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549997 states. [2019-09-10 07:45:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549997 states to 549997 states and 679600 transitions. [2019-09-10 07:45:20,325 INFO L78 Accepts]: Start accepts. Automaton has 549997 states and 679600 transitions. Word has length 138 [2019-09-10 07:45:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:45:20,326 INFO L475 AbstractCegarLoop]: Abstraction has 549997 states and 679600 transitions. [2019-09-10 07:45:20,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:45:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 549997 states and 679600 transitions. [2019-09-10 07:45:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 07:45:20,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:45:20,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:45:20,362 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:45:20,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:20,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1503700721, now seen corresponding path program 1 times [2019-09-10 07:45:20,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:45:20,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:20,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:20,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:45:20,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:45:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:21,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:21,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:45:21,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2019-09-10 07:45:21,218 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [306], [361], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1935], [1940], [1943], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:45:21,221 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:45:21,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:45:21,268 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:45:21,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:45:21,982 INFO L272 AbstractInterpreter]: Visited 129 different actions 721 times. Merged at 50 different actions 524 times. Widened at 20 different actions 106 times. Performed 2783 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2783 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 52 fixpoints after 16 different actions. Largest state had 272 variables. [2019-09-10 07:45:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:45:21,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:45:21,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:45:21,983 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:45:22,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:45:22,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:45:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:45:22,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:45:22,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:45:22,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:22,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:22,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:22,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:23,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:45:23,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:24,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:24,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:24,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:24,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:25,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:45:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:45:25,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:45:25,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12, 12] total 42 [2019-09-10 07:45:25,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:45:25,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:45:25,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:45:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:45:25,315 INFO L87 Difference]: Start difference. First operand 549997 states and 679600 transitions. Second operand 32 states. [2019-09-10 07:45:25,515 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 07:45:26,337 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 07:45:26,514 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 07:45:26,706 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:45:26,932 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-09-10 07:45:27,105 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-10 07:45:27,306 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 07:45:28,520 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 07:45:28,928 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:45:33,172 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:45:36,313 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:45:36,456 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:45:36,788 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:45:37,102 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 07:45:37,859 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-10 07:45:38,141 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 07:45:38,300 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:45:38,450 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 07:45:39,731 WARN L188 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 07:45:40,104 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 07:45:40,335 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:45:41,007 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 07:45:41,721 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 07:45:43,913 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:45:44,148 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:45:44,307 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:45:44,842 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 07:45:44,994 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 07:45:45,175 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:45:45,330 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:45:45,869 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 07:45:46,335 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:45:46,490 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:45:46,651 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 07:45:47,363 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 07:45:47,507 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 07:45:55,791 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 07:45:57,441 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 07:45:57,595 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-09-10 07:45:59,767 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:45:59,921 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:46:00,608 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:46:00,785 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 07:46:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:18,189 INFO L93 Difference]: Finished difference Result 2889169 states and 3557458 transitions. [2019-09-10 07:46:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-10 07:46:18,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 138 [2019-09-10 07:46:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:33,732 INFO L225 Difference]: With dead ends: 2889169 [2019-09-10 07:46:33,733 INFO L226 Difference]: Without dead ends: 2889169 [2019-09-10 07:46:33,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 237 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17375 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=6120, Invalid=41186, Unknown=0, NotChecked=0, Total=47306 [2019-09-10 07:46:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889169 states. [2019-09-10 07:46:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889169 to 549954. [2019-09-10 07:46:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549954 states. [2019-09-10 07:47:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549954 states to 549954 states and 679556 transitions. [2019-09-10 07:47:00,008 INFO L78 Accepts]: Start accepts. Automaton has 549954 states and 679556 transitions. Word has length 138 [2019-09-10 07:47:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:00,008 INFO L475 AbstractCegarLoop]: Abstraction has 549954 states and 679556 transitions. [2019-09-10 07:47:00,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:47:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 549954 states and 679556 transitions. [2019-09-10 07:47:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 07:47:00,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:00,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:00,034 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1663123414, now seen corresponding path program 1 times [2019-09-10 07:47:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:00,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:00,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:00,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:00,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:00,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:00,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:00,394 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2019-09-10 07:47:00,394 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [146], [193], [196], [201], [204], [208], [221], [223], [252], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1957], [1962], [1965], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:47:00,399 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:00,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:00,444 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:01,019 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:01,019 INFO L272 AbstractInterpreter]: Visited 129 different actions 697 times. Merged at 50 different actions 501 times. Widened at 19 different actions 93 times. Performed 2672 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2672 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 52 fixpoints after 15 different actions. Largest state had 272 variables. [2019-09-10 07:47:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:01,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:01,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:01,020 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:47:01,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:01,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:47:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:02,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:47:02,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:02,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:03,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:03,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:03,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:04,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:04,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:04,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 34 [2019-09-10 07:47:04,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:04,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 07:47:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 07:47:04,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:47:04,968 INFO L87 Difference]: Start difference. First operand 549954 states and 679556 transitions. Second operand 24 states. [2019-09-10 07:47:05,243 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:47:05,993 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 07:47:06,363 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:47:06,656 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:47:06,882 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:47:07,394 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:47:07,834 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:47:08,215 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:47:08,525 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:47:08,882 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:47:09,510 WARN L188 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:47:15,021 WARN L188 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:47:15,588 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:47:15,896 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:47:16,300 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 07:47:16,692 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:47:17,053 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:47:17,379 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:47:17,928 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:47:18,560 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:47:19,105 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 07:47:19,825 WARN L188 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:47:20,224 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:47:20,606 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:47:21,019 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 07:47:21,452 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:47:23,678 WARN L188 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:47:24,029 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:47:24,632 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-10 07:47:25,004 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-10 07:47:25,728 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 07:47:26,109 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 07:47:26,589 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:47:27,081 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:47:27,408 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 07:47:27,731 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 07:47:28,200 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-09-10 07:47:28,775 WARN L188 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-09-10 07:47:29,263 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:47:29,611 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:47:30,180 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:47:30,569 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-10 07:47:31,013 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-10 07:47:31,565 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-10 07:47:32,075 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 07:47:32,456 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 07:47:32,930 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:47:33,222 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:47:33,766 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-10 07:47:34,106 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 07:47:34,497 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 07:47:34,816 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:47:35,216 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 07:47:35,546 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 07:47:36,040 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 07:47:36,670 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:47:37,164 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:47:37,945 WARN L188 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:47:38,354 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 07:47:38,863 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 07:47:39,174 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 07:47:39,611 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-09-10 07:47:40,004 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:47:40,499 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:47:40,827 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:47:41,072 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:47:41,405 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:47:41,762 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:47:42,043 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:47:42,275 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 07:47:42,824 WARN L188 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:47:43,061 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:47:43,332 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:47:43,676 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 07:47:44,059 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 07:47:44,407 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 07:47:44,694 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:47:45,179 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:47:45,525 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 07:47:45,849 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:47:46,197 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:47:46,547 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:47:46,975 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:47:47,327 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:47:47,698 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:47:48,092 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-10 07:47:48,523 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:47:48,759 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 07:47:49,591 WARN L188 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 07:47:50,179 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:47:50,718 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-10 07:47:51,303 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:47:51,787 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:47:52,197 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 07:47:52,606 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 07:47:53,289 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-10 07:47:53,761 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 07:47:54,431 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:47:55,095 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 07:47:55,481 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:47:55,934 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 07:47:57,363 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:47:57,992 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-09-10 07:47:58,455 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:47:58,943 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:47:59,292 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:47:59,873 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:48:00,343 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:48:00,684 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:48:01,053 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:48:01,377 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:48:01,826 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-09-10 07:48:02,214 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:48:02,693 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:48:03,332 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-10 07:48:03,793 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:48:04,165 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:48:04,590 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:48:05,046 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:48:05,769 WARN L188 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:48:06,169 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:48:06,588 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:48:07,133 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 07:48:07,427 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:48:07,759 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:48:08,131 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:48:08,466 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 07:48:08,886 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:48:09,536 WARN L188 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:48:09,800 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:48:10,484 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:48:11,128 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:48:12,715 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:48:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:32,639 INFO L93 Difference]: Finished difference Result 2967363 states and 3610736 transitions. [2019-09-10 07:48:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-10 07:48:32,639 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 138 [2019-09-10 07:48:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:46,053 INFO L225 Difference]: With dead ends: 2967363 [2019-09-10 07:48:46,054 INFO L226 Difference]: Without dead ends: 2967363 [2019-09-10 07:48:46,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 238 SyntacticMatches, 20 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10179 ImplicationChecksByTransitivity, 60.2s TimeCoverageRelationStatistics Valid=6141, Invalid=22589, Unknown=0, NotChecked=0, Total=28730 [2019-09-10 07:48:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967363 states. [2019-09-10 07:49:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967363 to 615046. [2019-09-10 07:49:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615046 states. [2019-09-10 07:49:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615046 states to 615046 states and 758666 transitions. [2019-09-10 07:49:15,930 INFO L78 Accepts]: Start accepts. Automaton has 615046 states and 758666 transitions. Word has length 138 [2019-09-10 07:49:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:15,930 INFO L475 AbstractCegarLoop]: Abstraction has 615046 states and 758666 transitions. [2019-09-10 07:49:15,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 07:49:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 615046 states and 758666 transitions. [2019-09-10 07:49:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:49:15,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:15,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:15,952 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2129744109, now seen corresponding path program 1 times [2019-09-10 07:49:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:15,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:16,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:16,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:16,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 07:49:16,399 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1683], [1705], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1916], [1927], [1929], [1932], [1935], [1938], [1949], [1951], [1954], [1957], [1962], [1965], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:49:16,401 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:16,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:16,446 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:18,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:18,668 INFO L272 AbstractInterpreter]: Visited 131 different actions 708 times. Merged at 52 different actions 517 times. Widened at 16 different actions 77 times. Performed 2714 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2714 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 55 fixpoints after 13 different actions. Largest state had 272 variables. [2019-09-10 07:49:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:18,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:18,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:18,669 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:49:18,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:18,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:49:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:18,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:49:18,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:19,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:19,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:19,768 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:20,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:20,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:20,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:20,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:20,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:49:20,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2019-09-10 07:49:20,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:49:20,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:49:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:49:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1918, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 07:49:20,871 INFO L87 Difference]: Start difference. First operand 615046 states and 758666 transitions. Second operand 32 states. [2019-09-10 07:49:25,059 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:49:25,252 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:49:25,521 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:49:29,502 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:49:30,023 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:49:31,143 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:49:31,397 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:49:32,033 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:49:32,369 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:49:32,687 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:49:32,932 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:49:33,533 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:49:33,922 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:49:34,284 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 07:49:34,591 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:49:35,240 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:49:36,996 WARN L188 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:49:37,339 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:49:37,600 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:49:39,191 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:49:40,066 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 07:49:40,463 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:49:40,883 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 07:49:41,419 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:49:42,074 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:49:42,509 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:49:42,849 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:49:43,520 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:49:43,981 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:49:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:47,296 INFO L93 Difference]: Finished difference Result 1558559 states and 1900269 transitions. [2019-09-10 07:49:47,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 07:49:47,297 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 140 [2019-09-10 07:49:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:50,837 INFO L225 Difference]: With dead ends: 1558559 [2019-09-10 07:49:50,838 INFO L226 Difference]: Without dead ends: 1558559 [2019-09-10 07:49:50,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2653 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=1826, Invalid=10164, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 07:49:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558559 states. [2019-09-10 07:50:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558559 to 876003. [2019-09-10 07:50:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876003 states. [2019-09-10 07:50:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876003 states to 876003 states and 1076919 transitions. [2019-09-10 07:50:25,278 INFO L78 Accepts]: Start accepts. Automaton has 876003 states and 1076919 transitions. Word has length 140 [2019-09-10 07:50:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:25,278 INFO L475 AbstractCegarLoop]: Abstraction has 876003 states and 1076919 transitions. [2019-09-10 07:50:25,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:50:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 876003 states and 1076919 transitions. [2019-09-10 07:50:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:50:25,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:25,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:50:25,299 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 640534835, now seen corresponding path program 1 times [2019-09-10 07:50:25,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:25,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:25,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:25,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:25,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:25,700 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 07:50:25,700 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1683], [1705], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1916], [1927], [1929], [1932], [1935], [1940], [1943], [1949], [1951], [1954], [1957], [1960], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:50:25,702 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:25,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:25,746 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:26,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:26,175 INFO L272 AbstractInterpreter]: Visited 131 different actions 557 times. Merged at 52 different actions 382 times. Widened at 14 different actions 41 times. Performed 2322 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2322 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 10 different actions. Largest state had 272 variables. [2019-09-10 07:50:26,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:26,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:26,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:26,175 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:27,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:27,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:50:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:28,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 07:50:28,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:28,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:28,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:28,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:28,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:29,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:50:29,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:29,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:29,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:30,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:30,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:30,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:30,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:30,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:30,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:30,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:30,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:30,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:50:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 41 [2019-09-10 07:50:30,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:30,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 07:50:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 07:50:30,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1495, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:50:30,921 INFO L87 Difference]: Start difference. First operand 876003 states and 1076919 transitions. Second operand 28 states. [2019-09-10 07:50:33,982 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:50:34,549 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:50:36,430 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:50:38,355 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:50:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:42,684 INFO L93 Difference]: Finished difference Result 1305175 states and 1593848 transitions. [2019-09-10 07:50:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 07:50:42,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 140 [2019-09-10 07:50:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:46,131 INFO L225 Difference]: With dead ends: 1305175 [2019-09-10 07:50:46,131 INFO L226 Difference]: Without dead ends: 1305175 [2019-09-10 07:50:46,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 242 SyntacticMatches, 14 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=558, Invalid=3474, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 07:50:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305175 states. [2019-09-10 07:51:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305175 to 997715. [2019-09-10 07:51:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997715 states.