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.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:46:37,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:46:37,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:46:38,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:46:38,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:46:38,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:46:38,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:46:38,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:46:38,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:46:38,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:46:38,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:46:38,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:46:38,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:46:38,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:46:38,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:46:38,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:46:38,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:46:38,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:46:38,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:46:38,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:46:38,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:46:38,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:46:38,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:46:38,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:46:38,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:46:38,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:46:38,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:46:38,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:46:38,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:46:38,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:46:38,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:46:38,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:46:38,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:46:38,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:46:38,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:46:38,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:46:38,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:46:38,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:46:38,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:46:38,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:46:38,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:46:38,032 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:46:38,053 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:46:38,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:46:38,054 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:46:38,054 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:46:38,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:46:38,057 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:46:38,058 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:46:38,058 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:46:38,058 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:46:38,058 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:46:38,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:46:38,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:46:38,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:46:38,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:46:38,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:46:38,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:46:38,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:46:38,061 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:46:38,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:46:38,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:46:38,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:46:38,062 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:46:38,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:46:38,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:46:38,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:46:38,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:46:38,063 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:46:38,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:46:38,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:46:38,064 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:46:38,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:46:38,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:46:38,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:46:38,132 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:46:38,132 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:46:38,133 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.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:46:38,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7f7b812/2033ffdfab984c9d812ffc93df4b722c/FLAG45f3dfdc4 [2019-09-10 07:46:38,811 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:46:38,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:46:38,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7f7b812/2033ffdfab984c9d812ffc93df4b722c/FLAG45f3dfdc4 [2019-09-10 07:46:39,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7f7b812/2033ffdfab984c9d812ffc93df4b722c [2019-09-10 07:46:39,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:46:39,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:46:39,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:46:39,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:46:39,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:46:39,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:46:39" (1/1) ... [2019-09-10 07:46:39,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4741b8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:39, skipping insertion in model container [2019-09-10 07:46:39,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:46:39" (1/1) ... [2019-09-10 07:46:39,054 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:46:39,148 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:46:39,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:46:39,897 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:46:40,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:46:40,285 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:46:40,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40 WrapperNode [2019-09-10 07:46:40,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:46:40,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:46:40,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:46:40,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:46:40,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40" (1/1) ... [2019-09-10 07:46:40,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40" (1/1) ... [2019-09-10 07:46:40,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40" (1/1) ... [2019-09-10 07:46:40,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40" (1/1) ... [2019-09-10 07:46:40,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40" (1/1) ... [2019-09-10 07:46:40,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40" (1/1) ... [2019-09-10 07:46:40,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40" (1/1) ... [2019-09-10 07:46:40,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:46:40,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:46:40,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:46:40,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:46:40,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40" (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:46:40,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:46:40,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:46:40,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:46:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:46:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:46:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:46:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:46:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:46:42,431 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:46:42,431 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:46:42,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:46:42 BoogieIcfgContainer [2019-09-10 07:46:42,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:46:42,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:46:42,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:46:42,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:46:42,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:46:39" (1/3) ... [2019-09-10 07:46:42,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8f217a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:46:42, skipping insertion in model container [2019-09-10 07:46:42,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:46:40" (2/3) ... [2019-09-10 07:46:42,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8f217a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:46:42, skipping insertion in model container [2019-09-10 07:46:42,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:46:42" (3/3) ... [2019-09-10 07:46:42,440 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:46:42,450 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:46:42,459 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-10 07:46:42,475 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-10 07:46:42,503 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:46:42,503 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:46:42,503 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:46:42,504 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:46:42,504 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:46:42,504 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:46:42,504 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:46:42,504 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:46:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states. [2019-09-10 07:46:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:46:42,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:42,564 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] [2019-09-10 07:46:42,566 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:42,572 INFO L82 PathProgramCache]: Analyzing trace with hash -221233155, now seen corresponding path program 1 times [2019-09-10 07:46:42,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:42,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:42,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:43,088 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:46:43,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:43,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:46:43,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:43,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:46:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:46:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:46:43,115 INFO L87 Difference]: Start difference. First operand 542 states. Second operand 5 states. [2019-09-10 07:46:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:44,006 INFO L93 Difference]: Finished difference Result 619 states and 1031 transitions. [2019-09-10 07:46:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:46:44,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-10 07:46:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:44,031 INFO L225 Difference]: With dead ends: 619 [2019-09-10 07:46:44,031 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 07:46:44,035 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:46:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 07:46:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 549. [2019-09-10 07:46:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-10 07:46:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 724 transitions. [2019-09-10 07:46:44,125 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 724 transitions. Word has length 63 [2019-09-10 07:46:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:44,125 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 724 transitions. [2019-09-10 07:46:44,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:46:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 724 transitions. [2019-09-10 07:46:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:46:44,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:44,130 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] [2019-09-10 07:46:44,131 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:44,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:44,131 INFO L82 PathProgramCache]: Analyzing trace with hash -490750818, now seen corresponding path program 1 times [2019-09-10 07:46:44,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:44,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:44,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:44,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:44,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:44,373 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:46:44,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:44,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:46:44,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:44,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:46:44,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:46:44,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:46:44,383 INFO L87 Difference]: Start difference. First operand 549 states and 724 transitions. Second operand 5 states. [2019-09-10 07:46:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:44,661 INFO L93 Difference]: Finished difference Result 405 states and 535 transitions. [2019-09-10 07:46:44,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:46:44,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-10 07:46:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:44,666 INFO L225 Difference]: With dead ends: 405 [2019-09-10 07:46:44,666 INFO L226 Difference]: Without dead ends: 405 [2019-09-10 07:46:44,667 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:46:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-10 07:46:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2019-09-10 07:46:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 07:46:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 535 transitions. [2019-09-10 07:46:44,695 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 535 transitions. Word has length 63 [2019-09-10 07:46:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:44,696 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 535 transitions. [2019-09-10 07:46:44,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:46:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 535 transitions. [2019-09-10 07:46:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:46:44,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:44,704 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:44,704 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash 556502945, now seen corresponding path program 1 times [2019-09-10 07:46:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:44,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:44,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:44,975 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:46:44,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:44,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:46:44,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:44,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:46:44,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:46:44,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:46:44,979 INFO L87 Difference]: Start difference. First operand 405 states and 535 transitions. Second operand 6 states. [2019-09-10 07:46:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:45,336 INFO L93 Difference]: Finished difference Result 552 states and 729 transitions. [2019-09-10 07:46:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:46:45,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-10 07:46:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:45,341 INFO L225 Difference]: With dead ends: 552 [2019-09-10 07:46:45,341 INFO L226 Difference]: Without dead ends: 552 [2019-09-10 07:46:45,342 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:46:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-10 07:46:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 512. [2019-09-10 07:46:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-10 07:46:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 696 transitions. [2019-09-10 07:46:45,358 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 696 transitions. Word has length 63 [2019-09-10 07:46:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:45,359 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 696 transitions. [2019-09-10 07:46:45,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:46:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 696 transitions. [2019-09-10 07:46:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:46:45,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:45,360 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:46:45,361 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1040476392, now seen corresponding path program 1 times [2019-09-10 07:46:45,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:45,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:45,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:45,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:45,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:45,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:46:45,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:45,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:46:45,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:45,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:46:45,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:46:45,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:46:45,476 INFO L87 Difference]: Start difference. First operand 512 states and 696 transitions. Second operand 5 states. [2019-09-10 07:46:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:45,675 INFO L93 Difference]: Finished difference Result 464 states and 631 transitions. [2019-09-10 07:46:45,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:46:45,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 07:46:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:45,679 INFO L225 Difference]: With dead ends: 464 [2019-09-10 07:46:45,679 INFO L226 Difference]: Without dead ends: 464 [2019-09-10 07:46:45,679 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:46:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-10 07:46:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-10 07:46:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 631 transitions. [2019-09-10 07:46:45,693 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 631 transitions. Word has length 64 [2019-09-10 07:46:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:45,693 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 631 transitions. [2019-09-10 07:46:45,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:46:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 631 transitions. [2019-09-10 07:46:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:46:45,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:45,695 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:45,696 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:45,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:45,697 INFO L82 PathProgramCache]: Analyzing trace with hash 811942748, now seen corresponding path program 1 times [2019-09-10 07:46:45,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:45,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:45,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:45,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:45,877 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:46:45,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:45,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:46:45,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:45,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:46:45,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:46:45,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:45,879 INFO L87 Difference]: Start difference. First operand 464 states and 631 transitions. Second operand 9 states. [2019-09-10 07:46:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:46,984 INFO L93 Difference]: Finished difference Result 1198 states and 1705 transitions. [2019-09-10 07:46:46,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:46:46,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-10 07:46:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:46,991 INFO L225 Difference]: With dead ends: 1198 [2019-09-10 07:46:46,991 INFO L226 Difference]: Without dead ends: 1198 [2019-09-10 07:46:46,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:46:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-09-10 07:46:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 464. [2019-09-10 07:46:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 630 transitions. [2019-09-10 07:46:47,015 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 630 transitions. Word has length 65 [2019-09-10 07:46:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:47,015 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 630 transitions. [2019-09-10 07:46:47,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:46:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 630 transitions. [2019-09-10 07:46:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:46:47,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:47,017 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:47,018 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1192590481, now seen corresponding path program 1 times [2019-09-10 07:46:47,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:47,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:47,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:47,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:47,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:47,222 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:46:47,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:47,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:46:47,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:47,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:46:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:46:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:47,224 INFO L87 Difference]: Start difference. First operand 464 states and 630 transitions. Second operand 9 states. [2019-09-10 07:46:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:48,104 INFO L93 Difference]: Finished difference Result 1199 states and 1700 transitions. [2019-09-10 07:46:48,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:46:48,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-10 07:46:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:48,112 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 07:46:48,112 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 07:46:48,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:46:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 07:46:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 464. [2019-09-10 07:46:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 629 transitions. [2019-09-10 07:46:48,133 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 629 transitions. Word has length 65 [2019-09-10 07:46:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:48,133 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 629 transitions. [2019-09-10 07:46:48,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:46:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 629 transitions. [2019-09-10 07:46:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:46:48,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:48,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:48,138 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1959558393, now seen corresponding path program 1 times [2019-09-10 07:46:48,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:48,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:48,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:48,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:48,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:48,379 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:46:48,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:48,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:46:48,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:48,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:46:48,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:46:48,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:46:48,381 INFO L87 Difference]: Start difference. First operand 464 states and 629 transitions. Second operand 8 states. [2019-09-10 07:46:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:48,858 INFO L93 Difference]: Finished difference Result 608 states and 820 transitions. [2019-09-10 07:46:48,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:46:48,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-09-10 07:46:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:48,862 INFO L225 Difference]: With dead ends: 608 [2019-09-10 07:46:48,862 INFO L226 Difference]: Without dead ends: 608 [2019-09-10 07:46:48,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:46:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-10 07:46:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 464. [2019-09-10 07:46:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 628 transitions. [2019-09-10 07:46:48,875 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 628 transitions. Word has length 65 [2019-09-10 07:46:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:48,876 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 628 transitions. [2019-09-10 07:46:48,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:46:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 628 transitions. [2019-09-10 07:46:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:46:48,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:48,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:48,878 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash 297751041, now seen corresponding path program 1 times [2019-09-10 07:46:48,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:48,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:48,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:49,050 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:46:49,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:49,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:46:49,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:49,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:46:49,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:46:49,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:49,052 INFO L87 Difference]: Start difference. First operand 464 states and 628 transitions. Second operand 9 states. [2019-09-10 07:46:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:50,045 INFO L93 Difference]: Finished difference Result 1199 states and 1698 transitions. [2019-09-10 07:46:50,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:46:50,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:46:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:50,052 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 07:46:50,052 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 07:46:50,053 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:46:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 07:46:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 464. [2019-09-10 07:46:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 627 transitions. [2019-09-10 07:46:50,072 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 627 transitions. Word has length 67 [2019-09-10 07:46:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:50,072 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 627 transitions. [2019-09-10 07:46:50,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:46:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 627 transitions. [2019-09-10 07:46:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:46:50,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:50,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:50,074 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash -101064039, now seen corresponding path program 1 times [2019-09-10 07:46:50,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:50,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:50,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:50,250 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:46:50,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:50,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:46:50,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:50,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:46:50,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:46:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:50,252 INFO L87 Difference]: Start difference. First operand 464 states and 627 transitions. Second operand 9 states. [2019-09-10 07:46:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:51,339 INFO L93 Difference]: Finished difference Result 1223 states and 1736 transitions. [2019-09-10 07:46:51,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:46:51,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:46:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:51,345 INFO L225 Difference]: With dead ends: 1223 [2019-09-10 07:46:51,346 INFO L226 Difference]: Without dead ends: 1223 [2019-09-10 07:46:51,346 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:46:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-09-10 07:46:51,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 464. [2019-09-10 07:46:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 626 transitions. [2019-09-10 07:46:51,363 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 626 transitions. Word has length 67 [2019-09-10 07:46:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:51,363 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 626 transitions. [2019-09-10 07:46:51,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:46:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 626 transitions. [2019-09-10 07:46:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:46:51,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:51,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:51,365 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash 217206227, now seen corresponding path program 1 times [2019-09-10 07:46:51,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:51,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:51,497 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:46:51,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:51,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:46:51,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:51,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:46:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:46:51,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:51,499 INFO L87 Difference]: Start difference. First operand 464 states and 626 transitions. Second operand 9 states. [2019-09-10 07:46:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:52,587 INFO L93 Difference]: Finished difference Result 1199 states and 1696 transitions. [2019-09-10 07:46:52,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:46:52,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:46:52,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:52,597 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 07:46:52,597 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 07:46:52,598 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:46:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 07:46:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 464. [2019-09-10 07:46:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 625 transitions. [2019-09-10 07:46:52,614 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 625 transitions. Word has length 67 [2019-09-10 07:46:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:52,614 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 625 transitions. [2019-09-10 07:46:52,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:46:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 625 transitions. [2019-09-10 07:46:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:46:52,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:52,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:52,616 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1537942501, now seen corresponding path program 1 times [2019-09-10 07:46:52,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:52,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:52,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:52,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:52,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:52,772 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:46:52,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:52,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:46:52,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:52,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:46:52,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:46:52,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:52,774 INFO L87 Difference]: Start difference. First operand 464 states and 625 transitions. Second operand 9 states. [2019-09-10 07:46:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:53,730 INFO L93 Difference]: Finished difference Result 1223 states and 1734 transitions. [2019-09-10 07:46:53,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:46:53,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:46:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:53,734 INFO L225 Difference]: With dead ends: 1223 [2019-09-10 07:46:53,734 INFO L226 Difference]: Without dead ends: 1223 [2019-09-10 07:46:53,735 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:46:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-09-10 07:46:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 464. [2019-09-10 07:46:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 624 transitions. [2019-09-10 07:46:53,752 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 624 transitions. Word has length 67 [2019-09-10 07:46:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:53,752 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 624 transitions. [2019-09-10 07:46:53,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:46:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 624 transitions. [2019-09-10 07:46:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:46:53,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:53,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:53,755 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash -149286562, now seen corresponding path program 1 times [2019-09-10 07:46:53,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:53,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:53,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:53,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:53,905 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:46:53,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:53,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:46:53,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:53,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:46:53,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:46:53,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:53,907 INFO L87 Difference]: Start difference. First operand 464 states and 624 transitions. Second operand 9 states. [2019-09-10 07:46:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:54,877 INFO L93 Difference]: Finished difference Result 1005 states and 1435 transitions. [2019-09-10 07:46:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:46:54,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:46:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:54,883 INFO L225 Difference]: With dead ends: 1005 [2019-09-10 07:46:54,883 INFO L226 Difference]: Without dead ends: 1005 [2019-09-10 07:46:54,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:46:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-09-10 07:46:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 464. [2019-09-10 07:46:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 622 transitions. [2019-09-10 07:46:54,899 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 622 transitions. Word has length 67 [2019-09-10 07:46:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:54,900 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 622 transitions. [2019-09-10 07:46:54,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:46:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 622 transitions. [2019-09-10 07:46:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:46:54,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:54,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:54,901 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:54,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 415538350, now seen corresponding path program 1 times [2019-09-10 07:46:54,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:54,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:54,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:55,021 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:46:55,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:55,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:46:55,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:55,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:46:55,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:46:55,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:55,023 INFO L87 Difference]: Start difference. First operand 464 states and 622 transitions. Second operand 9 states. [2019-09-10 07:46:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:56,071 INFO L93 Difference]: Finished difference Result 1199 states and 1691 transitions. [2019-09-10 07:46:56,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:46:56,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:46:56,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:56,078 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 07:46:56,078 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 07:46:56,079 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:46:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 07:46:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 464. [2019-09-10 07:46:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 620 transitions. [2019-09-10 07:46:56,094 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 620 transitions. Word has length 67 [2019-09-10 07:46:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:56,094 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 620 transitions. [2019-09-10 07:46:56,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:46:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 620 transitions. [2019-09-10 07:46:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:46:56,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:56,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:46:56,096 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1403250118, now seen corresponding path program 1 times [2019-09-10 07:46:56,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:56,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:56,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:56,217 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:46:56,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:56,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:46:56,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:56,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:46:56,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:46:56,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:46:56,226 INFO L87 Difference]: Start difference. First operand 464 states and 620 transitions. Second operand 9 states. [2019-09-10 07:46:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:46:57,296 INFO L93 Difference]: Finished difference Result 1223 states and 1728 transitions. [2019-09-10 07:46:57,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:46:57,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-10 07:46:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:46:57,303 INFO L225 Difference]: With dead ends: 1223 [2019-09-10 07:46:57,303 INFO L226 Difference]: Without dead ends: 1223 [2019-09-10 07:46:57,304 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:46:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-09-10 07:46:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 464. [2019-09-10 07:46:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 07:46:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 618 transitions. [2019-09-10 07:46:57,317 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 618 transitions. Word has length 67 [2019-09-10 07:46:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:46:57,317 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 618 transitions. [2019-09-10 07:46:57,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:46:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 618 transitions. [2019-09-10 07:46:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:46:57,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:46:57,319 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:46:57,319 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:46:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:46:57,320 INFO L82 PathProgramCache]: Analyzing trace with hash 819188212, now seen corresponding path program 1 times [2019-09-10 07:46:57,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:46:57,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:57,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:46:57,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:46:57,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:46:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:46:58,269 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:46:58,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:46:58,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:46:58,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:46:58,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:46:58,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:46:58,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:46:58,271 INFO L87 Difference]: Start difference. First operand 464 states and 618 transitions. Second operand 19 states. [2019-09-10 07:46:59,096 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:46:59,236 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 07:46:59,372 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:46:59,526 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-10 07:46:59,645 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:46:59,794 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-10 07:46:59,918 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:47:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:01,837 INFO L93 Difference]: Finished difference Result 1067 states and 1496 transitions. [2019-09-10 07:47:01,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:47:01,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-09-10 07:47:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:01,842 INFO L225 Difference]: With dead ends: 1067 [2019-09-10 07:47:01,843 INFO L226 Difference]: Without dead ends: 1067 [2019-09-10 07:47:01,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=292, Invalid=968, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:47:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-09-10 07:47:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 470. [2019-09-10 07:47:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 07:47:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 624 transitions. [2019-09-10 07:47:01,888 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 624 transitions. Word has length 69 [2019-09-10 07:47:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:01,888 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 624 transitions. [2019-09-10 07:47:01,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:47:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 624 transitions. [2019-09-10 07:47:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:01,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:01,890 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:47:01,890 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:01,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:01,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2009849792, now seen corresponding path program 1 times [2019-09-10 07:47:01,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:01,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:01,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:02,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:02,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:47:02,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:02,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:47:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:47:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:47:02,697 INFO L87 Difference]: Start difference. First operand 470 states and 624 transitions. Second operand 17 states. [2019-09-10 07:47:03,250 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:47:03,402 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:47:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:04,453 INFO L93 Difference]: Finished difference Result 896 states and 1263 transitions. [2019-09-10 07:47:04,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:47:04,453 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-09-10 07:47:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:04,458 INFO L225 Difference]: With dead ends: 896 [2019-09-10 07:47:04,458 INFO L226 Difference]: Without dead ends: 896 [2019-09-10 07:47:04,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:47:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-09-10 07:47:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 460. [2019-09-10 07:47:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-10 07:47:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 610 transitions. [2019-09-10 07:47:04,468 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 610 transitions. Word has length 69 [2019-09-10 07:47:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:04,469 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 610 transitions. [2019-09-10 07:47:04,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:47:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 610 transitions. [2019-09-10 07:47:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:04,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:04,470 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:47:04,471 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:04,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash -628951207, now seen corresponding path program 1 times [2019-09-10 07:47:04,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:04,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:04,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:04,917 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-09-10 07:47:05,821 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:47:05,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:05,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:47:05,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:05,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:47:05,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:47:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:47:05,823 INFO L87 Difference]: Start difference. First operand 460 states and 610 transitions. Second operand 21 states. [2019-09-10 07:47:06,718 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:47:06,919 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 07:47:07,185 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-10 07:47:07,386 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:47:07,567 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 07:47:07,765 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:47:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:09,142 INFO L93 Difference]: Finished difference Result 922 states and 1258 transitions. [2019-09-10 07:47:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:47:09,143 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-09-10 07:47:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:09,146 INFO L225 Difference]: With dead ends: 922 [2019-09-10 07:47:09,146 INFO L226 Difference]: Without dead ends: 922 [2019-09-10 07:47:09,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:47:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-09-10 07:47:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 470. [2019-09-10 07:47:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 07:47:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 625 transitions. [2019-09-10 07:47:09,157 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 625 transitions. Word has length 69 [2019-09-10 07:47:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:09,158 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 625 transitions. [2019-09-10 07:47:09,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:47:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 625 transitions. [2019-09-10 07:47:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:47:09,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:09,159 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:47:09,159 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2003011199, now seen corresponding path program 1 times [2019-09-10 07:47:09,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:09,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:09,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:09,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:09,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:09,939 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:47:09,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:09,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:47:09,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:09,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:47:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:47:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:47:09,941 INFO L87 Difference]: Start difference. First operand 470 states and 625 transitions. Second operand 17 states. [2019-09-10 07:47:10,472 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:47:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:11,256 INFO L93 Difference]: Finished difference Result 580 states and 783 transitions. [2019-09-10 07:47:11,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:47:11,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2019-09-10 07:47:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:11,260 INFO L225 Difference]: With dead ends: 580 [2019-09-10 07:47:11,260 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 07:47:11,260 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:47:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 07:47:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 450. [2019-09-10 07:47:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-10 07:47:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 598 transitions. [2019-09-10 07:47:11,269 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 598 transitions. Word has length 69 [2019-09-10 07:47:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:11,269 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 598 transitions. [2019-09-10 07:47:11,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:47:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 598 transitions. [2019-09-10 07:47:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:47:11,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:11,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] [2019-09-10 07:47:11,271 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1595609728, now seen corresponding path program 1 times [2019-09-10 07:47:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:11,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:11,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:11,612 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:47:11,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:11,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:47:11,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:11,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:47:11,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:47:11,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:47:11,614 INFO L87 Difference]: Start difference. First operand 450 states and 598 transitions. Second operand 11 states. [2019-09-10 07:47:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:12,164 INFO L93 Difference]: Finished difference Result 938 states and 1307 transitions. [2019-09-10 07:47:12,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:47:12,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-10 07:47:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:12,169 INFO L225 Difference]: With dead ends: 938 [2019-09-10 07:47:12,170 INFO L226 Difference]: Without dead ends: 938 [2019-09-10 07:47:12,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:47:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-10 07:47:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 446. [2019-09-10 07:47:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-10 07:47:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 593 transitions. [2019-09-10 07:47:12,181 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 593 transitions. Word has length 70 [2019-09-10 07:47:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:12,181 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 593 transitions. [2019-09-10 07:47:12,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:47:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 593 transitions. [2019-09-10 07:47:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:47:12,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:12,183 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:47:12,183 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash -110122555, now seen corresponding path program 1 times [2019-09-10 07:47:12,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:12,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:12,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:12,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:12,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:12,473 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:47:12,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:12,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:47:12,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:12,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:47:12,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:47:12,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:47:12,474 INFO L87 Difference]: Start difference. First operand 446 states and 593 transitions. Second operand 11 states. [2019-09-10 07:47:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:13,047 INFO L93 Difference]: Finished difference Result 927 states and 1296 transitions. [2019-09-10 07:47:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:47:13,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-10 07:47:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:13,052 INFO L225 Difference]: With dead ends: 927 [2019-09-10 07:47:13,052 INFO L226 Difference]: Without dead ends: 927 [2019-09-10 07:47:13,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:47:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-10 07:47:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 445. [2019-09-10 07:47:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-09-10 07:47:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 591 transitions. [2019-09-10 07:47:13,062 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 591 transitions. Word has length 70 [2019-09-10 07:47:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:13,062 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 591 transitions. [2019-09-10 07:47:13,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:47:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 591 transitions. [2019-09-10 07:47:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:47:13,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:13,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:13,064 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:13,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:13,064 INFO L82 PathProgramCache]: Analyzing trace with hash -154027530, now seen corresponding path program 1 times [2019-09-10 07:47:13,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:13,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:13,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:13,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:13,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:13,489 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:47:13,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:13,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:47:13,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:13,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:47:13,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:47:13,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:47:13,491 INFO L87 Difference]: Start difference. First operand 445 states and 591 transitions. Second operand 13 states. [2019-09-10 07:47:14,034 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-09-10 07:47:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:14,715 INFO L93 Difference]: Finished difference Result 1345 states and 1934 transitions. [2019-09-10 07:47:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:47:14,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-09-10 07:47:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:14,721 INFO L225 Difference]: With dead ends: 1345 [2019-09-10 07:47:14,721 INFO L226 Difference]: Without dead ends: 1345 [2019-09-10 07:47:14,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:47:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2019-09-10 07:47:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 429. [2019-09-10 07:47:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-10 07:47:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 574 transitions. [2019-09-10 07:47:14,734 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 574 transitions. Word has length 70 [2019-09-10 07:47:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:14,734 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 574 transitions. [2019-09-10 07:47:14,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:47:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 574 transitions. [2019-09-10 07:47:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:47:14,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:14,735 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:47:14,736 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:14,736 INFO L82 PathProgramCache]: Analyzing trace with hash 918653497, now seen corresponding path program 1 times [2019-09-10 07:47:14,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:14,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:14,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:14,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:14,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:15,213 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:47:15,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:15,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:47:15,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:15,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:47:15,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:47:15,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:47:15,214 INFO L87 Difference]: Start difference. First operand 429 states and 574 transitions. Second operand 12 states. [2019-09-10 07:47:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:16,075 INFO L93 Difference]: Finished difference Result 926 states and 1297 transitions. [2019-09-10 07:47:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:47:16,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-09-10 07:47:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:16,082 INFO L225 Difference]: With dead ends: 926 [2019-09-10 07:47:16,082 INFO L226 Difference]: Without dead ends: 926 [2019-09-10 07:47:16,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:47:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-09-10 07:47:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 413. [2019-09-10 07:47:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-10 07:47:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 554 transitions. [2019-09-10 07:47:16,092 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 554 transitions. Word has length 70 [2019-09-10 07:47:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:16,092 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 554 transitions. [2019-09-10 07:47:16,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:47:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 554 transitions. [2019-09-10 07:47:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:47:16,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:16,094 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:47:16,094 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:16,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2033083250, now seen corresponding path program 1 times [2019-09-10 07:47:16,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:16,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:16,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:16,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:16,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:16,439 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:47:16,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:16,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:47:16,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:16,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:47:16,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:47:16,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:47:16,441 INFO L87 Difference]: Start difference. First operand 413 states and 554 transitions. Second operand 12 states. [2019-09-10 07:47:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:17,467 INFO L93 Difference]: Finished difference Result 1170 states and 1645 transitions. [2019-09-10 07:47:17,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:47:17,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-09-10 07:47:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:17,473 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 07:47:17,473 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 07:47:17,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:47:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 07:47:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 381. [2019-09-10 07:47:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-09-10 07:47:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 509 transitions. [2019-09-10 07:47:17,482 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 509 transitions. Word has length 70 [2019-09-10 07:47:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:17,483 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 509 transitions. [2019-09-10 07:47:17,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:47:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 509 transitions. [2019-09-10 07:47:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:47:17,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:17,484 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:47:17,484 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:17,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash -33038995, now seen corresponding path program 1 times [2019-09-10 07:47:17,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:17,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:17,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:17,641 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:47:17,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:17,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:17,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:17,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:17,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:17,643 INFO L87 Difference]: Start difference. First operand 381 states and 509 transitions. Second operand 9 states. [2019-09-10 07:47:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:18,309 INFO L93 Difference]: Finished difference Result 670 states and 913 transitions. [2019-09-10 07:47:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:47:18,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:47:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:18,313 INFO L225 Difference]: With dead ends: 670 [2019-09-10 07:47:18,313 INFO L226 Difference]: Without dead ends: 670 [2019-09-10 07:47:18,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:47:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-10 07:47:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 381. [2019-09-10 07:47:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-09-10 07:47:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 507 transitions. [2019-09-10 07:47:18,320 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 507 transitions. Word has length 70 [2019-09-10 07:47:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:18,320 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 507 transitions. [2019-09-10 07:47:18,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 507 transitions. [2019-09-10 07:47:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:47:18,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:18,322 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:47:18,322 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash -34978696, now seen corresponding path program 1 times [2019-09-10 07:47:18,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:18,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:18,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:18,629 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:47:18,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:18,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:47:18,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:18,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:47:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:47:18,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:47:18,632 INFO L87 Difference]: Start difference. First operand 381 states and 507 transitions. Second operand 11 states. [2019-09-10 07:47:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:19,165 INFO L93 Difference]: Finished difference Result 861 states and 1210 transitions. [2019-09-10 07:47:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:47:19,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-10 07:47:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:19,170 INFO L225 Difference]: With dead ends: 861 [2019-09-10 07:47:19,170 INFO L226 Difference]: Without dead ends: 861 [2019-09-10 07:47:19,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:47:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-10 07:47:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 377. [2019-09-10 07:47:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-10 07:47:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 503 transitions. [2019-09-10 07:47:19,178 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 503 transitions. Word has length 70 [2019-09-10 07:47:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:19,179 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 503 transitions. [2019-09-10 07:47:19,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:47:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 503 transitions. [2019-09-10 07:47:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:47:19,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:19,180 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:47:19,180 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash 292721495, now seen corresponding path program 1 times [2019-09-10 07:47:19,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:19,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:19,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:19,294 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:47:19,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:19,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:19,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:19,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:19,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:19,296 INFO L87 Difference]: Start difference. First operand 377 states and 503 transitions. Second operand 9 states. [2019-09-10 07:47:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:19,944 INFO L93 Difference]: Finished difference Result 653 states and 892 transitions. [2019-09-10 07:47:19,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:47:19,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 07:47:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:19,947 INFO L225 Difference]: With dead ends: 653 [2019-09-10 07:47:19,947 INFO L226 Difference]: Without dead ends: 653 [2019-09-10 07:47:19,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:47:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-10 07:47:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 377. [2019-09-10 07:47:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-10 07:47:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 502 transitions. [2019-09-10 07:47:19,956 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 502 transitions. Word has length 71 [2019-09-10 07:47:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:19,956 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 502 transitions. [2019-09-10 07:47:19,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 502 transitions. [2019-09-10 07:47:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:47:19,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:19,957 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:47:19,958 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash -288197998, now seen corresponding path program 1 times [2019-09-10 07:47:19,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:19,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:19,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:20,069 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:47:20,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:20,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:20,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:20,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:20,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:20,071 INFO L87 Difference]: Start difference. First operand 377 states and 502 transitions. Second operand 9 states. [2019-09-10 07:47:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:20,608 INFO L93 Difference]: Finished difference Result 653 states and 891 transitions. [2019-09-10 07:47:20,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:47:20,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 07:47:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:20,612 INFO L225 Difference]: With dead ends: 653 [2019-09-10 07:47:20,612 INFO L226 Difference]: Without dead ends: 653 [2019-09-10 07:47:20,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:47:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-10 07:47:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 377. [2019-09-10 07:47:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-10 07:47:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 501 transitions. [2019-09-10 07:47:20,621 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 501 transitions. Word has length 71 [2019-09-10 07:47:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:20,622 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 501 transitions. [2019-09-10 07:47:20,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 501 transitions. [2019-09-10 07:47:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:47:20,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:20,623 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:47:20,623 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:20,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:20,624 INFO L82 PathProgramCache]: Analyzing trace with hash -256536824, now seen corresponding path program 1 times [2019-09-10 07:47:20,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:20,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:20,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:20,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:20,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:21,555 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:47:21,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:21,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-10 07:47:21,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:21,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:47:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:47:21,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:47:21,557 INFO L87 Difference]: Start difference. First operand 377 states and 501 transitions. Second operand 23 states. [2019-09-10 07:47:21,827 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-10 07:47:22,636 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:47:22,852 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:47:23,089 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 07:47:23,253 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:47:23,411 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:47:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:25,653 INFO L93 Difference]: Finished difference Result 1498 states and 2168 transitions. [2019-09-10 07:47:25,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:47:25,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-09-10 07:47:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:25,661 INFO L225 Difference]: With dead ends: 1498 [2019-09-10 07:47:25,661 INFO L226 Difference]: Without dead ends: 1498 [2019-09-10 07:47:25,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:47:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2019-09-10 07:47:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 388. [2019-09-10 07:47:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-10 07:47:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 515 transitions. [2019-09-10 07:47:25,673 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 515 transitions. Word has length 72 [2019-09-10 07:47:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:25,673 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 515 transitions. [2019-09-10 07:47:25,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:47:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 515 transitions. [2019-09-10 07:47:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:47:25,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:25,674 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:47:25,674 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:25,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash 424447858, now seen corresponding path program 1 times [2019-09-10 07:47:25,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:25,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:25,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:25,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:25,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:26,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:26,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:47:26,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:26,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:47:26,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:47:26,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:47:26,114 INFO L87 Difference]: Start difference. First operand 388 states and 515 transitions. Second operand 14 states. [2019-09-10 07:47:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:27,073 INFO L93 Difference]: Finished difference Result 393 states and 518 transitions. [2019-09-10 07:47:27,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:47:27,074 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2019-09-10 07:47:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:27,077 INFO L225 Difference]: With dead ends: 393 [2019-09-10 07:47:27,077 INFO L226 Difference]: Without dead ends: 393 [2019-09-10 07:47:27,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:47:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-10 07:47:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 383. [2019-09-10 07:47:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-10 07:47:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 509 transitions. [2019-09-10 07:47:27,083 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 509 transitions. Word has length 73 [2019-09-10 07:47:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:27,083 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 509 transitions. [2019-09-10 07:47:27,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:47:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 509 transitions. [2019-09-10 07:47:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:47:27,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:27,084 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:47:27,085 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1502313025, now seen corresponding path program 1 times [2019-09-10 07:47:27,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:27,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:27,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:27,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:27,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:27,913 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:47:27,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:27,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:47:27,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:27,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:47:27,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:47:27,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:47:27,914 INFO L87 Difference]: Start difference. First operand 383 states and 509 transitions. Second operand 19 states. [2019-09-10 07:47:28,542 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:47:28,733 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:47:28,873 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:47:29,012 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:47:29,280 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:47:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:30,920 INFO L93 Difference]: Finished difference Result 1010 states and 1430 transitions. [2019-09-10 07:47:30,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:47:30,927 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2019-09-10 07:47:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:30,931 INFO L225 Difference]: With dead ends: 1010 [2019-09-10 07:47:30,931 INFO L226 Difference]: Without dead ends: 1010 [2019-09-10 07:47:30,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 07:47:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-09-10 07:47:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 388. [2019-09-10 07:47:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-10 07:47:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 514 transitions. [2019-09-10 07:47:30,941 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 514 transitions. Word has length 73 [2019-09-10 07:47:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:30,941 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 514 transitions. [2019-09-10 07:47:30,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:47:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 514 transitions. [2019-09-10 07:47:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:47:30,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:30,942 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:47:30,943 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:30,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:30,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2067734093, now seen corresponding path program 1 times [2019-09-10 07:47:30,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:30,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:30,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:30,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:30,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:31,273 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:47:31,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:31,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:47:31,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:31,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:47:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:47:31,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:47:31,275 INFO L87 Difference]: Start difference. First operand 388 states and 514 transitions. Second operand 12 states. [2019-09-10 07:47:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:32,363 INFO L93 Difference]: Finished difference Result 1079 states and 1534 transitions. [2019-09-10 07:47:32,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:47:32,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 07:47:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:32,367 INFO L225 Difference]: With dead ends: 1079 [2019-09-10 07:47:32,367 INFO L226 Difference]: Without dead ends: 1079 [2019-09-10 07:47:32,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:47:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-09-10 07:47:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 371. [2019-09-10 07:47:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-10 07:47:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 493 transitions. [2019-09-10 07:47:32,378 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 493 transitions. Word has length 73 [2019-09-10 07:47:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:32,378 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 493 transitions. [2019-09-10 07:47:32,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:47:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 493 transitions. [2019-09-10 07:47:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:47:32,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:32,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, 1, 1, 1, 1, 1] [2019-09-10 07:47:32,380 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:32,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1554071027, now seen corresponding path program 1 times [2019-09-10 07:47:32,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:32,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:32,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:32,823 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:47:32,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:32,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:47:32,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:32,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:47:32,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:47:32,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:47:32,825 INFO L87 Difference]: Start difference. First operand 371 states and 493 transitions. Second operand 13 states. [2019-09-10 07:47:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:33,674 INFO L93 Difference]: Finished difference Result 821 states and 1165 transitions. [2019-09-10 07:47:33,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:33,680 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-10 07:47:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:33,681 INFO L225 Difference]: With dead ends: 821 [2019-09-10 07:47:33,681 INFO L226 Difference]: Without dead ends: 821 [2019-09-10 07:47:33,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:47:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-09-10 07:47:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 353. [2019-09-10 07:47:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-10 07:47:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 473 transitions. [2019-09-10 07:47:33,689 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 473 transitions. Word has length 73 [2019-09-10 07:47:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:33,690 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 473 transitions. [2019-09-10 07:47:33,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:47:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 473 transitions. [2019-09-10 07:47:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:47:33,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:33,691 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:47:33,691 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1379799190, now seen corresponding path program 1 times [2019-09-10 07:47:33,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:33,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:33,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:33,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:33,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:34,043 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:47:34,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:34,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:47:34,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:34,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:47:34,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:47:34,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:47:34,045 INFO L87 Difference]: Start difference. First operand 353 states and 473 transitions. Second operand 10 states. [2019-09-10 07:47:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:34,467 INFO L93 Difference]: Finished difference Result 744 states and 1079 transitions. [2019-09-10 07:47:34,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:47:34,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-10 07:47:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:34,469 INFO L225 Difference]: With dead ends: 744 [2019-09-10 07:47:34,469 INFO L226 Difference]: Without dead ends: 744 [2019-09-10 07:47:34,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:47:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-10 07:47:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 324. [2019-09-10 07:47:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-10 07:47:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 442 transitions. [2019-09-10 07:47:34,475 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 442 transitions. Word has length 74 [2019-09-10 07:47:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:34,475 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 442 transitions. [2019-09-10 07:47:34,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:47:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 442 transitions. [2019-09-10 07:47:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:47:34,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:34,476 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:34,477 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:34,477 INFO L82 PathProgramCache]: Analyzing trace with hash 973327812, now seen corresponding path program 1 times [2019-09-10 07:47:34,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:34,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:34,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:34,539 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:47:34,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:34,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:34,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:34,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:34,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:34,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:34,542 INFO L87 Difference]: Start difference. First operand 324 states and 442 transitions. Second operand 3 states. [2019-09-10 07:47:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:34,568 INFO L93 Difference]: Finished difference Result 516 states and 723 transitions. [2019-09-10 07:47:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:34,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 07:47:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:34,570 INFO L225 Difference]: With dead ends: 516 [2019-09-10 07:47:34,570 INFO L226 Difference]: Without dead ends: 516 [2019-09-10 07:47:34,570 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:47:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-09-10 07:47:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2019-09-10 07:47:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-10 07:47:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 722 transitions. [2019-09-10 07:47:34,577 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 722 transitions. Word has length 95 [2019-09-10 07:47:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:34,577 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 722 transitions. [2019-09-10 07:47:34,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 722 transitions. [2019-09-10 07:47:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:47:34,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:34,579 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] [2019-09-10 07:47:34,584 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:34,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash -338945445, now seen corresponding path program 1 times [2019-09-10 07:47:34,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:34,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:34,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:34,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:34,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:34,640 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:47:34,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:34,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:34,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:34,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:34,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:34,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:34,641 INFO L87 Difference]: Start difference. First operand 514 states and 722 transitions. Second operand 5 states. [2019-09-10 07:47:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:34,897 INFO L93 Difference]: Finished difference Result 2020 states and 2905 transitions. [2019-09-10 07:47:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:47:34,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 07:47:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:34,901 INFO L225 Difference]: With dead ends: 2020 [2019-09-10 07:47:34,901 INFO L226 Difference]: Without dead ends: 2020 [2019-09-10 07:47:34,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-09-10 07:47:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 950. [2019-09-10 07:47:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-09-10 07:47:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1358 transitions. [2019-09-10 07:47:34,912 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1358 transitions. Word has length 97 [2019-09-10 07:47:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:34,912 INFO L475 AbstractCegarLoop]: Abstraction has 950 states and 1358 transitions. [2019-09-10 07:47:34,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1358 transitions. [2019-09-10 07:47:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:47:34,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:34,915 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] [2019-09-10 07:47:34,915 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:34,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1085518228, now seen corresponding path program 1 times [2019-09-10 07:47:34,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:34,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:34,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:34,978 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:47:34,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:34,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:34,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:34,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:34,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:34,980 INFO L87 Difference]: Start difference. First operand 950 states and 1358 transitions. Second operand 3 states. [2019-09-10 07:47:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:35,014 INFO L93 Difference]: Finished difference Result 1366 states and 1931 transitions. [2019-09-10 07:47:35,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:35,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:47:35,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:35,017 INFO L225 Difference]: With dead ends: 1366 [2019-09-10 07:47:35,017 INFO L226 Difference]: Without dead ends: 1366 [2019-09-10 07:47:35,018 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:47:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-09-10 07:47:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1348. [2019-09-10 07:47:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-09-10 07:47:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1914 transitions. [2019-09-10 07:47:35,033 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1914 transitions. Word has length 97 [2019-09-10 07:47:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:35,033 INFO L475 AbstractCegarLoop]: Abstraction has 1348 states and 1914 transitions. [2019-09-10 07:47:35,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1914 transitions. [2019-09-10 07:47:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:47:35,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:35,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, 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:35,036 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:35,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1152011740, now seen corresponding path program 1 times [2019-09-10 07:47:35,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:35,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:35,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:35,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:35,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:35,093 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:47:35,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:35,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:35,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:35,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:35,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:35,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:35,094 INFO L87 Difference]: Start difference. First operand 1348 states and 1914 transitions. Second operand 3 states. [2019-09-10 07:47:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:35,129 INFO L93 Difference]: Finished difference Result 2004 states and 2849 transitions. [2019-09-10 07:47:35,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:35,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:47:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:35,134 INFO L225 Difference]: With dead ends: 2004 [2019-09-10 07:47:35,134 INFO L226 Difference]: Without dead ends: 2004 [2019-09-10 07:47:35,134 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:47:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-09-10 07:47:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 2002. [2019-09-10 07:47:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-09-10 07:47:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2848 transitions. [2019-09-10 07:47:35,161 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2848 transitions. Word has length 97 [2019-09-10 07:47:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:35,162 INFO L475 AbstractCegarLoop]: Abstraction has 2002 states and 2848 transitions. [2019-09-10 07:47:35,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2848 transitions. [2019-09-10 07:47:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:47:35,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:35,165 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] [2019-09-10 07:47:35,165 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:35,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1716786779, now seen corresponding path program 1 times [2019-09-10 07:47:35,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:35,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:35,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:35,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:35,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:35,231 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:47:35,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:35,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:35,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:35,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:35,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:35,233 INFO L87 Difference]: Start difference. First operand 2002 states and 2848 transitions. Second operand 5 states. [2019-09-10 07:47:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:35,546 INFO L93 Difference]: Finished difference Result 7588 states and 10585 transitions. [2019-09-10 07:47:35,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:47:35,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 07:47:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:35,560 INFO L225 Difference]: With dead ends: 7588 [2019-09-10 07:47:35,561 INFO L226 Difference]: Without dead ends: 7588 [2019-09-10 07:47:35,561 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:47:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7588 states. [2019-09-10 07:47:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7588 to 4030. [2019-09-10 07:47:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4030 states. [2019-09-10 07:47:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5714 transitions. [2019-09-10 07:47:35,638 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5714 transitions. Word has length 97 [2019-09-10 07:47:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:35,638 INFO L475 AbstractCegarLoop]: Abstraction has 4030 states and 5714 transitions. [2019-09-10 07:47:35,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5714 transitions. [2019-09-10 07:47:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:47:35,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:35,641 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] [2019-09-10 07:47:35,641 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:35,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:35,641 INFO L82 PathProgramCache]: Analyzing trace with hash -703031205, now seen corresponding path program 1 times [2019-09-10 07:47:35,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:35,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:35,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:35,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:35,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:35,716 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:47:35,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:35,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:35,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:35,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:35,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:35,718 INFO L87 Difference]: Start difference. First operand 4030 states and 5714 transitions. Second operand 5 states. [2019-09-10 07:47:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:35,952 INFO L93 Difference]: Finished difference Result 13120 states and 18225 transitions. [2019-09-10 07:47:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:47:35,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 07:47:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:35,979 INFO L225 Difference]: With dead ends: 13120 [2019-09-10 07:47:35,979 INFO L226 Difference]: Without dead ends: 13120 [2019-09-10 07:47:35,979 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:47:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-09-10 07:47:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 8230. [2019-09-10 07:47:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8230 states. [2019-09-10 07:47:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8230 states to 8230 states and 11590 transitions. [2019-09-10 07:47:36,118 INFO L78 Accepts]: Start accepts. Automaton has 8230 states and 11590 transitions. Word has length 97 [2019-09-10 07:47:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:36,119 INFO L475 AbstractCegarLoop]: Abstraction has 8230 states and 11590 transitions. [2019-09-10 07:47:36,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 8230 states and 11590 transitions. [2019-09-10 07:47:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:47:36,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:36,122 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] [2019-09-10 07:47:36,122 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -71633169, now seen corresponding path program 1 times [2019-09-10 07:47:36,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:36,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:36,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:36,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:36,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:36,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:36,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:36,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:36,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:36,170 INFO L87 Difference]: Start difference. First operand 8230 states and 11590 transitions. Second operand 3 states. [2019-09-10 07:47:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:36,217 INFO L93 Difference]: Finished difference Result 9064 states and 12655 transitions. [2019-09-10 07:47:36,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:36,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:47:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:36,233 INFO L225 Difference]: With dead ends: 9064 [2019-09-10 07:47:36,233 INFO L226 Difference]: Without dead ends: 9064 [2019-09-10 07:47:36,234 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:47:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-09-10 07:47:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 8966. [2019-09-10 07:47:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8966 states. [2019-09-10 07:47:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 12542 transitions. [2019-09-10 07:47:36,332 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 12542 transitions. Word has length 98 [2019-09-10 07:47:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:36,333 INFO L475 AbstractCegarLoop]: Abstraction has 8966 states and 12542 transitions. [2019-09-10 07:47:36,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 12542 transitions. [2019-09-10 07:47:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:47:36,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:36,336 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] [2019-09-10 07:47:36,336 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -755637834, now seen corresponding path program 1 times [2019-09-10 07:47:36,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:36,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:36,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:36,397 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:47:36,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:36,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:36,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:36,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:36,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:36,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:36,399 INFO L87 Difference]: Start difference. First operand 8966 states and 12542 transitions. Second operand 5 states. [2019-09-10 07:47:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:36,593 INFO L93 Difference]: Finished difference Result 18908 states and 25921 transitions. [2019-09-10 07:47:36,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:47:36,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 07:47:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:36,626 INFO L225 Difference]: With dead ends: 18908 [2019-09-10 07:47:36,626 INFO L226 Difference]: Without dead ends: 18908 [2019-09-10 07:47:36,627 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:47:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18908 states. [2019-09-10 07:47:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18908 to 11030. [2019-09-10 07:47:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11030 states. [2019-09-10 07:47:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11030 states to 11030 states and 15182 transitions. [2019-09-10 07:47:36,789 INFO L78 Accepts]: Start accepts. Automaton has 11030 states and 15182 transitions. Word has length 98 [2019-09-10 07:47:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:36,790 INFO L475 AbstractCegarLoop]: Abstraction has 11030 states and 15182 transitions. [2019-09-10 07:47:36,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 11030 states and 15182 transitions. [2019-09-10 07:47:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:47:36,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:36,792 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] [2019-09-10 07:47:36,792 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 911061584, now seen corresponding path program 1 times [2019-09-10 07:47:36,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:36,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:36,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:36,872 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:47:36,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:36,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:47:36,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:36,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:47:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:47:36,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:47:36,874 INFO L87 Difference]: Start difference. First operand 11030 states and 15182 transitions. Second operand 6 states. [2019-09-10 07:47:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:36,995 INFO L93 Difference]: Finished difference Result 17588 states and 23602 transitions. [2019-09-10 07:47:36,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:47:36,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-10 07:47:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:37,024 INFO L225 Difference]: With dead ends: 17588 [2019-09-10 07:47:37,024 INFO L226 Difference]: Without dead ends: 17588 [2019-09-10 07:47:37,024 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:47:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17588 states. [2019-09-10 07:47:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17588 to 11222. [2019-09-10 07:47:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11222 states. [2019-09-10 07:47:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11222 states to 11222 states and 15310 transitions. [2019-09-10 07:47:37,295 INFO L78 Accepts]: Start accepts. Automaton has 11222 states and 15310 transitions. Word has length 98 [2019-09-10 07:47:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:37,296 INFO L475 AbstractCegarLoop]: Abstraction has 11222 states and 15310 transitions. [2019-09-10 07:47:37,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:47:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 11222 states and 15310 transitions. [2019-09-10 07:47:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:47:37,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:37,298 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:37,299 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:37,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2097306132, now seen corresponding path program 1 times [2019-09-10 07:47:37,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:37,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:37,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:37,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:37,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:47:37,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:37,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:37,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:37,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:37,364 INFO L87 Difference]: Start difference. First operand 11222 states and 15310 transitions. Second operand 3 states. [2019-09-10 07:47:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:37,404 INFO L93 Difference]: Finished difference Result 10600 states and 14223 transitions. [2019-09-10 07:47:37,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:37,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:47:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:37,417 INFO L225 Difference]: With dead ends: 10600 [2019-09-10 07:47:37,418 INFO L226 Difference]: Without dead ends: 10600 [2019-09-10 07:47:37,418 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:47:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2019-09-10 07:47:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 9250. [2019-09-10 07:47:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-09-10 07:47:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 12426 transitions. [2019-09-10 07:47:37,524 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 12426 transitions. Word has length 99 [2019-09-10 07:47:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:37,525 INFO L475 AbstractCegarLoop]: Abstraction has 9250 states and 12426 transitions. [2019-09-10 07:47:37,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 12426 transitions. [2019-09-10 07:47:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:47:37,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:37,528 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:47:37,528 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1226521472, now seen corresponding path program 1 times [2019-09-10 07:47:37,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:37,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:37,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:37,591 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:47:37,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:37,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:37,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:37,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:37,592 INFO L87 Difference]: Start difference. First operand 9250 states and 12426 transitions. Second operand 3 states. [2019-09-10 07:47:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:37,636 INFO L93 Difference]: Finished difference Result 13800 states and 18175 transitions. [2019-09-10 07:47:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:37,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:47:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:37,653 INFO L225 Difference]: With dead ends: 13800 [2019-09-10 07:47:37,653 INFO L226 Difference]: Without dead ends: 13800 [2019-09-10 07:47:37,656 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:47:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13800 states. [2019-09-10 07:47:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13800 to 9996. [2019-09-10 07:47:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9996 states. [2019-09-10 07:47:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9996 states to 9996 states and 13258 transitions. [2019-09-10 07:47:37,783 INFO L78 Accepts]: Start accepts. Automaton has 9996 states and 13258 transitions. Word has length 100 [2019-09-10 07:47:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:37,784 INFO L475 AbstractCegarLoop]: Abstraction has 9996 states and 13258 transitions. [2019-09-10 07:47:37,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 9996 states and 13258 transitions. [2019-09-10 07:47:37,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:47:37,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:37,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:37,786 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:37,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:37,787 INFO L82 PathProgramCache]: Analyzing trace with hash -82823700, now seen corresponding path program 1 times [2019-09-10 07:47:37,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:37,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:37,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:37,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:37,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:37,852 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:47:37,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:37,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:37,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:37,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:37,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:37,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:37,854 INFO L87 Difference]: Start difference. First operand 9996 states and 13258 transitions. Second operand 3 states. [2019-09-10 07:47:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:37,896 INFO L93 Difference]: Finished difference Result 12124 states and 15659 transitions. [2019-09-10 07:47:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:37,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:47:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:37,909 INFO L225 Difference]: With dead ends: 12124 [2019-09-10 07:47:37,910 INFO L226 Difference]: Without dead ends: 12124 [2019-09-10 07:47:37,910 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:47:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12124 states. [2019-09-10 07:47:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12124 to 11494. [2019-09-10 07:47:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11494 states. [2019-09-10 07:47:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11494 states to 11494 states and 15030 transitions. [2019-09-10 07:47:38,030 INFO L78 Accepts]: Start accepts. Automaton has 11494 states and 15030 transitions. Word has length 101 [2019-09-10 07:47:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:38,031 INFO L475 AbstractCegarLoop]: Abstraction has 11494 states and 15030 transitions. [2019-09-10 07:47:38,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 11494 states and 15030 transitions. [2019-09-10 07:47:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:47:38,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:38,032 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:47:38,033 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1734817196, now seen corresponding path program 1 times [2019-09-10 07:47:38,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:38,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:38,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:38,088 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:47:38,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:38,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:38,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:38,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:38,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:38,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:38,089 INFO L87 Difference]: Start difference. First operand 11494 states and 15030 transitions. Second operand 3 states. [2019-09-10 07:47:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:38,128 INFO L93 Difference]: Finished difference Result 12264 states and 15839 transitions. [2019-09-10 07:47:38,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:38,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:47:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:38,146 INFO L225 Difference]: With dead ends: 12264 [2019-09-10 07:47:38,146 INFO L226 Difference]: Without dead ends: 12264 [2019-09-10 07:47:38,146 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:47:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12264 states. [2019-09-10 07:47:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12264 to 11982. [2019-09-10 07:47:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11982 states. [2019-09-10 07:47:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11982 states to 11982 states and 15518 transitions. [2019-09-10 07:47:38,270 INFO L78 Accepts]: Start accepts. Automaton has 11982 states and 15518 transitions. Word has length 102 [2019-09-10 07:47:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:38,270 INFO L475 AbstractCegarLoop]: Abstraction has 11982 states and 15518 transitions. [2019-09-10 07:47:38,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 11982 states and 15518 transitions. [2019-09-10 07:47:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:47:38,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:38,276 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] [2019-09-10 07:47:38,279 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1955395367, now seen corresponding path program 1 times [2019-09-10 07:47:38,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:38,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:38,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:47:38,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:38,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:47:38,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:38,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:47:38,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:47:38,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:47:38,421 INFO L87 Difference]: Start difference. First operand 11982 states and 15518 transitions. Second operand 6 states. [2019-09-10 07:47:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:39,069 INFO L93 Difference]: Finished difference Result 47966 states and 61866 transitions. [2019-09-10 07:47:39,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:47:39,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-10 07:47:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:39,119 INFO L225 Difference]: With dead ends: 47966 [2019-09-10 07:47:39,119 INFO L226 Difference]: Without dead ends: 47966 [2019-09-10 07:47:39,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47966 states. [2019-09-10 07:47:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47966 to 19662. [2019-09-10 07:47:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-09-10 07:47:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 25326 transitions. [2019-09-10 07:47:39,426 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 25326 transitions. Word has length 126 [2019-09-10 07:47:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:39,427 INFO L475 AbstractCegarLoop]: Abstraction has 19662 states and 25326 transitions. [2019-09-10 07:47:39,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:47:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 25326 transitions. [2019-09-10 07:47:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:47:39,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:39,431 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] [2019-09-10 07:47:39,431 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:39,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash 100336857, now seen corresponding path program 1 times [2019-09-10 07:47:39,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:39,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:39,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:39,568 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:47:39,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:39,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:47:39,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:39,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:47:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:47:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:47:39,569 INFO L87 Difference]: Start difference. First operand 19662 states and 25326 transitions. Second operand 6 states. [2019-09-10 07:47:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:39,792 INFO L93 Difference]: Finished difference Result 55046 states and 70858 transitions. [2019-09-10 07:47:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:47:39,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-10 07:47:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:39,854 INFO L225 Difference]: With dead ends: 55046 [2019-09-10 07:47:39,854 INFO L226 Difference]: Without dead ends: 55046 [2019-09-10 07:47:39,855 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:47:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55046 states. [2019-09-10 07:47:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55046 to 31118. [2019-09-10 07:47:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31118 states. [2019-09-10 07:47:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31118 states to 31118 states and 39878 transitions. [2019-09-10 07:47:40,249 INFO L78 Accepts]: Start accepts. Automaton has 31118 states and 39878 transitions. Word has length 126 [2019-09-10 07:47:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:40,249 INFO L475 AbstractCegarLoop]: Abstraction has 31118 states and 39878 transitions. [2019-09-10 07:47:40,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:47:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 31118 states and 39878 transitions. [2019-09-10 07:47:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 07:47:40,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:40,254 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] [2019-09-10 07:47:40,255 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:40,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1975486169, now seen corresponding path program 1 times [2019-09-10 07:47:40,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:40,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:40,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:40,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:40,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:40,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:47:40,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:40,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:47:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:47:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:47:40,498 INFO L87 Difference]: Start difference. First operand 31118 states and 39878 transitions. Second operand 3 states. [2019-09-10 07:47:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:40,579 INFO L93 Difference]: Finished difference Result 27696 states and 34407 transitions. [2019-09-10 07:47:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:47:40,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 07:47:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:40,608 INFO L225 Difference]: With dead ends: 27696 [2019-09-10 07:47:40,608 INFO L226 Difference]: Without dead ends: 27696 [2019-09-10 07:47:40,609 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:47:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27696 states. [2019-09-10 07:47:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27696 to 27574. [2019-09-10 07:47:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27574 states. [2019-09-10 07:47:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27574 states to 27574 states and 34262 transitions. [2019-09-10 07:47:40,844 INFO L78 Accepts]: Start accepts. Automaton has 27574 states and 34262 transitions. Word has length 126 [2019-09-10 07:47:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:40,844 INFO L475 AbstractCegarLoop]: Abstraction has 27574 states and 34262 transitions. [2019-09-10 07:47:40,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:47:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 27574 states and 34262 transitions. [2019-09-10 07:47:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:47:40,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:40,848 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:40,848 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash -430522632, now seen corresponding path program 1 times [2019-09-10 07:47:40,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:40,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:40,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:40,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:40,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:47:40,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:40,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:47:40,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:40,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:47:40,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:47:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:47:40,974 INFO L87 Difference]: Start difference. First operand 27574 states and 34262 transitions. Second operand 6 states. [2019-09-10 07:47:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:41,157 INFO L93 Difference]: Finished difference Result 54310 states and 67758 transitions. [2019-09-10 07:47:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:47:41,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 07:47:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:41,209 INFO L225 Difference]: With dead ends: 54310 [2019-09-10 07:47:41,210 INFO L226 Difference]: Without dead ends: 54310 [2019-09-10 07:47:41,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:47:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54310 states. [2019-09-10 07:47:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54310 to 34710. [2019-09-10 07:47:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34710 states. [2019-09-10 07:47:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34710 states to 34710 states and 43110 transitions. [2019-09-10 07:47:42,496 INFO L78 Accepts]: Start accepts. Automaton has 34710 states and 43110 transitions. Word has length 127 [2019-09-10 07:47:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:42,497 INFO L475 AbstractCegarLoop]: Abstraction has 34710 states and 43110 transitions. [2019-09-10 07:47:42,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:47:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 34710 states and 43110 transitions. [2019-09-10 07:47:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 07:47:42,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:42,501 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:47:42,501 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash 674022136, now seen corresponding path program 1 times [2019-09-10 07:47:42,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:42,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:42,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:47:42,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:42,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:47:42,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:42,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:47:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:47:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:47:42,645 INFO L87 Difference]: Start difference. First operand 34710 states and 43110 transitions. Second operand 6 states. [2019-09-10 07:47:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:42,868 INFO L93 Difference]: Finished difference Result 61206 states and 76310 transitions. [2019-09-10 07:47:42,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:47:42,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 07:47:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:42,919 INFO L225 Difference]: With dead ends: 61206 [2019-09-10 07:47:42,919 INFO L226 Difference]: Without dead ends: 61206 [2019-09-10 07:47:42,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61206 states. [2019-09-10 07:47:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61206 to 41846. [2019-09-10 07:47:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41846 states. [2019-09-10 07:47:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41846 states to 41846 states and 51958 transitions. [2019-09-10 07:47:43,331 INFO L78 Accepts]: Start accepts. Automaton has 41846 states and 51958 transitions. Word has length 127 [2019-09-10 07:47:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:43,332 INFO L475 AbstractCegarLoop]: Abstraction has 41846 states and 51958 transitions. [2019-09-10 07:47:43,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:47:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 41846 states and 51958 transitions. [2019-09-10 07:47:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 07:47:43,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:43,336 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] [2019-09-10 07:47:43,336 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash -827875054, now seen corresponding path program 1 times [2019-09-10 07:47:43,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:43,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:43,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 07:47:43,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:43,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:43,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:43,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:43,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:43,471 INFO L87 Difference]: Start difference. First operand 41846 states and 51958 transitions. Second operand 9 states. [2019-09-10 07:47:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:44,194 INFO L93 Difference]: Finished difference Result 83616 states and 103831 transitions. [2019-09-10 07:47:44,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:47:44,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 07:47:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:44,254 INFO L225 Difference]: With dead ends: 83616 [2019-09-10 07:47:44,254 INFO L226 Difference]: Without dead ends: 83616 [2019-09-10 07:47:44,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:47:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83616 states. [2019-09-10 07:47:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83616 to 41846. [2019-09-10 07:47:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41846 states. [2019-09-10 07:47:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41846 states to 41846 states and 51956 transitions. [2019-09-10 07:47:44,711 INFO L78 Accepts]: Start accepts. Automaton has 41846 states and 51956 transitions. Word has length 128 [2019-09-10 07:47:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:44,711 INFO L475 AbstractCegarLoop]: Abstraction has 41846 states and 51956 transitions. [2019-09-10 07:47:44,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 41846 states and 51956 transitions. [2019-09-10 07:47:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 07:47:44,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:44,715 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] [2019-09-10 07:47:44,715 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1614558263, now seen corresponding path program 1 times [2019-09-10 07:47:44,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:44,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:44,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:44,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:44,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:44,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:47:44,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 07:47:44,966 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], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [197], [199], [202], [206], [208], [213], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1894], [1896], [1898], [1901], [1916], [1918], [1920], [1923], [1938], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:47:45,005 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:47:45,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:47:45,133 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:47:45,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:47:45,873 INFO L272 AbstractInterpreter]: Visited 121 different actions 654 times. Merged at 47 different actions 463 times. Widened at 20 different actions 71 times. Performed 2221 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2221 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 75 fixpoints after 16 different actions. Largest state had 189 variables. [2019-09-10 07:47:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:45,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:47:45,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:47:45,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:47:45,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:45,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:47:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:46,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:47:46,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:47:46,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:46,897 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-10 07:47:46,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:47,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:47:47,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:47,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:48,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:47:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:47:48,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:47:48,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2019-09-10 07:47:48,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:47:48,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:47:48,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:47:48,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:47:48,727 INFO L87 Difference]: Start difference. First operand 41846 states and 51956 transitions. Second operand 20 states. [2019-09-10 07:47:48,977 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 07:47:49,430 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:47:49,808 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:47:50,056 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 07:47:50,600 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:47:50,831 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:47:51,265 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:47:51,539 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:47:51,979 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:47:52,317 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:47:52,526 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-10 07:47:52,878 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 07:47:53,268 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:47:53,565 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:47:54,067 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 07:47:54,342 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:47:54,970 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:47:55,510 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:47:55,875 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 07:47:56,147 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:47:56,526 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:47:56,936 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:47:57,293 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:47:57,799 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:47:58,096 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:47:58,394 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:47:58,803 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-10 07:47:59,180 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:47:59,664 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:48:00,049 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-10 07:48:00,435 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 07:48:00,858 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-10 07:48:01,222 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:48:01,619 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:48:02,547 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:48:02,909 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:48:03,266 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:48:03,646 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 07:48:04,041 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:48:04,711 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-10 07:48:05,018 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:48:05,407 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:48:05,988 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:48:06,361 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-09-10 07:48:06,660 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 07:48:07,031 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-09-10 07:48:07,326 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:48:07,777 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-10 07:48:08,210 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 07:48:08,544 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 07:48:09,031 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 07:48:09,369 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 07:48:09,819 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-09-10 07:48:10,180 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 07:48:10,456 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:48:10,786 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-10 07:48:11,282 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:48:11,546 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:48:11,873 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-10 07:48:12,097 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 07:48:12,560 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:48:12,946 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:48:13,572 WARN L188 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:48:13,978 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-09-10 07:48:14,476 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 07:48:14,803 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 07:48:15,108 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:48:15,496 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-10 07:48:15,794 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-09-10 07:48:16,190 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 07:48:16,466 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:48:16,958 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:48:17,250 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:48:17,555 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 07:48:17,903 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:48:18,186 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 07:48:18,569 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:48:19,212 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 07:48:19,726 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-10 07:48:20,142 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:48:20,506 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:48:20,876 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 07:48:21,306 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-10 07:48:21,753 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 07:48:22,274 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 07:48:22,614 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:48:23,131 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-09-10 07:48:23,497 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-10 07:48:23,815 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 07:48:24,250 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:48:24,588 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 07:48:25,161 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-10 07:48:25,709 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 07:48:26,091 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-09-10 07:48:26,464 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-10 07:48:26,845 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:48:27,205 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-09-10 07:48:28,141 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 07:48:28,591 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:48:29,277 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-10 07:48:29,867 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 07:48:30,309 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-10 07:48:30,719 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 07:48:31,180 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-10 07:48:31,860 WARN L188 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 07:48:32,255 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:48:32,823 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:48:33,497 WARN L188 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:48:33,905 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:48:34,292 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-10 07:48:34,768 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:48:35,172 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-10 07:48:35,520 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:48:36,104 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:48:36,620 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-10 07:48:36,995 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:48:37,413 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-10 07:48:37,834 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:48:38,332 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-10 07:48:38,672 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-10 07:48:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:38,806 INFO L93 Difference]: Finished difference Result 149067 states and 182586 transitions. [2019-09-10 07:48:38,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 07:48:38,807 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 130 [2019-09-10 07:48:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:39,315 INFO L225 Difference]: With dead ends: 149067 [2019-09-10 07:48:39,315 INFO L226 Difference]: Without dead ends: 149067 [2019-09-10 07:48:39,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 223 SyntacticMatches, 19 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7744 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=4649, Invalid=18607, Unknown=0, NotChecked=0, Total=23256 [2019-09-10 07:48:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149067 states. [2019-09-10 07:48:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149067 to 77053. [2019-09-10 07:48:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77053 states. [2019-09-10 07:48:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77053 states to 77053 states and 95209 transitions. [2019-09-10 07:48:41,531 INFO L78 Accepts]: Start accepts. Automaton has 77053 states and 95209 transitions. Word has length 130 [2019-09-10 07:48:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:41,531 INFO L475 AbstractCegarLoop]: Abstraction has 77053 states and 95209 transitions. [2019-09-10 07:48:41,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:48:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 77053 states and 95209 transitions. [2019-09-10 07:48:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:48:41,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:41,544 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:41,544 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:41,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:41,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1802869750, now seen corresponding path program 1 times [2019-09-10 07:48:41,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:41,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:41,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:41,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:41,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:41,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:41,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:41,940 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2019-09-10 07:48:41,940 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], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1887], [1890], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1938], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:48:41,954 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:41,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:42,009 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:42,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:42,530 INFO L272 AbstractInterpreter]: Visited 123 different actions 610 times. Merged at 50 different actions 431 times. Widened at 19 different actions 80 times. Performed 2076 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2076 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 49 fixpoints after 14 different actions. Largest state had 189 variables. [2019-09-10 07:48:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:42,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:42,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:42,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:48:42,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:42,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:48:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:42,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 07:48:42,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:48:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:43,329 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:48:43,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:43,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:45,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:48:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:45,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:48:45,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:48:45,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:48:45,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:48:45,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:48:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:48:45,690 INFO L87 Difference]: Start difference. First operand 77053 states and 95209 transitions. Second operand 20 states. [2019-09-10 07:48:45,829 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:48:46,351 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 07:48:46,897 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:48:47,287 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:48:47,761 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:48:48,024 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:48:48,489 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:48:48,972 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:48:49,364 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:48:49,683 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:48:50,199 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:48:50,397 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:48:50,651 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:48:50,902 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:48:51,543 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:48:51,789 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 07:48:52,237 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:48:52,620 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:48:52,845 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:48:53,265 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:48:53,789 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 07:48:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:54,085 INFO L93 Difference]: Finished difference Result 228759 states and 278290 transitions. [2019-09-10 07:48:54,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:48:54,086 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 131 [2019-09-10 07:48:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:54,377 INFO L225 Difference]: With dead ends: 228759 [2019-09-10 07:48:54,377 INFO L226 Difference]: Without dead ends: 228759 [2019-09-10 07:48:54,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 227 SyntacticMatches, 22 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=648, Invalid=1704, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:48:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228759 states. [2019-09-10 07:48:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228759 to 154740. [2019-09-10 07:48:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154740 states. [2019-09-10 07:48:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154740 states to 154740 states and 190199 transitions. [2019-09-10 07:48:58,770 INFO L78 Accepts]: Start accepts. Automaton has 154740 states and 190199 transitions. Word has length 131 [2019-09-10 07:48:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:58,771 INFO L475 AbstractCegarLoop]: Abstraction has 154740 states and 190199 transitions. [2019-09-10 07:48:58,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:48:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 154740 states and 190199 transitions. [2019-09-10 07:48:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:48:58,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:58,780 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:48:58,780 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1670981759, now seen corresponding path program 1 times [2019-09-10 07:48:58,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:58,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:58,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:59,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:59,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:48:59,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:48:59,312 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], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [144], [191], [194], [199], [202], [206], [219], [221], [247], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1887], [1890], [1896], [1898], [1901], [1916], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:48:59,316 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:48:59,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:48:59,346 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:48:59,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:48:59,801 INFO L272 AbstractInterpreter]: Visited 124 different actions 652 times. Merged at 50 different actions 467 times. Widened at 18 different actions 91 times. Performed 2171 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2171 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 50 fixpoints after 11 different actions. Largest state had 189 variables. [2019-09-10 07:48:59,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:59,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:48:59,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:48:59,802 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:48:59,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:59,824 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:48:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:59,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:48:59,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:00,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:00,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:00,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:01,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:49:01,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 10] total 29 [2019-09-10 07:49:01,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:49:01,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:49:01,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:49:01,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:49:01,093 INFO L87 Difference]: Start difference. First operand 154740 states and 190199 transitions. Second operand 25 states. [2019-09-10 07:49:01,526 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-09-10 07:49:01,928 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 07:49:02,202 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-09-10 07:49:02,449 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:49:02,875 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:49:03,261 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:49:03,523 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:49:03,962 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:49:04,244 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 07:49:04,638 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 07:49:05,086 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-10 07:49:05,369 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-10 07:49:05,815 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 07:49:06,121 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 07:49:07,784 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 07:49:08,282 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-10 07:49:08,572 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:49:09,352 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 07:49:09,529 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:49:09,926 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 07:49:10,346 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:49:10,876 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:49:12,391 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-09-10 07:49:12,856 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:49:13,699 WARN L188 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-10 07:49:14,195 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 07:49:14,624 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:49:14,885 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 07:49:15,429 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:49:15,864 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:49:16,570 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 07:49:17,316 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 07:49:17,864 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-10 07:49:18,326 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 07:49:18,531 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:49:18,950 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:49:21,662 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-09-10 07:49:22,530 WARN L188 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-09-10 07:49:22,923 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 07:49:23,143 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:49:24,056 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:49:24,356 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:49:24,807 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-10 07:49:25,017 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:49:26,203 WARN L188 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 07:49:26,836 WARN L188 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 07:49:27,278 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 07:49:27,647 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:49:27,967 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:49:28,362 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:49:28,866 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:49:29,375 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 07:49:29,696 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 07:49:30,368 WARN L188 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:49:30,654 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:49:31,042 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:49:31,581 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 07:49:32,161 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 07:49:32,720 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 07:49:32,988 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:49:33,161 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 07:49:33,455 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:49:34,391 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:49:34,624 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 07:49:35,264 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-10 07:49:35,525 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:49:35,796 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:49:36,182 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-10 07:49:36,426 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 07:49:36,646 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:49:37,383 WARN L188 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 07:49:37,876 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 07:49:38,201 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 07:49:38,633 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 07:49:38,893 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 07:49:39,056 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:49:39,289 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:49:40,026 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 07:49:40,334 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:49:40,783 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 07:49:41,185 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 07:49:42,387 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:49:42,626 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:49:43,678 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-09-10 07:49:44,109 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 07:49:44,675 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:49:45,504 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-09-10 07:49:46,014 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 07:49:46,304 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:49:46,816 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 07:49:47,122 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-09-10 07:49:47,449 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:49:47,949 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:49:48,382 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-09-10 07:49:48,750 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 07:49:49,054 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:49:49,367 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 07:49:49,533 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:49:50,338 WARN L188 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-09-10 07:49:50,586 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-10 07:49:51,154 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:49:51,549 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:49:52,240 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 07:49:52,658 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-10 07:49:53,201 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 07:49:53,566 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 07:49:53,874 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 07:49:54,051 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:49:54,262 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:49:54,577 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:49:54,824 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:49:55,169 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:49:55,440 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:49:55,751 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 07:49:56,050 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-10 07:49:56,274 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:49:56,536 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 07:49:56,840 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 07:49:57,628 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 07:49:58,365 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-09-10 07:49:58,660 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-09-10 07:49:59,063 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 07:49:59,701 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-10 07:50:00,038 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 07:50:00,585 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-10 07:50:01,172 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 07:50:01,924 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-09-10 07:50:02,624 WARN L188 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-09-10 07:50:07,467 WARN L188 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2019-09-10 07:50:08,041 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2019-09-10 07:50:08,550 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-10 07:50:08,934 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 07:50:09,192 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:50:09,532 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:50:10,020 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 07:50:10,484 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-10 07:50:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:10,536 INFO L93 Difference]: Finished difference Result 652942 states and 799711 transitions. [2019-09-10 07:50:10,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-10 07:50:10,536 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-09-10 07:50:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:11,271 INFO L225 Difference]: With dead ends: 652942 [2019-09-10 07:50:11,271 INFO L226 Difference]: Without dead ends: 652942 [2019-09-10 07:50:11,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 250 SyntacticMatches, 3 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10618 ImplicationChecksByTransitivity, 57.1s TimeCoverageRelationStatistics Valid=4269, Invalid=24461, Unknown=0, NotChecked=0, Total=28730 [2019-09-10 07:50:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652942 states. [2019-09-10 07:50:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652942 to 187908. [2019-09-10 07:50:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187908 states. [2019-09-10 07:50:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187908 states to 187908 states and 231822 transitions. [2019-09-10 07:50:15,932 INFO L78 Accepts]: Start accepts. Automaton has 187908 states and 231822 transitions. Word has length 132 [2019-09-10 07:50:15,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:15,932 INFO L475 AbstractCegarLoop]: Abstraction has 187908 states and 231822 transitions. [2019-09-10 07:50:15,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:50:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 187908 states and 231822 transitions. [2019-09-10 07:50:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:50:15,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:15,941 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:50:15,942 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:15,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1519808077, now seen corresponding path program 1 times [2019-09-10 07:50:15,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:15,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:16,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:16,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:16,307 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:50:16,308 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], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:50:16,317 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:16,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:16,364 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:16,864 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:16,865 INFO L272 AbstractInterpreter]: Visited 124 different actions 633 times. Merged at 51 different actions 455 times. Widened at 16 different actions 67 times. Performed 2102 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2102 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 50 fixpoints after 13 different actions. Largest state had 189 variables. [2019-09-10 07:50:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:16,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:16,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:16,865 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) [2019-09-10 07:50:16,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:16,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:17,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:50:17,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:17,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:17,544 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:50:17,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:18,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:22,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:22,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 07:50:22,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:22,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:50:22,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:50:22,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=560, Unknown=1, NotChecked=0, Total=650 [2019-09-10 07:50:22,573 INFO L87 Difference]: Start difference. First operand 187908 states and 231822 transitions. Second operand 20 states. [2019-09-10 07:50:29,850 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 07:50:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:32,076 INFO L93 Difference]: Finished difference Result 600554 states and 724805 transitions. [2019-09-10 07:50:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:50:32,077 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 132 [2019-09-10 07:50:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:32,725 INFO L225 Difference]: With dead ends: 600554 [2019-09-10 07:50:32,725 INFO L226 Difference]: Without dead ends: 600554 [2019-09-10 07:50:32,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 214 SyntacticMatches, 37 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=648, Invalid=1703, Unknown=1, NotChecked=0, Total=2352 [2019-09-10 07:50:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600554 states. [2019-09-10 07:50:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600554 to 380766. [2019-09-10 07:50:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380766 states. [2019-09-10 07:50:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380766 states to 380766 states and 467256 transitions. [2019-09-10 07:50:43,210 INFO L78 Accepts]: Start accepts. Automaton has 380766 states and 467256 transitions. Word has length 132 [2019-09-10 07:50:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:43,211 INFO L475 AbstractCegarLoop]: Abstraction has 380766 states and 467256 transitions. [2019-09-10 07:50:43,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:50:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 380766 states and 467256 transitions. [2019-09-10 07:50:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:50:43,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:43,230 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:50:43,231 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:43,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:43,231 INFO L82 PathProgramCache]: Analyzing trace with hash 666802314, now seen corresponding path program 1 times [2019-09-10 07:50:43,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:43,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:43,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:43,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:43,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 07:50:43,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:50:43,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:50:43,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:50:43,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:50:43,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:50:43,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:50:43,290 INFO L87 Difference]: Start difference. First operand 380766 states and 467256 transitions. Second operand 4 states. [2019-09-10 07:50:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:45,690 INFO L93 Difference]: Finished difference Result 442328 states and 542317 transitions. [2019-09-10 07:50:45,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:50:45,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 07:50:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:46,223 INFO L225 Difference]: With dead ends: 442328 [2019-09-10 07:50:46,223 INFO L226 Difference]: Without dead ends: 442328 [2019-09-10 07:50:46,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:50:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442328 states. [2019-09-10 07:50:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442328 to 322136. [2019-09-10 07:50:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322136 states. [2019-09-10 07:51:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322136 states to 322136 states and 395811 transitions. [2019-09-10 07:51:00,925 INFO L78 Accepts]: Start accepts. Automaton has 322136 states and 395811 transitions. Word has length 133 [2019-09-10 07:51:00,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:00,925 INFO L475 AbstractCegarLoop]: Abstraction has 322136 states and 395811 transitions. [2019-09-10 07:51:00,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:51:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 322136 states and 395811 transitions. [2019-09-10 07:51:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:51:00,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:00,936 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:51:00,936 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash -789917506, now seen corresponding path program 1 times [2019-09-10 07:51:00,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:00,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:00,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:01,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:01,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:01,802 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:51:01,803 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], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1907], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:51:01,806 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:01,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:01,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:02,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:02,237 INFO L272 AbstractInterpreter]: Visited 125 different actions 678 times. Merged at 52 different actions 496 times. Widened at 16 different actions 75 times. Performed 2249 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2249 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 52 fixpoints after 11 different actions. Largest state had 189 variables. [2019-09-10 07:51:02,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:02,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:02,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:02,238 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) [2019-09-10 07:51:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:02,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:02,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 07:51:02,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:03,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:03,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:03,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:03,414 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:51:03,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:03,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:03,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:03,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:04,833 WARN L188 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-09-10 07:51:05,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-09-10 07:51:06,194 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-10 07:51:06,948 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-09-10 07:51:06,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-09-10 07:51:07,546 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46 [2019-09-10 07:51:07,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:07,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:51:08,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:09,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:09,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:09,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:09,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:10,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:10,991 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-10 07:51:11,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:51:12,106 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:51:12,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23, 23] imperfect sequences [18] total 60 [2019-09-10 07:51:12,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:51:12,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 07:51:12,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 07:51:12,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3258, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 07:51:12,108 INFO L87 Difference]: Start difference. First operand 322136 states and 395811 transitions. Second operand 23 states. [2019-09-10 07:51:14,883 WARN L188 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-09-10 07:51:16,183 WARN L188 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 170 [2019-09-10 07:51:17,750 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 88 [2019-09-10 07:51:21,413 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:51:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:25,158 INFO L93 Difference]: Finished difference Result 602041 states and 740701 transitions. [2019-09-10 07:51:25,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:51:25,159 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 133 [2019-09-10 07:51:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:25,764 INFO L225 Difference]: With dead ends: 602041 [2019-09-10 07:51:25,764 INFO L226 Difference]: Without dead ends: 602041 [2019-09-10 07:51:25,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 220 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=464, Invalid=4506, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 07:51:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602041 states. [2019-09-10 07:51:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602041 to 322151. [2019-09-10 07:51:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322151 states. [2019-09-10 07:51:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322151 states to 322151 states and 395828 transitions. [2019-09-10 07:51:34,969 INFO L78 Accepts]: Start accepts. Automaton has 322151 states and 395828 transitions. Word has length 133 [2019-09-10 07:51:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:34,969 INFO L475 AbstractCegarLoop]: Abstraction has 322151 states and 395828 transitions. [2019-09-10 07:51:34,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 07:51:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 322151 states and 395828 transitions. [2019-09-10 07:51:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:51:34,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:34,979 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:51:34,979 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:34,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:34,980 INFO L82 PathProgramCache]: Analyzing trace with hash -897827669, now seen corresponding path program 1 times [2019-09-10 07:51:34,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:34,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:34,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:34,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:34,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:35,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:35,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:35,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:51:35,291 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], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1650], [1672], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1894], [1896], [1898], [1901], [1904], [1907], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:51:35,293 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:35,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:35,337 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:35,779 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:35,781 INFO L272 AbstractInterpreter]: Visited 125 different actions 500 times. Merged at 51 different actions 333 times. Widened at 13 different actions 31 times. Performed 1777 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1777 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 11 different actions. Largest state had 189 variables. [2019-09-10 07:51:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:35,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:35,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:35,782 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) [2019-09-10 07:51:35,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:35,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:35,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:51:35,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:36,243 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:36,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:36,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:37,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:37,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:37,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2019-09-10 07:51:37,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:37,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:51:37,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:51:37,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:51:37,557 INFO L87 Difference]: Start difference. First operand 322151 states and 395828 transitions. Second operand 19 states. [2019-09-10 07:51:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:47,473 INFO L93 Difference]: Finished difference Result 745164 states and 906304 transitions. [2019-09-10 07:51:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 07:51:47,473 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 133 [2019-09-10 07:51:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:48,220 INFO L225 Difference]: With dead ends: 745164 [2019-09-10 07:51:48,221 INFO L226 Difference]: Without dead ends: 745164 [2019-09-10 07:51:48,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 216 SyntacticMatches, 33 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2409 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1326, Invalid=4836, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 07:51:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745164 states. [2019-09-10 07:51:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745164 to 444907. [2019-09-10 07:51:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444907 states. [2019-09-10 07:51:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444907 states to 444907 states and 545180 transitions. [2019-09-10 07:51:58,365 INFO L78 Accepts]: Start accepts. Automaton has 444907 states and 545180 transitions. Word has length 133 [2019-09-10 07:51:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:58,365 INFO L475 AbstractCegarLoop]: Abstraction has 444907 states and 545180 transitions. [2019-09-10 07:51:58,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:51:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 444907 states and 545180 transitions. [2019-09-10 07:51:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:51:58,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:58,374 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:51:58,374 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:58,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:58,374 INFO L82 PathProgramCache]: Analyzing trace with hash 625720963, now seen corresponding path program 1 times [2019-09-10 07:51:58,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:58,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:58,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:59,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:59,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:59,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:51:59,667 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], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1211], [1248], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1960], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:51:59,670 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:59,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:59,704 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:00,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:52:00,148 INFO L272 AbstractInterpreter]: Visited 125 different actions 739 times. Merged at 51 different actions 549 times. Widened at 17 different actions 97 times. Performed 2408 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2408 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 60 fixpoints after 12 different actions. Largest state had 189 variables. [2019-09-10 07:52:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:00,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:52:00,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:00,149 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:52:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:00,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:52:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:00,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:52:00,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:52:00,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:00,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:00,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:00,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:00,758 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:00,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:00,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:01,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:52:01,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2019-09-10 07:52:01,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:52:01,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:52:01,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:52:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:52:01,719 INFO L87 Difference]: Start difference. First operand 444907 states and 545180 transitions. Second operand 19 states. [2019-09-10 07:52:06,271 WARN L188 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-10 07:52:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:17,349 INFO L93 Difference]: Finished difference Result 1309547 states and 1579749 transitions. [2019-09-10 07:52:17,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 07:52:17,350 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 133 [2019-09-10 07:52:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:19,740 INFO L225 Difference]: With dead ends: 1309547 [2019-09-10 07:52:19,740 INFO L226 Difference]: Without dead ends: 1309547 [2019-09-10 07:52:19,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 230 SyntacticMatches, 18 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2118 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1264, Invalid=5216, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 07:52:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309547 states. [2019-09-10 07:52:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309547 to 444833. [2019-09-10 07:52:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444833 states. [2019-09-10 07:52:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444833 states to 444833 states and 545104 transitions. [2019-09-10 07:52:34,469 INFO L78 Accepts]: Start accepts. Automaton has 444833 states and 545104 transitions. Word has length 133 [2019-09-10 07:52:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:34,469 INFO L475 AbstractCegarLoop]: Abstraction has 444833 states and 545104 transitions. [2019-09-10 07:52:34,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:52:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 444833 states and 545104 transitions. [2019-09-10 07:52:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:52:34,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:34,475 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:52:34,475 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:34,476 INFO L82 PathProgramCache]: Analyzing trace with hash 410100622, now seen corresponding path program 1 times [2019-09-10 07:52:34,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:34,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:34,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:34,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:34,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:35,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:35,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:52:35,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:52:35,971 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], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [142], [191], [194], [199], [202], [206], [219], [221], [249], [289], [292], [295], [300], [353], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1909], [1912], [1918], [1920], [1923], [1938], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:52:35,979 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:52:35,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:52:36,003 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:36,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:52:36,582 INFO L272 AbstractInterpreter]: Visited 125 different actions 824 times. Merged at 51 different actions 622 times. Widened at 20 different actions 113 times. Performed 2693 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2693 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 69 fixpoints after 19 different actions. Largest state had 189 variables. [2019-09-10 07:52:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:36,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:52:36,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:36,582 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) [2019-09-10 07:52:36,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:36,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:52:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:36,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:52:36,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:52:36,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:36,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:36,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:36,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:37,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:37,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:37,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:37,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:37,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:37,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:38,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:38,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:52:38,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2019-09-10 07:52:38,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:52:38,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:52:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:52:38,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:52:38,346 INFO L87 Difference]: Start difference. First operand 444833 states and 545104 transitions. Second operand 21 states. [2019-09-10 07:52:40,237 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 29 [2019-09-10 07:52:40,891 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-09-10 07:52:41,693 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-09-10 07:52:42,201 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-10 07:52:43,478 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2019-09-10 07:52:44,050 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2019-09-10 07:52:44,625 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2019-09-10 07:52:45,396 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-10 07:52:47,351 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2019-09-10 07:53:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:01,327 INFO L93 Difference]: Finished difference Result 1779387 states and 2159555 transitions. [2019-09-10 07:53:01,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 07:53:01,327 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 133 [2019-09-10 07:53:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:04,452 INFO L225 Difference]: With dead ends: 1779387 [2019-09-10 07:53:04,452 INFO L226 Difference]: Without dead ends: 1779387 [2019-09-10 07:53:04,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 228 SyntacticMatches, 19 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2179 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1528, Invalid=5954, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 07:53:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779387 states. [2019-09-10 07:53:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779387 to 444790. [2019-09-10 07:53:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444790 states. [2019-09-10 07:53:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444790 states to 444790 states and 545059 transitions. [2019-09-10 07:53:23,226 INFO L78 Accepts]: Start accepts. Automaton has 444790 states and 545059 transitions. Word has length 133 [2019-09-10 07:53:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:23,226 INFO L475 AbstractCegarLoop]: Abstraction has 444790 states and 545059 transitions. [2019-09-10 07:53:23,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:53:23,226 INFO L276 IsEmpty]: Start isEmpty. Operand 444790 states and 545059 transitions. [2019-09-10 07:53:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:53:23,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:23,231 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:53:23,231 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:23,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1909109261, now seen corresponding path program 1 times [2019-09-10 07:53:23,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:23,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:23,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:23,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:23,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:24,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:24,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:53:24,093 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:53:24,094 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], [76], [79], [82], [86], [89], [92], [96], [99], [102], [106], [109], [112], [115], [119], [122], [125], [129], [132], [136], [139], [144], [191], [194], [199], [202], [206], [219], [221], [247], [249], [289], [292], [295], [298], [355], [1124], [1127], [1128], [1130], [1200], [1203], [1206], [1209], [1250], [1639], [1642], [1645], [1648], [1674], [1850], [1853], [1857], [1860], [1863], [1867], [1869], [1872], [1877], [1879], [1882], [1885], [1896], [1898], [1901], [1904], [1907], [1918], [1920], [1923], [1926], [1931], [1934], [1940], [1942], [1945], [1948], [1953], [1956], [1962], [1964], [1966], [1969], [1972], [1980], [1982], [1985], [1988], [1996], [1998], [2001], [2004], [2012], [2014], [2017], [2020], [2028], [2065], [2066], [2070], [2071], [2072] [2019-09-10 07:53:24,097 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:53:24,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:53:24,126 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:53:24,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:53:24,444 INFO L272 AbstractInterpreter]: Visited 126 different actions 612 times. Merged at 52 different actions 435 times. Widened at 16 different actions 55 times. Performed 2080 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2080 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 48 fixpoints after 14 different actions. Largest state had 189 variables. [2019-09-10 07:53:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:24,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:53:24,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:24,445 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:53:24,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:24,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:53:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:24,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 07:53:24,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:53:25,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:25,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:25,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:25,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:27,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:36,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:53:37,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:37,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:37,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:38,319 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 07:53:39,071 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-09-10 07:53:39,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:53:47,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:53:48,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:49,106 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 133 [2019-09-10 07:53:49,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 07:53:49,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:49,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:49,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:49,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:49,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:49,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:50,032 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-09-10 07:53:50,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 07:53:50,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:50,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:50,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:50,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:51,637 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2019-09-10 07:53:56,412 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 60 [2019-09-10 07:53:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:56,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:53:56,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 24] total 69 [2019-09-10 07:53:56,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:53:56,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 07:53:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 07:53:56,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=4380, Unknown=1, NotChecked=0, Total=4692 [2019-09-10 07:53:56,698 INFO L87 Difference]: Start difference. First operand 444790 states and 545059 transitions. Second operand 47 states. [2019-09-10 07:53:57,667 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 60 [2019-09-10 07:54:16,262 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 42 [2019-09-10 07:54:19,448 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2019-09-10 07:54:28,683 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-09-10 07:54:38,465 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-09-10 07:54:51,278 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 07:55:05,122 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 07:55:14,498 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 07:55:22,749 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 07:55:24,127 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-09-10 07:55:27,804 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:55:38,270 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-09-10 07:55:46,430 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 07:55:52,295 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-09-10 07:55:57,837 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 07:56:08,009 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 07:56:20,412 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-09-10 07:56:26,256 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-09-10 07:56:33,972 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-09-10 07:56:50,491 WARN L188 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-09-10 07:57:05,383 WARN L188 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:57:09,739 WARN L188 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-10 07:57:21,771 WARN L188 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-09-10 07:57:46,172 WARN L188 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-10 07:57:51,682 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:57:59,883 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:58:05,428 WARN L188 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:58:17,086 WARN L188 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-09-10 07:58:33,625 WARN L188 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 07:58:59,486 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46