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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:17:41,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:17:41,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:17:41,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:17:41,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:17:41,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:17:41,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:17:41,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:17:41,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:17:41,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:17:41,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:17:41,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:17:41,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:17:41,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:17:41,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:17:41,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:17:41,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:17:41,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:17:41,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:17:41,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:17:41,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:17:41,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:17:41,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:17:41,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:17:41,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:17:41,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:17:41,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:17:41,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:17:41,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:17:41,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:17:41,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:17:41,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:17:41,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:17:41,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:17:41,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:17:41,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:17:41,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:17:41,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:17:41,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:17:41,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:17:41,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:17:41,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:17:41,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:17:41,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:17:41,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:17:41,567 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:17:41,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:17:41,569 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:17:41,569 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:17:41,569 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:17:41,569 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:17:41,569 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:17:41,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:17:41,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:17:41,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:17:41,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:17:41,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:17:41,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:17:41,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:17:41,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:17:41,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:17:41,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:17:41,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:17:41,573 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:17:41,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:17:41,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:17:41,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:17:41,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:17:41,575 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:17:41,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:17:41,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:17:41,575 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:17:41,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:17:41,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:17:41,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:17:41,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:17:41,655 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:17:41,656 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-10 08:17:41,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9f844ff/2b7ca1e7c0fc4da8a33698576b4e4715/FLAG30acd5da7 [2019-09-10 08:17:42,493 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:17:42,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-10 08:17:42,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9f844ff/2b7ca1e7c0fc4da8a33698576b4e4715/FLAG30acd5da7 [2019-09-10 08:17:42,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9f844ff/2b7ca1e7c0fc4da8a33698576b4e4715 [2019-09-10 08:17:42,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:17:42,619 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:17:42,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:17:42,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:17:42,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:17:42,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:17:42" (1/1) ... [2019-09-10 08:17:42,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270b417c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:42, skipping insertion in model container [2019-09-10 08:17:42,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:17:42" (1/1) ... [2019-09-10 08:17:42,636 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:17:42,879 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:17:44,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:17:44,830 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:17:45,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:17:45,811 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:17:45,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45 WrapperNode [2019-09-10 08:17:45,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:17:45,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:17:45,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:17:45,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:17:45,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45" (1/1) ... [2019-09-10 08:17:45,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45" (1/1) ... [2019-09-10 08:17:45,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45" (1/1) ... [2019-09-10 08:17:45,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45" (1/1) ... [2019-09-10 08:17:46,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45" (1/1) ... [2019-09-10 08:17:46,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45" (1/1) ... [2019-09-10 08:17:46,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45" (1/1) ... [2019-09-10 08:17:46,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:17:46,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:17:46,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:17:46,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:17:46,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:17:46,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:17:46,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:17:46,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:17:46,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:17:46,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:17:46,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:17:46,302 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:17:46,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:17:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:17:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:17:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:17:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:17:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:17:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:17:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:17:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:17:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:17:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:17:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:17:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:17:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:17:52,358 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:17:52,359 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:17:52,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:17:52 BoogieIcfgContainer [2019-09-10 08:17:52,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:17:52,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:17:52,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:17:52,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:17:52,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:17:42" (1/3) ... [2019-09-10 08:17:52,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cdc811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:17:52, skipping insertion in model container [2019-09-10 08:17:52,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:17:45" (2/3) ... [2019-09-10 08:17:52,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cdc811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:17:52, skipping insertion in model container [2019-09-10 08:17:52,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:17:52" (3/3) ... [2019-09-10 08:17:52,380 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-10 08:17:52,390 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:17:52,402 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-10 08:17:52,419 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-10 08:17:52,447 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:17:52,447 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:17:52,447 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:17:52,447 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:17:52,447 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:17:52,448 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:17:52,448 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:17:52,448 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:17:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states. [2019-09-10 08:17:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:17:52,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:52,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:52,559 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:52,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1776998407, now seen corresponding path program 1 times [2019-09-10 08:17:52,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:52,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:52,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:52,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:53,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:53,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:17:53,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:53,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:17:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:17:53,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:17:53,538 INFO L87 Difference]: Start difference. First operand 2546 states. Second operand 5 states. [2019-09-10 08:17:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:56,078 INFO L93 Difference]: Finished difference Result 2061 states and 3478 transitions. [2019-09-10 08:17:56,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:17:56,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:17:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:56,113 INFO L225 Difference]: With dead ends: 2061 [2019-09-10 08:17:56,114 INFO L226 Difference]: Without dead ends: 2049 [2019-09-10 08:17:56,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2019-09-10 08:17:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2049. [2019-09-10 08:17:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-09-10 08:17:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2637 transitions. [2019-09-10 08:17:56,251 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2637 transitions. Word has length 91 [2019-09-10 08:17:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:56,252 INFO L475 AbstractCegarLoop]: Abstraction has 2049 states and 2637 transitions. [2019-09-10 08:17:56,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:17:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2637 transitions. [2019-09-10 08:17:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:17:56,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:56,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:56,261 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash 303122164, now seen corresponding path program 1 times [2019-09-10 08:17:56,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:56,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:56,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:56,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:56,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:56,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:56,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:17:56,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:56,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:17:56,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:17:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:17:56,521 INFO L87 Difference]: Start difference. First operand 2049 states and 2637 transitions. Second operand 5 states. [2019-09-10 08:17:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:58,239 INFO L93 Difference]: Finished difference Result 1660 states and 2159 transitions. [2019-09-10 08:17:58,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:17:58,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:17:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:58,253 INFO L225 Difference]: With dead ends: 1660 [2019-09-10 08:17:58,253 INFO L226 Difference]: Without dead ends: 1660 [2019-09-10 08:17:58,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2019-09-10 08:17:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1660. [2019-09-10 08:17:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-09-10 08:17:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2159 transitions. [2019-09-10 08:17:58,308 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2159 transitions. Word has length 91 [2019-09-10 08:17:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:58,309 INFO L475 AbstractCegarLoop]: Abstraction has 1660 states and 2159 transitions. [2019-09-10 08:17:58,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:17:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2159 transitions. [2019-09-10 08:17:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:17:58,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:58,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:58,318 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1974545675, now seen corresponding path program 1 times [2019-09-10 08:17:58,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:58,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:58,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:58,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:58,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:58,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:58,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:17:58,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:58,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:17:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:17:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:17:58,677 INFO L87 Difference]: Start difference. First operand 1660 states and 2159 transitions. Second operand 5 states. [2019-09-10 08:17:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:59,857 INFO L93 Difference]: Finished difference Result 1182 states and 1540 transitions. [2019-09-10 08:17:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:17:59,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:17:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:59,863 INFO L225 Difference]: With dead ends: 1182 [2019-09-10 08:17:59,863 INFO L226 Difference]: Without dead ends: 1182 [2019-09-10 08:17:59,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2019-09-10 08:17:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2019-09-10 08:17:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-09-10 08:17:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1540 transitions. [2019-09-10 08:17:59,888 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1540 transitions. Word has length 91 [2019-09-10 08:17:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:59,889 INFO L475 AbstractCegarLoop]: Abstraction has 1182 states and 1540 transitions. [2019-09-10 08:17:59,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:17:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1540 transitions. [2019-09-10 08:17:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:17:59,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:59,893 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:59,894 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash -920384266, now seen corresponding path program 1 times [2019-09-10 08:17:59,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:59,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:59,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:59,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:59,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:00,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:00,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:18:00,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:00,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:18:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:18:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:18:00,114 INFO L87 Difference]: Start difference. First operand 1182 states and 1540 transitions. Second operand 5 states. [2019-09-10 08:18:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:00,879 INFO L93 Difference]: Finished difference Result 802 states and 1041 transitions. [2019-09-10 08:18:00,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:18:00,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 08:18:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:00,886 INFO L225 Difference]: With dead ends: 802 [2019-09-10 08:18:00,886 INFO L226 Difference]: Without dead ends: 802 [2019-09-10 08:18:00,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:18:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-10 08:18:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2019-09-10 08:18:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-09-10 08:18:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1041 transitions. [2019-09-10 08:18:00,905 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1041 transitions. Word has length 93 [2019-09-10 08:18:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:00,905 INFO L475 AbstractCegarLoop]: Abstraction has 802 states and 1041 transitions. [2019-09-10 08:18:00,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:18:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1041 transitions. [2019-09-10 08:18:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:18:00,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:00,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:00,910 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:00,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1089233402, now seen corresponding path program 1 times [2019-09-10 08:18:00,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:00,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:00,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:00,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:00,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:01,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:01,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:18:01,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:01,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:18:01,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:18:01,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:18:01,162 INFO L87 Difference]: Start difference. First operand 802 states and 1041 transitions. Second operand 5 states. [2019-09-10 08:18:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:01,726 INFO L93 Difference]: Finished difference Result 714 states and 929 transitions. [2019-09-10 08:18:01,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:18:01,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 08:18:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:01,731 INFO L225 Difference]: With dead ends: 714 [2019-09-10 08:18:01,732 INFO L226 Difference]: Without dead ends: 714 [2019-09-10 08:18:01,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:18:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-10 08:18:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2019-09-10 08:18:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-09-10 08:18:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 929 transitions. [2019-09-10 08:18:01,746 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 929 transitions. Word has length 95 [2019-09-10 08:18:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:01,746 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 929 transitions. [2019-09-10 08:18:01,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:18:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 929 transitions. [2019-09-10 08:18:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:18:01,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:01,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:01,750 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:01,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash -414406108, now seen corresponding path program 1 times [2019-09-10 08:18:01,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:01,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:01,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:01,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:01,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:18:01,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:01,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:18:01,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:18:01,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:18:01,968 INFO L87 Difference]: Start difference. First operand 714 states and 929 transitions. Second operand 5 states. [2019-09-10 08:18:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:02,690 INFO L93 Difference]: Finished difference Result 706 states and 919 transitions. [2019-09-10 08:18:02,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:18:02,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:18:02,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:02,698 INFO L225 Difference]: With dead ends: 706 [2019-09-10 08:18:02,698 INFO L226 Difference]: Without dead ends: 706 [2019-09-10 08:18:02,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:18:02,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-09-10 08:18:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2019-09-10 08:18:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 919 transitions. [2019-09-10 08:18:02,712 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 919 transitions. Word has length 97 [2019-09-10 08:18:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:02,713 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 919 transitions. [2019-09-10 08:18:02,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:18:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 919 transitions. [2019-09-10 08:18:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:18:02,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:02,720 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 08:18:02,727 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:02,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:02,728 INFO L82 PathProgramCache]: Analyzing trace with hash -358667265, now seen corresponding path program 1 times [2019-09-10 08:18:02,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:02,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:03,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:03,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:18:03,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:03,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:18:03,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:18:03,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:18:03,157 INFO L87 Difference]: Start difference. First operand 706 states and 919 transitions. Second operand 8 states. [2019-09-10 08:18:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:04,597 INFO L93 Difference]: Finished difference Result 955 states and 1193 transitions. [2019-09-10 08:18:04,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:18:04,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-09-10 08:18:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:04,602 INFO L225 Difference]: With dead ends: 955 [2019-09-10 08:18:04,602 INFO L226 Difference]: Without dead ends: 955 [2019-09-10 08:18:04,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:18:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-10 08:18:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 706. [2019-09-10 08:18:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 918 transitions. [2019-09-10 08:18:04,618 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 918 transitions. Word has length 99 [2019-09-10 08:18:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:04,619 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 918 transitions. [2019-09-10 08:18:04,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:18:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 918 transitions. [2019-09-10 08:18:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:18:04,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:04,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:04,622 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1672611521, now seen corresponding path program 1 times [2019-09-10 08:18:04,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:04,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:04,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:04,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:04,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:04,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:04,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:04,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:04,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:04,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:04,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:04,910 INFO L87 Difference]: Start difference. First operand 706 states and 918 transitions. Second operand 9 states. [2019-09-10 08:18:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:06,900 INFO L93 Difference]: Finished difference Result 1228 states and 1618 transitions. [2019-09-10 08:18:06,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:06,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:18:06,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:06,907 INFO L225 Difference]: With dead ends: 1228 [2019-09-10 08:18:06,907 INFO L226 Difference]: Without dead ends: 1228 [2019-09-10 08:18:06,907 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 08:18:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-10 08:18:06,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-10 08:18:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 917 transitions. [2019-09-10 08:18:06,923 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 917 transitions. Word has length 99 [2019-09-10 08:18:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:06,923 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 917 transitions. [2019-09-10 08:18:06,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 917 transitions. [2019-09-10 08:18:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:18:06,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:06,926 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 08:18:06,927 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:06,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1607232673, now seen corresponding path program 1 times [2019-09-10 08:18:06,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:06,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:06,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:07,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:07,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:07,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:07,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:07,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:07,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:07,187 INFO L87 Difference]: Start difference. First operand 706 states and 917 transitions. Second operand 9 states. [2019-09-10 08:18:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:09,336 INFO L93 Difference]: Finished difference Result 1240 states and 1639 transitions. [2019-09-10 08:18:09,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:09,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:18:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:09,343 INFO L225 Difference]: With dead ends: 1240 [2019-09-10 08:18:09,343 INFO L226 Difference]: Without dead ends: 1240 [2019-09-10 08:18:09,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-09-10 08:18:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 706. [2019-09-10 08:18:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 916 transitions. [2019-09-10 08:18:09,359 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 916 transitions. Word has length 99 [2019-09-10 08:18:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:09,359 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 916 transitions. [2019-09-10 08:18:09,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 916 transitions. [2019-09-10 08:18:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:18:09,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:09,362 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 08:18:09,363 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -45829627, now seen corresponding path program 1 times [2019-09-10 08:18:09,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:09,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:09,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:09,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:09,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:09,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:09,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:09,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:09,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:09,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:09,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:09,623 INFO L87 Difference]: Start difference. First operand 706 states and 916 transitions. Second operand 9 states. [2019-09-10 08:18:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:11,571 INFO L93 Difference]: Finished difference Result 1228 states and 1616 transitions. [2019-09-10 08:18:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:11,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:18:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:11,578 INFO L225 Difference]: With dead ends: 1228 [2019-09-10 08:18:11,578 INFO L226 Difference]: Without dead ends: 1228 [2019-09-10 08:18:11,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-10 08:18:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-10 08:18:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 915 transitions. [2019-09-10 08:18:11,594 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 915 transitions. Word has length 100 [2019-09-10 08:18:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:11,594 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 915 transitions. [2019-09-10 08:18:11,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 915 transitions. [2019-09-10 08:18:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:18:11,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:11,597 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 08:18:11,597 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1007680891, now seen corresponding path program 1 times [2019-09-10 08:18:11,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:11,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:11,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:11,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:11,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:11,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:11,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:11,860 INFO L87 Difference]: Start difference. First operand 706 states and 915 transitions. Second operand 9 states. [2019-09-10 08:18:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:14,305 INFO L93 Difference]: Finished difference Result 1235 states and 1633 transitions. [2019-09-10 08:18:14,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:14,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:18:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:14,312 INFO L225 Difference]: With dead ends: 1235 [2019-09-10 08:18:14,312 INFO L226 Difference]: Without dead ends: 1235 [2019-09-10 08:18:14,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-10 08:18:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 706. [2019-09-10 08:18:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 914 transitions. [2019-09-10 08:18:14,326 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 914 transitions. Word has length 100 [2019-09-10 08:18:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:14,327 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 914 transitions. [2019-09-10 08:18:14,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 914 transitions. [2019-09-10 08:18:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:18:14,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:14,329 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 08:18:14,330 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:14,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1056417724, now seen corresponding path program 1 times [2019-09-10 08:18:14,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:14,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:14,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:14,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:14,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:14,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:14,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:14,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:14,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:14,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:14,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:14,583 INFO L87 Difference]: Start difference. First operand 706 states and 914 transitions. Second operand 9 states. [2019-09-10 08:18:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:16,572 INFO L93 Difference]: Finished difference Result 1228 states and 1613 transitions. [2019-09-10 08:18:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:16,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:18:16,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:16,580 INFO L225 Difference]: With dead ends: 1228 [2019-09-10 08:18:16,580 INFO L226 Difference]: Without dead ends: 1228 [2019-09-10 08:18:16,581 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 08:18:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-10 08:18:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-10 08:18:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 913 transitions. [2019-09-10 08:18:16,596 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 913 transitions. Word has length 101 [2019-09-10 08:18:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:16,597 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 913 transitions. [2019-09-10 08:18:16,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 913 transitions. [2019-09-10 08:18:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:18:16,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:16,599 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 08:18:16,600 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash -434839516, now seen corresponding path program 1 times [2019-09-10 08:18:16,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:16,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:16,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:16,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:16,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:16,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:16,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:16,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:16,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:16,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:16,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:16,855 INFO L87 Difference]: Start difference. First operand 706 states and 913 transitions. Second operand 9 states. [2019-09-10 08:18:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:19,260 INFO L93 Difference]: Finished difference Result 1235 states and 1631 transitions. [2019-09-10 08:18:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:19,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:18:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:19,266 INFO L225 Difference]: With dead ends: 1235 [2019-09-10 08:18:19,267 INFO L226 Difference]: Without dead ends: 1235 [2019-09-10 08:18:19,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-10 08:18:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 706. [2019-09-10 08:18:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 912 transitions. [2019-09-10 08:18:19,281 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 912 transitions. Word has length 101 [2019-09-10 08:18:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:19,281 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 912 transitions. [2019-09-10 08:18:19,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 912 transitions. [2019-09-10 08:18:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:18:19,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:19,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:19,284 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:19,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:19,285 INFO L82 PathProgramCache]: Analyzing trace with hash -674178492, now seen corresponding path program 1 times [2019-09-10 08:18:19,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:19,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:19,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:19,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:19,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:19,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:19,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:19,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:19,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:19,529 INFO L87 Difference]: Start difference. First operand 706 states and 912 transitions. Second operand 9 states. [2019-09-10 08:18:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:21,600 INFO L93 Difference]: Finished difference Result 1228 states and 1611 transitions. [2019-09-10 08:18:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:21,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:18:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:21,606 INFO L225 Difference]: With dead ends: 1228 [2019-09-10 08:18:21,606 INFO L226 Difference]: Without dead ends: 1228 [2019-09-10 08:18:21,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-10 08:18:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-10 08:18:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 911 transitions. [2019-09-10 08:18:21,618 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 911 transitions. Word has length 101 [2019-09-10 08:18:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:21,619 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 911 transitions. [2019-09-10 08:18:21,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 911 transitions. [2019-09-10 08:18:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:18:21,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:21,622 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 08:18:21,622 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:21,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:21,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1611690492, now seen corresponding path program 1 times [2019-09-10 08:18:21,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:21,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:21,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:21,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:21,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:21,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:21,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:21,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:21,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:21,864 INFO L87 Difference]: Start difference. First operand 706 states and 911 transitions. Second operand 9 states. [2019-09-10 08:18:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:23,994 INFO L93 Difference]: Finished difference Result 1240 states and 1629 transitions. [2019-09-10 08:18:23,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:23,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:18:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:23,999 INFO L225 Difference]: With dead ends: 1240 [2019-09-10 08:18:23,999 INFO L226 Difference]: Without dead ends: 1240 [2019-09-10 08:18:24,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-09-10 08:18:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 706. [2019-09-10 08:18:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 910 transitions. [2019-09-10 08:18:24,014 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 910 transitions. Word has length 101 [2019-09-10 08:18:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:24,015 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 910 transitions. [2019-09-10 08:18:24,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 910 transitions. [2019-09-10 08:18:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:18:24,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:24,018 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:24,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1392154140, now seen corresponding path program 1 times [2019-09-10 08:18:24,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:24,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:24,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:24,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:24,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:24,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:24,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:24,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:24,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:24,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:24,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:24,270 INFO L87 Difference]: Start difference. First operand 706 states and 910 transitions. Second operand 9 states. [2019-09-10 08:18:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:26,303 INFO L93 Difference]: Finished difference Result 1228 states and 1609 transitions. [2019-09-10 08:18:26,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:26,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:18:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:26,310 INFO L225 Difference]: With dead ends: 1228 [2019-09-10 08:18:26,310 INFO L226 Difference]: Without dead ends: 1228 [2019-09-10 08:18:26,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-10 08:18:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-10 08:18:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 909 transitions. [2019-09-10 08:18:26,322 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 909 transitions. Word has length 101 [2019-09-10 08:18:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:26,322 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 909 transitions. [2019-09-10 08:18:26,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 909 transitions. [2019-09-10 08:18:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:18:26,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:26,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:26,325 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 277444804, now seen corresponding path program 1 times [2019-09-10 08:18:26,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:26,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:26,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:26,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:26,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:26,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:26,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:26,599 INFO L87 Difference]: Start difference. First operand 706 states and 909 transitions. Second operand 9 states. [2019-09-10 08:18:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:28,487 INFO L93 Difference]: Finished difference Result 1180 states and 1525 transitions. [2019-09-10 08:18:28,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:28,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:18:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:28,494 INFO L225 Difference]: With dead ends: 1180 [2019-09-10 08:18:28,494 INFO L226 Difference]: Without dead ends: 1180 [2019-09-10 08:18:28,494 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 08:18:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-09-10 08:18:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 706. [2019-09-10 08:18:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 908 transitions. [2019-09-10 08:18:28,506 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 908 transitions. Word has length 101 [2019-09-10 08:18:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:28,506 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 908 transitions. [2019-09-10 08:18:28,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 908 transitions. [2019-09-10 08:18:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:18:28,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:28,509 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:28,514 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1790777636, now seen corresponding path program 1 times [2019-09-10 08:18:28,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:28,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:28,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:28,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:28,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:28,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:28,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:28,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:28,807 INFO L87 Difference]: Start difference. First operand 706 states and 908 transitions. Second operand 9 states. [2019-09-10 08:18:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:30,861 INFO L93 Difference]: Finished difference Result 1228 states and 1605 transitions. [2019-09-10 08:18:30,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:30,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:18:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:30,867 INFO L225 Difference]: With dead ends: 1228 [2019-09-10 08:18:30,867 INFO L226 Difference]: Without dead ends: 1228 [2019-09-10 08:18:30,867 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 08:18:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-10 08:18:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-10 08:18:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 907 transitions. [2019-09-10 08:18:30,876 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 907 transitions. Word has length 101 [2019-09-10 08:18:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:30,877 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 907 transitions. [2019-09-10 08:18:30,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 907 transitions. [2019-09-10 08:18:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 08:18:30,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:30,879 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:30,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1914839865, now seen corresponding path program 1 times [2019-09-10 08:18:30,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:30,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:30,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:30,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:31,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:31,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:31,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:31,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:31,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:31,152 INFO L87 Difference]: Start difference. First operand 706 states and 907 transitions. Second operand 9 states. [2019-09-10 08:18:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:33,214 INFO L93 Difference]: Finished difference Result 1212 states and 1580 transitions. [2019-09-10 08:18:33,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:33,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-10 08:18:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:33,220 INFO L225 Difference]: With dead ends: 1212 [2019-09-10 08:18:33,220 INFO L226 Difference]: Without dead ends: 1212 [2019-09-10 08:18:33,221 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 08:18:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-10 08:18:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-10 08:18:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 906 transitions. [2019-09-10 08:18:33,230 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 906 transitions. Word has length 101 [2019-09-10 08:18:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:33,231 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 906 transitions. [2019-09-10 08:18:33,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 906 transitions. [2019-09-10 08:18:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:33,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:33,233 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 08:18:33,233 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:33,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1049586336, now seen corresponding path program 1 times [2019-09-10 08:18:33,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:33,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:33,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:33,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:33,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:33,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:33,574 INFO L87 Difference]: Start difference. First operand 706 states and 906 transitions. Second operand 9 states. [2019-09-10 08:18:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:35,647 INFO L93 Difference]: Finished difference Result 1212 states and 1579 transitions. [2019-09-10 08:18:35,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:35,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:35,653 INFO L225 Difference]: With dead ends: 1212 [2019-09-10 08:18:35,653 INFO L226 Difference]: Without dead ends: 1212 [2019-09-10 08:18:35,654 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 08:18:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-10 08:18:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-10 08:18:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 905 transitions. [2019-09-10 08:18:35,662 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 905 transitions. Word has length 102 [2019-09-10 08:18:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:35,662 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 905 transitions. [2019-09-10 08:18:35,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 905 transitions. [2019-09-10 08:18:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:35,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:35,665 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 08:18:35,665 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash -474327840, now seen corresponding path program 1 times [2019-09-10 08:18:35,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:35,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:35,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:35,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:35,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:35,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:35,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:35,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:35,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:35,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:35,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:35,901 INFO L87 Difference]: Start difference. First operand 706 states and 905 transitions. Second operand 9 states. [2019-09-10 08:18:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:37,956 INFO L93 Difference]: Finished difference Result 1212 states and 1578 transitions. [2019-09-10 08:18:37,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:37,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:37,964 INFO L225 Difference]: With dead ends: 1212 [2019-09-10 08:18:37,964 INFO L226 Difference]: Without dead ends: 1212 [2019-09-10 08:18:37,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-10 08:18:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-10 08:18:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 904 transitions. [2019-09-10 08:18:37,973 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 904 transitions. Word has length 102 [2019-09-10 08:18:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:37,973 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 904 transitions. [2019-09-10 08:18:37,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 904 transitions. [2019-09-10 08:18:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:37,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:37,976 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 08:18:37,976 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:37,976 INFO L82 PathProgramCache]: Analyzing trace with hash 540545664, now seen corresponding path program 1 times [2019-09-10 08:18:37,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:37,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:37,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:38,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:38,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:38,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:38,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:38,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:38,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:38,295 INFO L87 Difference]: Start difference. First operand 706 states and 904 transitions. Second operand 9 states. [2019-09-10 08:18:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:40,274 INFO L93 Difference]: Finished difference Result 1212 states and 1577 transitions. [2019-09-10 08:18:40,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:40,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:40,281 INFO L225 Difference]: With dead ends: 1212 [2019-09-10 08:18:40,282 INFO L226 Difference]: Without dead ends: 1212 [2019-09-10 08:18:40,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-10 08:18:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-10 08:18:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 903 transitions. [2019-09-10 08:18:40,293 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 903 transitions. Word has length 102 [2019-09-10 08:18:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:40,293 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 903 transitions. [2019-09-10 08:18:40,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 903 transitions. [2019-09-10 08:18:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:40,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:40,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:40,295 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:40,296 INFO L82 PathProgramCache]: Analyzing trace with hash -362046912, now seen corresponding path program 1 times [2019-09-10 08:18:40,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:40,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:40,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:40,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:40,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:40,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:40,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:40,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:40,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:40,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:40,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:40,529 INFO L87 Difference]: Start difference. First operand 706 states and 903 transitions. Second operand 9 states. [2019-09-10 08:18:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:42,456 INFO L93 Difference]: Finished difference Result 1180 states and 1519 transitions. [2019-09-10 08:18:42,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:42,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:42,463 INFO L225 Difference]: With dead ends: 1180 [2019-09-10 08:18:42,463 INFO L226 Difference]: Without dead ends: 1180 [2019-09-10 08:18:42,463 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 08:18:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-09-10 08:18:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 706. [2019-09-10 08:18:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 902 transitions. [2019-09-10 08:18:42,475 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 902 transitions. Word has length 102 [2019-09-10 08:18:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:42,475 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 902 transitions. [2019-09-10 08:18:42,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 902 transitions. [2019-09-10 08:18:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:42,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:42,477 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 08:18:42,478 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1954183776, now seen corresponding path program 1 times [2019-09-10 08:18:42,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:42,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:42,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:42,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:42,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:42,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:42,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:42,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:42,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:42,815 INFO L87 Difference]: Start difference. First operand 706 states and 902 transitions. Second operand 9 states. [2019-09-10 08:18:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:44,986 INFO L93 Difference]: Finished difference Result 1212 states and 1575 transitions. [2019-09-10 08:18:44,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:44,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:44,993 INFO L225 Difference]: With dead ends: 1212 [2019-09-10 08:18:44,993 INFO L226 Difference]: Without dead ends: 1212 [2019-09-10 08:18:44,993 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 08:18:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-10 08:18:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-10 08:18:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 901 transitions. [2019-09-10 08:18:45,005 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 901 transitions. Word has length 102 [2019-09-10 08:18:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:45,005 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 901 transitions. [2019-09-10 08:18:45,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 901 transitions. [2019-09-10 08:18:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:45,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:45,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:45,007 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1697282144, now seen corresponding path program 1 times [2019-09-10 08:18:45,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:45,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:45,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:45,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:45,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:45,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:45,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:45,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:45,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:45,228 INFO L87 Difference]: Start difference. First operand 706 states and 901 transitions. Second operand 9 states. [2019-09-10 08:18:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:47,370 INFO L93 Difference]: Finished difference Result 1212 states and 1573 transitions. [2019-09-10 08:18:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:47,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:47,374 INFO L225 Difference]: With dead ends: 1212 [2019-09-10 08:18:47,374 INFO L226 Difference]: Without dead ends: 1212 [2019-09-10 08:18:47,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-10 08:18:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-10 08:18:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 900 transitions. [2019-09-10 08:18:47,386 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 900 transitions. Word has length 102 [2019-09-10 08:18:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:47,386 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 900 transitions. [2019-09-10 08:18:47,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 900 transitions. [2019-09-10 08:18:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:47,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:47,388 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 08:18:47,388 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash 259593247, now seen corresponding path program 1 times [2019-09-10 08:18:47,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:47,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:47,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:47,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:47,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:47,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:47,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:47,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:47,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:47,616 INFO L87 Difference]: Start difference. First operand 706 states and 900 transitions. Second operand 9 states. [2019-09-10 08:18:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:49,882 INFO L93 Difference]: Finished difference Result 1180 states and 1516 transitions. [2019-09-10 08:18:49,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:49,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:49,884 INFO L225 Difference]: With dead ends: 1180 [2019-09-10 08:18:49,884 INFO L226 Difference]: Without dead ends: 1180 [2019-09-10 08:18:49,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-09-10 08:18:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 706. [2019-09-10 08:18:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 899 transitions. [2019-09-10 08:18:49,895 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 899 transitions. Word has length 102 [2019-09-10 08:18:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:49,895 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 899 transitions. [2019-09-10 08:18:49,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 899 transitions. [2019-09-10 08:18:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:49,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:49,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:49,897 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1176930359, now seen corresponding path program 1 times [2019-09-10 08:18:49,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:49,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:49,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:49,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:49,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:50,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:50,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:50,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:50,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:50,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:50,214 INFO L87 Difference]: Start difference. First operand 706 states and 899 transitions. Second operand 9 states. [2019-09-10 08:18:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:52,109 INFO L93 Difference]: Finished difference Result 1228 states and 1593 transitions. [2019-09-10 08:18:52,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:52,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:18:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:52,113 INFO L225 Difference]: With dead ends: 1228 [2019-09-10 08:18:52,113 INFO L226 Difference]: Without dead ends: 1228 [2019-09-10 08:18:52,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-10 08:18:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-10 08:18:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 898 transitions. [2019-09-10 08:18:52,122 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 898 transitions. Word has length 103 [2019-09-10 08:18:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:52,123 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 898 transitions. [2019-09-10 08:18:52,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 898 transitions. [2019-09-10 08:18:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:52,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:52,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:52,125 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash 870365257, now seen corresponding path program 1 times [2019-09-10 08:18:52,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:52,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:52,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:52,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:52,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:52,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:52,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:52,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:52,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:52,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:52,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:52,366 INFO L87 Difference]: Start difference. First operand 706 states and 898 transitions. Second operand 9 states. [2019-09-10 08:18:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:54,763 INFO L93 Difference]: Finished difference Result 1212 states and 1570 transitions. [2019-09-10 08:18:54,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:54,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:18:54,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:54,767 INFO L225 Difference]: With dead ends: 1212 [2019-09-10 08:18:54,767 INFO L226 Difference]: Without dead ends: 1212 [2019-09-10 08:18:54,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-10 08:18:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-10 08:18:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 897 transitions. [2019-09-10 08:18:54,776 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 897 transitions. Word has length 103 [2019-09-10 08:18:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:54,777 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 897 transitions. [2019-09-10 08:18:54,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 897 transitions. [2019-09-10 08:18:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:54,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:54,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:54,778 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash -516081623, now seen corresponding path program 1 times [2019-09-10 08:18:54,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:54,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:54,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:54,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:54,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:54,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:54,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:54,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:54,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:54,980 INFO L87 Difference]: Start difference. First operand 706 states and 897 transitions. Second operand 9 states. [2019-09-10 08:18:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:57,498 INFO L93 Difference]: Finished difference Result 1235 states and 1606 transitions. [2019-09-10 08:18:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:57,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:18:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:57,501 INFO L225 Difference]: With dead ends: 1235 [2019-09-10 08:18:57,501 INFO L226 Difference]: Without dead ends: 1235 [2019-09-10 08:18:57,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-10 08:18:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 706. [2019-09-10 08:18:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 896 transitions. [2019-09-10 08:18:57,513 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 896 transitions. Word has length 103 [2019-09-10 08:18:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:57,514 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 896 transitions. [2019-09-10 08:18:57,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 896 transitions. [2019-09-10 08:18:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:57,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:57,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:57,516 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash -673803223, now seen corresponding path program 1 times [2019-09-10 08:18:57,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:57,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:57,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:57,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:57,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:57,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:57,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:57,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:57,734 INFO L87 Difference]: Start difference. First operand 706 states and 896 transitions. Second operand 9 states. [2019-09-10 08:18:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:59,859 INFO L93 Difference]: Finished difference Result 1212 states and 1568 transitions. [2019-09-10 08:18:59,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:59,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:18:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:59,863 INFO L225 Difference]: With dead ends: 1212 [2019-09-10 08:18:59,863 INFO L226 Difference]: Without dead ends: 1212 [2019-09-10 08:18:59,864 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 08:18:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-10 08:18:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-10 08:18:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-10 08:18:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 895 transitions. [2019-09-10 08:18:59,875 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 895 transitions. Word has length 103 [2019-09-10 08:18:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:59,876 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 895 transitions. [2019-09-10 08:18:59,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 895 transitions. [2019-09-10 08:18:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:18:59,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:59,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:59,878 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:59,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1113694153, now seen corresponding path program 1 times [2019-09-10 08:18:59,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:59,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:59,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:59,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:59,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:00,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:00,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:00,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:00,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:00,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:00,100 INFO L87 Difference]: Start difference. First operand 706 states and 895 transitions. Second operand 9 states. [2019-09-10 08:19:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:02,373 INFO L93 Difference]: Finished difference Result 1179 states and 1510 transitions. [2019-09-10 08:19:02,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:02,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:19:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:02,376 INFO L225 Difference]: With dead ends: 1179 [2019-09-10 08:19:02,376 INFO L226 Difference]: Without dead ends: 1179 [2019-09-10 08:19:02,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2019-09-10 08:19:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 705. [2019-09-10 08:19:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-10 08:19:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 893 transitions. [2019-09-10 08:19:02,388 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 893 transitions. Word has length 103 [2019-09-10 08:19:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:02,389 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 893 transitions. [2019-09-10 08:19:02,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 893 transitions. [2019-09-10 08:19:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:02,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:02,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:02,391 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1754695543, now seen corresponding path program 1 times [2019-09-10 08:19:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:02,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:02,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:02,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:02,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:02,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:02,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:02,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:02,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:02,619 INFO L87 Difference]: Start difference. First operand 705 states and 893 transitions. Second operand 9 states. [2019-09-10 08:19:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:05,180 INFO L93 Difference]: Finished difference Result 1211 states and 1564 transitions. [2019-09-10 08:19:05,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:05,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:19:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:05,183 INFO L225 Difference]: With dead ends: 1211 [2019-09-10 08:19:05,184 INFO L226 Difference]: Without dead ends: 1211 [2019-09-10 08:19:05,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-10 08:19:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 705. [2019-09-10 08:19:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-10 08:19:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 892 transitions. [2019-09-10 08:19:05,197 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 892 transitions. Word has length 103 [2019-09-10 08:19:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:05,197 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 892 transitions. [2019-09-10 08:19:05,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 892 transitions. [2019-09-10 08:19:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:05,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:05,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:05,199 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:05,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:05,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1081765687, now seen corresponding path program 1 times [2019-09-10 08:19:05,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:05,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:05,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:05,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:05,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:05,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:05,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:05,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:05,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:05,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:05,449 INFO L87 Difference]: Start difference. First operand 705 states and 892 transitions. Second operand 9 states. [2019-09-10 08:19:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:08,070 INFO L93 Difference]: Finished difference Result 1211 states and 1562 transitions. [2019-09-10 08:19:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:08,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:19:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:08,073 INFO L225 Difference]: With dead ends: 1211 [2019-09-10 08:19:08,073 INFO L226 Difference]: Without dead ends: 1211 [2019-09-10 08:19:08,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-10 08:19:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 705. [2019-09-10 08:19:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-10 08:19:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 891 transitions. [2019-09-10 08:19:08,085 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 891 transitions. Word has length 103 [2019-09-10 08:19:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:08,085 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 891 transitions. [2019-09-10 08:19:08,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 891 transitions. [2019-09-10 08:19:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:08,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:08,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:08,088 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:08,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1234979639, now seen corresponding path program 1 times [2019-09-10 08:19:08,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:08,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:08,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:08,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:08,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:08,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:08,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:08,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:08,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:08,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:08,324 INFO L87 Difference]: Start difference. First operand 705 states and 891 transitions. Second operand 9 states. [2019-09-10 08:19:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:10,833 INFO L93 Difference]: Finished difference Result 1234 states and 1598 transitions. [2019-09-10 08:19:10,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:10,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:19:10,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:10,836 INFO L225 Difference]: With dead ends: 1234 [2019-09-10 08:19:10,837 INFO L226 Difference]: Without dead ends: 1234 [2019-09-10 08:19:10,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-09-10 08:19:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 705. [2019-09-10 08:19:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-10 08:19:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 890 transitions. [2019-09-10 08:19:10,848 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 890 transitions. Word has length 103 [2019-09-10 08:19:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:10,848 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 890 transitions. [2019-09-10 08:19:10,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 890 transitions. [2019-09-10 08:19:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:10,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:10,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:10,850 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash 429596489, now seen corresponding path program 1 times [2019-09-10 08:19:10,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:10,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:10,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:11,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:11,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:11,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:11,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:11,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:11,063 INFO L87 Difference]: Start difference. First operand 705 states and 890 transitions. Second operand 9 states. [2019-09-10 08:19:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:13,720 INFO L93 Difference]: Finished difference Result 1211 states and 1559 transitions. [2019-09-10 08:19:13,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:13,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:19:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:13,723 INFO L225 Difference]: With dead ends: 1211 [2019-09-10 08:19:13,723 INFO L226 Difference]: Without dead ends: 1211 [2019-09-10 08:19:13,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-10 08:19:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 705. [2019-09-10 08:19:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-10 08:19:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 889 transitions. [2019-09-10 08:19:13,731 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 889 transitions. Word has length 103 [2019-09-10 08:19:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:13,731 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 889 transitions. [2019-09-10 08:19:13,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 889 transitions. [2019-09-10 08:19:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:13,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:13,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:13,733 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1112545982, now seen corresponding path program 1 times [2019-09-10 08:19:13,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:13,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:13,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:13,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:13,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:13,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 08:19:13,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:13,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:13,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:13,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:13,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:13,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:13,940 INFO L87 Difference]: Start difference. First operand 705 states and 889 transitions. Second operand 9 states. [2019-09-10 08:19:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:16,408 INFO L93 Difference]: Finished difference Result 1178 states and 1504 transitions. [2019-09-10 08:19:16,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:16,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:19:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:16,411 INFO L225 Difference]: With dead ends: 1178 [2019-09-10 08:19:16,411 INFO L226 Difference]: Without dead ends: 1178 [2019-09-10 08:19:16,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-09-10 08:19:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 704. [2019-09-10 08:19:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-10 08:19:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 887 transitions. [2019-09-10 08:19:16,421 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 887 transitions. Word has length 103 [2019-09-10 08:19:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:16,421 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 887 transitions. [2019-09-10 08:19:16,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 887 transitions. [2019-09-10 08:19:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:16,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:16,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:16,423 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash -462834018, now seen corresponding path program 1 times [2019-09-10 08:19:16,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:16,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:16,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:16,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:16,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:16,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:16,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:16,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:16,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:16,651 INFO L87 Difference]: Start difference. First operand 704 states and 887 transitions. Second operand 9 states. [2019-09-10 08:19:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:19,095 INFO L93 Difference]: Finished difference Result 1177 states and 1502 transitions. [2019-09-10 08:19:19,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:19,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:19:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:19,098 INFO L225 Difference]: With dead ends: 1177 [2019-09-10 08:19:19,098 INFO L226 Difference]: Without dead ends: 1177 [2019-09-10 08:19:19,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-09-10 08:19:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 703. [2019-09-10 08:19:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-10 08:19:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 885 transitions. [2019-09-10 08:19:19,108 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 885 transitions. Word has length 103 [2019-09-10 08:19:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:19,108 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 885 transitions. [2019-09-10 08:19:19,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 885 transitions. [2019-09-10 08:19:19,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:19,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:19,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:19,110 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:19,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash 368358430, now seen corresponding path program 1 times [2019-09-10 08:19:19,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:19,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:19,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:20,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:20,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:19:20,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:20,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:19:20,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:19:20,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:19:20,225 INFO L87 Difference]: Start difference. First operand 703 states and 885 transitions. Second operand 17 states. [2019-09-10 08:19:20,950 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 08:19:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:25,359 INFO L93 Difference]: Finished difference Result 1312 states and 1676 transitions. [2019-09-10 08:19:25,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:19:25,359 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 08:19:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:25,361 INFO L225 Difference]: With dead ends: 1312 [2019-09-10 08:19:25,362 INFO L226 Difference]: Without dead ends: 1312 [2019-09-10 08:19:25,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:19:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-09-10 08:19:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 703. [2019-09-10 08:19:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-10 08:19:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 883 transitions. [2019-09-10 08:19:25,370 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 883 transitions. Word has length 103 [2019-09-10 08:19:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:25,371 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 883 transitions. [2019-09-10 08:19:25,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:19:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 883 transitions. [2019-09-10 08:19:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:25,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:25,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:25,372 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash -440894658, now seen corresponding path program 1 times [2019-09-10 08:19:25,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:25,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:25,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:25,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:25,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:25,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:25,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:25,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:25,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:25,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:25,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:25,605 INFO L87 Difference]: Start difference. First operand 703 states and 883 transitions. Second operand 9 states. [2019-09-10 08:19:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:28,170 INFO L93 Difference]: Finished difference Result 1175 states and 1496 transitions. [2019-09-10 08:19:28,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:28,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:19:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:28,173 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:28,173 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:28,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 881 transitions. [2019-09-10 08:19:28,184 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 881 transitions. Word has length 103 [2019-09-10 08:19:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:28,184 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 881 transitions. [2019-09-10 08:19:28,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 881 transitions. [2019-09-10 08:19:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:28,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:28,188 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:28,188 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:28,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1453139291, now seen corresponding path program 1 times [2019-09-10 08:19:28,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:28,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:28,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:28,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:28,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:28,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:28,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:28,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:28,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:28,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:28,434 INFO L87 Difference]: Start difference. First operand 702 states and 881 transitions. Second operand 9 states. [2019-09-10 08:19:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:30,887 INFO L93 Difference]: Finished difference Result 1175 states and 1495 transitions. [2019-09-10 08:19:30,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:30,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:30,890 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:30,890 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:30,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 880 transitions. [2019-09-10 08:19:30,899 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 880 transitions. Word has length 104 [2019-09-10 08:19:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:30,899 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 880 transitions. [2019-09-10 08:19:30,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 880 transitions. [2019-09-10 08:19:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:30,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:30,901 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:30,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash -872187749, now seen corresponding path program 1 times [2019-09-10 08:19:30,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:30,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:30,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:30,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:30,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:31,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:31,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:31,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:31,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:31,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:31,138 INFO L87 Difference]: Start difference. First operand 702 states and 880 transitions. Second operand 9 states. [2019-09-10 08:19:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:33,660 INFO L93 Difference]: Finished difference Result 1175 states and 1494 transitions. [2019-09-10 08:19:33,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:33,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:33,662 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:33,662 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:33,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 879 transitions. [2019-09-10 08:19:33,672 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 879 transitions. Word has length 104 [2019-09-10 08:19:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:33,672 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 879 transitions. [2019-09-10 08:19:33,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 879 transitions. [2019-09-10 08:19:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:33,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:33,674 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1637494085, now seen corresponding path program 1 times [2019-09-10 08:19:33,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:33,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:33,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:33,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:33,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:33,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:33,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:33,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:33,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:33,871 INFO L87 Difference]: Start difference. First operand 702 states and 879 transitions. Second operand 9 states. [2019-09-10 08:19:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:36,365 INFO L93 Difference]: Finished difference Result 1175 states and 1492 transitions. [2019-09-10 08:19:36,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:36,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:36,367 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:36,368 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:36,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 878 transitions. [2019-09-10 08:19:36,379 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 878 transitions. Word has length 104 [2019-09-10 08:19:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:36,379 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 878 transitions. [2019-09-10 08:19:36,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 878 transitions. [2019-09-10 08:19:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:36,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:36,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:36,381 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:36,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:36,381 INFO L82 PathProgramCache]: Analyzing trace with hash -18959589, now seen corresponding path program 1 times [2019-09-10 08:19:36,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:36,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:36,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:36,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:36,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:36,609 INFO L87 Difference]: Start difference. First operand 702 states and 878 transitions. Second operand 9 states. [2019-09-10 08:19:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:39,008 INFO L93 Difference]: Finished difference Result 1175 states and 1491 transitions. [2019-09-10 08:19:39,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:39,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:39,010 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:39,010 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:39,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 877 transitions. [2019-09-10 08:19:39,020 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 877 transitions. Word has length 104 [2019-09-10 08:19:39,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:39,020 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 877 transitions. [2019-09-10 08:19:39,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 877 transitions. [2019-09-10 08:19:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:39,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:39,021 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:39,021 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:39,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash -803008197, now seen corresponding path program 1 times [2019-09-10 08:19:39,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:39,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:39,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:39,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:39,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:39,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:39,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:39,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:39,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:39,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:39,241 INFO L87 Difference]: Start difference. First operand 702 states and 877 transitions. Second operand 9 states. [2019-09-10 08:19:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:42,081 INFO L93 Difference]: Finished difference Result 1175 states and 1490 transitions. [2019-09-10 08:19:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:42,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:42,084 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:42,084 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:42,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 876 transitions. [2019-09-10 08:19:42,092 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 876 transitions. Word has length 104 [2019-09-10 08:19:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:42,093 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 876 transitions. [2019-09-10 08:19:42,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 876 transitions. [2019-09-10 08:19:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:42,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:42,094 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:42,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:42,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1301956699, now seen corresponding path program 1 times [2019-09-10 08:19:42,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:42,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:42,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:42,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:42,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:42,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:42,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:42,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:42,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:42,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:42,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:42,306 INFO L87 Difference]: Start difference. First operand 702 states and 876 transitions. Second operand 9 states. [2019-09-10 08:19:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:44,795 INFO L93 Difference]: Finished difference Result 1175 states and 1488 transitions. [2019-09-10 08:19:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:44,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:44,798 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:44,798 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:44,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 875 transitions. [2019-09-10 08:19:44,806 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 875 transitions. Word has length 104 [2019-09-10 08:19:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:44,806 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 875 transitions. [2019-09-10 08:19:44,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 875 transitions. [2019-09-10 08:19:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:44,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:44,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:44,808 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:44,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash -369299811, now seen corresponding path program 1 times [2019-09-10 08:19:44,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:44,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:44,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:45,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:45,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:45,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:45,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:45,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:45,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:45,090 INFO L87 Difference]: Start difference. First operand 702 states and 875 transitions. Second operand 9 states. [2019-09-10 08:19:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:47,480 INFO L93 Difference]: Finished difference Result 1175 states and 1487 transitions. [2019-09-10 08:19:47,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:47,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:47,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:47,483 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:47,483 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:47,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 874 transitions. [2019-09-10 08:19:47,491 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 874 transitions. Word has length 104 [2019-09-10 08:19:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:47,491 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 874 transitions. [2019-09-10 08:19:47,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 874 transitions. [2019-09-10 08:19:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:47,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:47,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:47,492 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:47,493 INFO L82 PathProgramCache]: Analyzing trace with hash -339789701, now seen corresponding path program 1 times [2019-09-10 08:19:47,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:47,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:47,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:47,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:47,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:47,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:47,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:47,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:47,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:47,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:47,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:47,723 INFO L87 Difference]: Start difference. First operand 702 states and 874 transitions. Second operand 9 states. [2019-09-10 08:19:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:50,042 INFO L93 Difference]: Finished difference Result 1175 states and 1486 transitions. [2019-09-10 08:19:50,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:50,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:50,045 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:50,045 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:50,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 873 transitions. [2019-09-10 08:19:50,055 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 873 transitions. Word has length 104 [2019-09-10 08:19:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:50,055 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 873 transitions. [2019-09-10 08:19:50,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 873 transitions. [2019-09-10 08:19:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:50,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:50,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:50,057 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash 480435067, now seen corresponding path program 1 times [2019-09-10 08:19:50,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:50,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:50,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:50,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:50,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:50,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:50,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:50,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:50,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:50,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:50,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:50,324 INFO L87 Difference]: Start difference. First operand 702 states and 873 transitions. Second operand 9 states. [2019-09-10 08:19:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:52,879 INFO L93 Difference]: Finished difference Result 1175 states and 1484 transitions. [2019-09-10 08:19:52,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:52,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:52,882 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:52,882 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:52,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 872 transitions. [2019-09-10 08:19:52,893 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 872 transitions. Word has length 104 [2019-09-10 08:19:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:52,893 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 872 transitions. [2019-09-10 08:19:52,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 872 transitions. [2019-09-10 08:19:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:52,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:52,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:52,895 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash -696828453, now seen corresponding path program 1 times [2019-09-10 08:19:52,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:52,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:52,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:52,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:52,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:53,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:53,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:53,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:53,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:53,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:53,072 INFO L87 Difference]: Start difference. First operand 702 states and 872 transitions. Second operand 9 states. [2019-09-10 08:19:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:55,522 INFO L93 Difference]: Finished difference Result 1175 states and 1482 transitions. [2019-09-10 08:19:55,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:55,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-10 08:19:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:55,524 INFO L225 Difference]: With dead ends: 1175 [2019-09-10 08:19:55,524 INFO L226 Difference]: Without dead ends: 1175 [2019-09-10 08:19:55,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:19:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-10 08:19:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-10 08:19:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-10 08:19:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 871 transitions. [2019-09-10 08:19:55,533 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 871 transitions. Word has length 104 [2019-09-10 08:19:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:55,533 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 871 transitions. [2019-09-10 08:19:55,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 871 transitions. [2019-09-10 08:19:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:55,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:55,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:55,535 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:55,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1221610680, now seen corresponding path program 1 times [2019-09-10 08:19:55,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:55,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:55,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:55,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:55,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:56,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 08:19:56,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:56,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:19:56,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:56,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:19:56,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:19:56,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:19:56,941 INFO L87 Difference]: Start difference. First operand 702 states and 871 transitions. Second operand 20 states. [2019-09-10 08:19:57,222 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 08:19:57,691 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-10 08:19:57,909 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 08:19:58,150 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 08:19:58,434 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 08:19:58,897 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:19:59,282 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2019-09-10 08:19:59,623 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-10 08:19:59,947 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-10 08:20:00,406 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 08:20:00,810 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-09-10 08:20:01,098 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:20:01,402 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:20:01,664 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 08:20:02,205 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 08:20:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:08,310 INFO L93 Difference]: Finished difference Result 1543 states and 1896 transitions. [2019-09-10 08:20:08,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:20:08,311 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-10 08:20:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:08,314 INFO L225 Difference]: With dead ends: 1543 [2019-09-10 08:20:08,314 INFO L226 Difference]: Without dead ends: 1540 [2019-09-10 08:20:08,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:20:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-09-10 08:20:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 697. [2019-09-10 08:20:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 865 transitions. [2019-09-10 08:20:08,326 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 865 transitions. Word has length 104 [2019-09-10 08:20:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:08,326 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 865 transitions. [2019-09-10 08:20:08,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:20:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 865 transitions. [2019-09-10 08:20:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:08,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:08,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:08,328 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1629361838, now seen corresponding path program 1 times [2019-09-10 08:20:08,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:08,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:08,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:08,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:08,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:08,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:08,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:08,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:08,578 INFO L87 Difference]: Start difference. First operand 697 states and 865 transitions. Second operand 9 states. [2019-09-10 08:20:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:10,872 INFO L93 Difference]: Finished difference Result 1202 states and 1528 transitions. [2019-09-10 08:20:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:10,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:10,876 INFO L225 Difference]: With dead ends: 1202 [2019-09-10 08:20:10,876 INFO L226 Difference]: Without dead ends: 1202 [2019-09-10 08:20:10,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-10 08:20:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 697. [2019-09-10 08:20:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 864 transitions. [2019-09-10 08:20:10,886 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 864 transitions. Word has length 105 [2019-09-10 08:20:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:10,886 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 864 transitions. [2019-09-10 08:20:10,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 864 transitions. [2019-09-10 08:20:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:10,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:10,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:10,888 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash 796878734, now seen corresponding path program 1 times [2019-09-10 08:20:10,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:10,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:10,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:11,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:11,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:11,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:11,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:11,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:11,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:11,129 INFO L87 Difference]: Start difference. First operand 697 states and 864 transitions. Second operand 9 states. [2019-09-10 08:20:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:13,422 INFO L93 Difference]: Finished difference Result 1170 states and 1474 transitions. [2019-09-10 08:20:13,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:13,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:13,425 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:20:13,425 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:20:13,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:20:13,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-10 08:20:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 863 transitions. [2019-09-10 08:20:13,433 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 863 transitions. Word has length 105 [2019-09-10 08:20:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:13,433 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 863 transitions. [2019-09-10 08:20:13,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 863 transitions. [2019-09-10 08:20:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:13,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:13,435 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:13,435 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:13,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:13,435 INFO L82 PathProgramCache]: Analyzing trace with hash 585181006, now seen corresponding path program 1 times [2019-09-10 08:20:13,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:13,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:13,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:13,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:13,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:13,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 08:20:13,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:13,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:13,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:13,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:13,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:13,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:13,642 INFO L87 Difference]: Start difference. First operand 697 states and 863 transitions. Second operand 9 states. [2019-09-10 08:20:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:15,670 INFO L93 Difference]: Finished difference Result 1218 states and 1547 transitions. [2019-09-10 08:20:15,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:15,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:15,672 INFO L225 Difference]: With dead ends: 1218 [2019-09-10 08:20:15,672 INFO L226 Difference]: Without dead ends: 1218 [2019-09-10 08:20:15,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:15,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-09-10 08:20:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 697. [2019-09-10 08:20:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 862 transitions. [2019-09-10 08:20:15,682 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 862 transitions. Word has length 105 [2019-09-10 08:20:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:15,682 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 862 transitions. [2019-09-10 08:20:15,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 862 transitions. [2019-09-10 08:20:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:15,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:15,684 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:15,684 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:15,684 INFO L82 PathProgramCache]: Analyzing trace with hash 126959758, now seen corresponding path program 1 times [2019-09-10 08:20:15,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:15,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:15,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:15,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:15,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:16,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:16,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:16,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:16,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:16,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:16,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:16,003 INFO L87 Difference]: Start difference. First operand 697 states and 862 transitions. Second operand 9 states. [2019-09-10 08:20:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:18,015 INFO L93 Difference]: Finished difference Result 1202 states and 1524 transitions. [2019-09-10 08:20:18,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:18,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:18,018 INFO L225 Difference]: With dead ends: 1202 [2019-09-10 08:20:18,018 INFO L226 Difference]: Without dead ends: 1202 [2019-09-10 08:20:18,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-10 08:20:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 697. [2019-09-10 08:20:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 861 transitions. [2019-09-10 08:20:18,025 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 861 transitions. Word has length 105 [2019-09-10 08:20:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:18,026 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 861 transitions. [2019-09-10 08:20:18,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 861 transitions. [2019-09-10 08:20:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:18,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:18,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:18,028 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash -705523346, now seen corresponding path program 1 times [2019-09-10 08:20:18,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:18,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:18,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:18,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:18,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:18,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:18,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:18,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:18,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:18,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:18,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:18,226 INFO L87 Difference]: Start difference. First operand 697 states and 861 transitions. Second operand 9 states. [2019-09-10 08:20:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:20,546 INFO L93 Difference]: Finished difference Result 1170 states and 1471 transitions. [2019-09-10 08:20:20,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:20,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:20,549 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:20:20,549 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:20:20,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:20:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-10 08:20:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 860 transitions. [2019-09-10 08:20:20,557 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 860 transitions. Word has length 105 [2019-09-10 08:20:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:20,557 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 860 transitions. [2019-09-10 08:20:20,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 860 transitions. [2019-09-10 08:20:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:20,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:20,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:20,559 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1644071758, now seen corresponding path program 1 times [2019-09-10 08:20:20,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:20,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:20,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:20,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:20,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:20,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:20,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:20,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:20,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:20,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:20,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:20,730 INFO L87 Difference]: Start difference. First operand 697 states and 860 transitions. Second operand 9 states. [2019-09-10 08:20:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:22,868 INFO L93 Difference]: Finished difference Result 1170 states and 1469 transitions. [2019-09-10 08:20:22,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:22,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:22,871 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:20:22,871 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:20:22,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:22,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:20:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-10 08:20:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 859 transitions. [2019-09-10 08:20:22,878 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 859 transitions. Word has length 105 [2019-09-10 08:20:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:22,878 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 859 transitions. [2019-09-10 08:20:22,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 859 transitions. [2019-09-10 08:20:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:22,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:22,879 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:22,880 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:22,880 INFO L82 PathProgramCache]: Analyzing trace with hash -916618386, now seen corresponding path program 1 times [2019-09-10 08:20:22,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:22,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:22,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:22,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:22,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:23,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:23,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:23,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:23,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:23,073 INFO L87 Difference]: Start difference. First operand 697 states and 859 transitions. Second operand 9 states. [2019-09-10 08:20:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:25,399 INFO L93 Difference]: Finished difference Result 1170 states and 1468 transitions. [2019-09-10 08:20:25,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:25,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:25,403 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:20:25,403 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:20:25,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:20:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-10 08:20:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 858 transitions. [2019-09-10 08:20:25,413 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 858 transitions. Word has length 105 [2019-09-10 08:20:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:25,413 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 858 transitions. [2019-09-10 08:20:25,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 858 transitions. [2019-09-10 08:20:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:25,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:25,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:25,415 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:25,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1550934542, now seen corresponding path program 1 times [2019-09-10 08:20:25,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:25,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:25,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:25,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:25,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:25,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:25,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:25,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:25,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:25,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:25,587 INFO L87 Difference]: Start difference. First operand 697 states and 858 transitions. Second operand 9 states. [2019-09-10 08:20:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:27,874 INFO L93 Difference]: Finished difference Result 1202 states and 1517 transitions. [2019-09-10 08:20:27,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:27,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:27,877 INFO L225 Difference]: With dead ends: 1202 [2019-09-10 08:20:27,877 INFO L226 Difference]: Without dead ends: 1202 [2019-09-10 08:20:27,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-10 08:20:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 697. [2019-09-10 08:20:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 857 transitions. [2019-09-10 08:20:27,884 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 857 transitions. Word has length 105 [2019-09-10 08:20:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:27,884 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 857 transitions. [2019-09-10 08:20:27,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 857 transitions. [2019-09-10 08:20:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:27,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:27,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:27,886 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:27,886 INFO L82 PathProgramCache]: Analyzing trace with hash -825223794, now seen corresponding path program 1 times [2019-09-10 08:20:27,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:27,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:27,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:27,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:27,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:28,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:28,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:28,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:28,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:28,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:28,092 INFO L87 Difference]: Start difference. First operand 697 states and 857 transitions. Second operand 9 states. [2019-09-10 08:20:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:30,533 INFO L93 Difference]: Finished difference Result 1170 states and 1465 transitions. [2019-09-10 08:20:30,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:30,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:30,537 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:20:30,537 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:20:30,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:20:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-10 08:20:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 856 transitions. [2019-09-10 08:20:30,546 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 856 transitions. Word has length 105 [2019-09-10 08:20:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:30,546 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 856 transitions. [2019-09-10 08:20:30,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 856 transitions. [2019-09-10 08:20:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:30,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:30,548 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:30,548 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash -180694834, now seen corresponding path program 1 times [2019-09-10 08:20:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:30,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:30,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:30,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:30,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:30,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:30,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:30,750 INFO L87 Difference]: Start difference. First operand 697 states and 856 transitions. Second operand 9 states. [2019-09-10 08:20:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:32,853 INFO L93 Difference]: Finished difference Result 1170 states and 1463 transitions. [2019-09-10 08:20:32,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:32,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:32,856 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:20:32,856 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:20:32,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:20:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-10 08:20:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 855 transitions. [2019-09-10 08:20:32,866 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 855 transitions. Word has length 105 [2019-09-10 08:20:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:32,866 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 855 transitions. [2019-09-10 08:20:32,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 855 transitions. [2019-09-10 08:20:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:32,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:32,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:32,868 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:32,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:32,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1974492206, now seen corresponding path program 1 times [2019-09-10 08:20:32,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:32,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:32,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:32,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:32,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:33,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:33,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:33,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:33,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:33,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:33,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:33,028 INFO L87 Difference]: Start difference. First operand 697 states and 855 transitions. Second operand 9 states. [2019-09-10 08:20:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:35,332 INFO L93 Difference]: Finished difference Result 1170 states and 1462 transitions. [2019-09-10 08:20:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:35,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:35,335 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:20:35,335 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:20:35,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:20:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-10 08:20:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 854 transitions. [2019-09-10 08:20:35,343 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 854 transitions. Word has length 105 [2019-09-10 08:20:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:35,343 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 854 transitions. [2019-09-10 08:20:35,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 854 transitions. [2019-09-10 08:20:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:35,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:35,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:35,345 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:35,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1864649998, now seen corresponding path program 1 times [2019-09-10 08:20:35,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:35,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:35,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:35,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:35,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:35,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:35,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:35,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:35,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:35,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:35,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:35,496 INFO L87 Difference]: Start difference. First operand 697 states and 854 transitions. Second operand 9 states. [2019-09-10 08:20:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:38,066 INFO L93 Difference]: Finished difference Result 1202 states and 1510 transitions. [2019-09-10 08:20:38,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:38,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:38,068 INFO L225 Difference]: With dead ends: 1202 [2019-09-10 08:20:38,069 INFO L226 Difference]: Without dead ends: 1202 [2019-09-10 08:20:38,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-10 08:20:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 697. [2019-09-10 08:20:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 853 transitions. [2019-09-10 08:20:38,079 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 853 transitions. Word has length 105 [2019-09-10 08:20:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:38,079 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 853 transitions. [2019-09-10 08:20:38,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 853 transitions. [2019-09-10 08:20:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:38,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:38,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:38,081 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash -387747698, now seen corresponding path program 1 times [2019-09-10 08:20:38,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:38,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:38,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:38,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:38,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:38,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:38,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:38,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:38,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:38,285 INFO L87 Difference]: Start difference. First operand 697 states and 853 transitions. Second operand 9 states. [2019-09-10 08:20:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:40,715 INFO L93 Difference]: Finished difference Result 1170 states and 1459 transitions. [2019-09-10 08:20:40,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:40,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:40,717 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:20:40,717 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:20:40,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:20:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-10 08:20:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 852 transitions. [2019-09-10 08:20:40,724 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 852 transitions. Word has length 105 [2019-09-10 08:20:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:40,725 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 852 transitions. [2019-09-10 08:20:40,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 852 transitions. [2019-09-10 08:20:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:20:40,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:40,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:40,726 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:40,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1642130034, now seen corresponding path program 1 times [2019-09-10 08:20:40,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:40,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:40,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:40,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:40,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:40,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:40,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:20:40,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:40,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:20:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:20:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:20:40,904 INFO L87 Difference]: Start difference. First operand 697 states and 852 transitions. Second operand 9 states. [2019-09-10 08:20:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:43,328 INFO L93 Difference]: Finished difference Result 1170 states and 1457 transitions. [2019-09-10 08:20:43,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:20:43,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:20:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:43,330 INFO L225 Difference]: With dead ends: 1170 [2019-09-10 08:20:43,331 INFO L226 Difference]: Without dead ends: 1170 [2019-09-10 08:20:43,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-10 08:20:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-10 08:20:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:20:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 851 transitions. [2019-09-10 08:20:43,339 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 851 transitions. Word has length 105 [2019-09-10 08:20:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:43,339 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 851 transitions. [2019-09-10 08:20:43,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:20:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 851 transitions. [2019-09-10 08:20:43,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:20:43,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:43,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:43,341 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:43,342 INFO L82 PathProgramCache]: Analyzing trace with hash -543142122, now seen corresponding path program 1 times [2019-09-10 08:20:43,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:43,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:43,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:43,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:43,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:44,339 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:20:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:45,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:45,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:20:45,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:45,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:20:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:20:45,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:20:45,242 INFO L87 Difference]: Start difference. First operand 697 states and 851 transitions. Second operand 26 states. [2019-09-10 08:20:45,416 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:20:46,658 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:20:46,919 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 08:20:47,248 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 08:20:47,648 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-10 08:20:47,894 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:20:48,124 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:20:48,378 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:20:55,966 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:20:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:59,331 INFO L93 Difference]: Finished difference Result 1592 states and 2005 transitions. [2019-09-10 08:20:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:20:59,331 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2019-09-10 08:20:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:59,333 INFO L225 Difference]: With dead ends: 1592 [2019-09-10 08:20:59,333 INFO L226 Difference]: Without dead ends: 1592 [2019-09-10 08:20:59,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=373, Invalid=1433, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:20:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-10 08:20:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 724. [2019-09-10 08:20:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-09-10 08:20:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 885 transitions. [2019-09-10 08:20:59,344 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 885 transitions. Word has length 106 [2019-09-10 08:20:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:59,344 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 885 transitions. [2019-09-10 08:20:59,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:20:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 885 transitions. [2019-09-10 08:20:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:20:59,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:59,346 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:59,346 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash 128153622, now seen corresponding path program 1 times [2019-09-10 08:20:59,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:59,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:59,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:00,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:00,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:21:00,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:00,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:21:00,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:21:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:21:00,127 INFO L87 Difference]: Start difference. First operand 724 states and 885 transitions. Second operand 17 states. [2019-09-10 08:21:00,809 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:21:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:03,316 INFO L93 Difference]: Finished difference Result 1330 states and 1665 transitions. [2019-09-10 08:21:03,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:21:03,316 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-09-10 08:21:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:03,318 INFO L225 Difference]: With dead ends: 1330 [2019-09-10 08:21:03,318 INFO L226 Difference]: Without dead ends: 1330 [2019-09-10 08:21:03,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:21:03,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-09-10 08:21:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 697. [2019-09-10 08:21:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-10 08:21:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 850 transitions. [2019-09-10 08:21:03,329 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 850 transitions. Word has length 106 [2019-09-10 08:21:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:03,332 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 850 transitions. [2019-09-10 08:21:03,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:21:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 850 transitions. [2019-09-10 08:21:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:21:03,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:03,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:03,334 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:03,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2118591338, now seen corresponding path program 1 times [2019-09-10 08:21:03,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:03,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:03,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:04,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:04,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:21:04,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:04,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:21:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:21:04,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:21:04,102 INFO L87 Difference]: Start difference. First operand 697 states and 850 transitions. Second operand 16 states. [2019-09-10 08:21:04,843 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:21:04,979 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:21:05,112 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:21:05,237 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 08:21:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:08,925 INFO L93 Difference]: Finished difference Result 1213 states and 1451 transitions. [2019-09-10 08:21:08,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:21:08,926 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-10 08:21:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:08,928 INFO L225 Difference]: With dead ends: 1213 [2019-09-10 08:21:08,928 INFO L226 Difference]: Without dead ends: 1213 [2019-09-10 08:21:08,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:21:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-09-10 08:21:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 720. [2019-09-10 08:21:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-09-10 08:21:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 881 transitions. [2019-09-10 08:21:08,936 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 881 transitions. Word has length 106 [2019-09-10 08:21:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:08,936 INFO L475 AbstractCegarLoop]: Abstraction has 720 states and 881 transitions. [2019-09-10 08:21:08,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:21:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 881 transitions. [2019-09-10 08:21:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:21:08,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:08,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:08,937 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash 715197526, now seen corresponding path program 1 times [2019-09-10 08:21:08,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:08,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:08,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:09,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:09,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:21:09,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:09,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:21:09,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:21:09,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:21:09,824 INFO L87 Difference]: Start difference. First operand 720 states and 881 transitions. Second operand 17 states. [2019-09-10 08:21:10,497 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:21:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:12,637 INFO L93 Difference]: Finished difference Result 1221 states and 1528 transitions. [2019-09-10 08:21:12,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:21:12,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-09-10 08:21:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:12,643 INFO L225 Difference]: With dead ends: 1221 [2019-09-10 08:21:12,644 INFO L226 Difference]: Without dead ends: 1221 [2019-09-10 08:21:12,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:21:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-09-10 08:21:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 665. [2019-09-10 08:21:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-09-10 08:21:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 809 transitions. [2019-09-10 08:21:12,655 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 809 transitions. Word has length 106 [2019-09-10 08:21:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:12,655 INFO L475 AbstractCegarLoop]: Abstraction has 665 states and 809 transitions. [2019-09-10 08:21:12,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:21:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 809 transitions. [2019-09-10 08:21:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:21:12,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:12,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:12,657 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1432850954, now seen corresponding path program 1 times [2019-09-10 08:21:12,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:12,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:12,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:14,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:14,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:21:14,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:14,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:21:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:21:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:21:14,246 INFO L87 Difference]: Start difference. First operand 665 states and 809 transitions. Second operand 25 states. [2019-09-10 08:21:14,411 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:21:15,333 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:21:15,684 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 08:21:15,951 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 08:21:16,270 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 08:21:16,507 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:21:16,738 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:21:16,951 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:21:17,132 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:21:17,342 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:21:17,593 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:21:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:24,297 INFO L93 Difference]: Finished difference Result 1470 states and 1788 transitions. [2019-09-10 08:21:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:21:24,298 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2019-09-10 08:21:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:24,300 INFO L225 Difference]: With dead ends: 1470 [2019-09-10 08:21:24,300 INFO L226 Difference]: Without dead ends: 1470 [2019-09-10 08:21:24,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:21:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-09-10 08:21:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 678. [2019-09-10 08:21:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-09-10 08:21:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 823 transitions. [2019-09-10 08:21:24,310 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 823 transitions. Word has length 106 [2019-09-10 08:21:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:24,310 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 823 transitions. [2019-09-10 08:21:24,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:21:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 823 transitions. [2019-09-10 08:21:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:21:24,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:24,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:24,311 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:24,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:24,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1395534550, now seen corresponding path program 1 times [2019-09-10 08:21:24,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:24,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:24,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:24,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:24,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:21:24,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:24,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:21:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:21:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:21:24,983 INFO L87 Difference]: Start difference. First operand 678 states and 823 transitions. Second operand 15 states. [2019-09-10 08:21:25,584 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:21:25,711 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:21:25,837 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:21:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:27,686 INFO L93 Difference]: Finished difference Result 1249 states and 1561 transitions. [2019-09-10 08:21:27,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:21:27,686 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2019-09-10 08:21:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:27,688 INFO L225 Difference]: With dead ends: 1249 [2019-09-10 08:21:27,688 INFO L226 Difference]: Without dead ends: 1249 [2019-09-10 08:21:27,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:21:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-09-10 08:21:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 562. [2019-09-10 08:21:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 08:21:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 678 transitions. [2019-09-10 08:21:27,697 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 678 transitions. Word has length 106 [2019-09-10 08:21:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:27,697 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 678 transitions. [2019-09-10 08:21:27,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:21:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 678 transitions. [2019-09-10 08:21:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:21:27,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:27,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:27,699 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:27,700 INFO L82 PathProgramCache]: Analyzing trace with hash -219637197, now seen corresponding path program 1 times [2019-09-10 08:21:27,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:27,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:27,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:27,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:27,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:28,670 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 08:21:28,818 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:21:28,973 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:21:29,127 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:21:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:30,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:30,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:21:30,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:30,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:21:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:21:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:21:30,356 INFO L87 Difference]: Start difference. First operand 562 states and 678 transitions. Second operand 31 states. [2019-09-10 08:21:30,574 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:21:31,718 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:21:31,887 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:21:32,354 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:21:32,653 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 08:21:33,001 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-10 08:21:33,410 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-09-10 08:21:33,928 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 104 [2019-09-10 08:21:34,230 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:21:34,522 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:21:34,832 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 08:21:41,488 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:21:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:43,320 INFO L93 Difference]: Finished difference Result 1000 states and 1203 transitions. [2019-09-10 08:21:43,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:21:43,320 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 107 [2019-09-10 08:21:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:43,322 INFO L225 Difference]: With dead ends: 1000 [2019-09-10 08:21:43,322 INFO L226 Difference]: Without dead ends: 1000 [2019-09-10 08:21:43,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:21:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-09-10 08:21:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 573. [2019-09-10 08:21:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-10 08:21:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 694 transitions. [2019-09-10 08:21:43,328 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 694 transitions. Word has length 107 [2019-09-10 08:21:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:43,328 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 694 transitions. [2019-09-10 08:21:43,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:21:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 694 transitions. [2019-09-10 08:21:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:21:43,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:43,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:43,329 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash 294360019, now seen corresponding path program 1 times [2019-09-10 08:21:43,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:43,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:43,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:43,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:43,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:44,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:44,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:21:44,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:44,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:21:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:21:44,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:21:44,149 INFO L87 Difference]: Start difference. First operand 573 states and 694 transitions. Second operand 17 states. [2019-09-10 08:21:44,813 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:21:44,970 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:21:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:47,081 INFO L93 Difference]: Finished difference Result 1015 states and 1272 transitions. [2019-09-10 08:21:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:21:47,082 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-10 08:21:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:47,083 INFO L225 Difference]: With dead ends: 1015 [2019-09-10 08:21:47,083 INFO L226 Difference]: Without dead ends: 1015 [2019-09-10 08:21:47,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:21:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-10 08:21:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 552. [2019-09-10 08:21:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-10 08:21:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 665 transitions. [2019-09-10 08:21:47,091 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 665 transitions. Word has length 107 [2019-09-10 08:21:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:47,091 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 665 transitions. [2019-09-10 08:21:47,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:21:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 665 transitions. [2019-09-10 08:21:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:21:47,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:47,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:47,095 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1716120548, now seen corresponding path program 1 times [2019-09-10 08:21:47,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:47,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:47,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:47,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:47,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:47,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:47,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:21:47,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:47,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:21:47,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:21:47,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:21:47,621 INFO L87 Difference]: Start difference. First operand 552 states and 665 transitions. Second operand 12 states. [2019-09-10 08:21:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:48,776 INFO L93 Difference]: Finished difference Result 1099 states and 1412 transitions. [2019-09-10 08:21:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:21:48,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2019-09-10 08:21:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:48,778 INFO L225 Difference]: With dead ends: 1099 [2019-09-10 08:21:48,778 INFO L226 Difference]: Without dead ends: 1099 [2019-09-10 08:21:48,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:21:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-09-10 08:21:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 540. [2019-09-10 08:21:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-10 08:21:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 650 transitions. [2019-09-10 08:21:48,787 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 650 transitions. Word has length 107 [2019-09-10 08:21:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:48,787 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 650 transitions. [2019-09-10 08:21:48,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:21:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 650 transitions. [2019-09-10 08:21:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:21:48,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:48,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:48,789 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:48,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1681056201, now seen corresponding path program 1 times [2019-09-10 08:21:48,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:48,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:48,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:48,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:48,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:49,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:49,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:21:49,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:49,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:21:49,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:21:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:21:49,530 INFO L87 Difference]: Start difference. First operand 540 states and 650 transitions. Second operand 16 states. [2019-09-10 08:21:50,253 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:21:50,385 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:21:50,511 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:21:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:52,834 INFO L93 Difference]: Finished difference Result 896 states and 1062 transitions. [2019-09-10 08:21:52,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:21:52,834 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2019-09-10 08:21:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:52,836 INFO L225 Difference]: With dead ends: 896 [2019-09-10 08:21:52,836 INFO L226 Difference]: Without dead ends: 896 [2019-09-10 08:21:52,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:21:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-09-10 08:21:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 551. [2019-09-10 08:21:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-10 08:21:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 664 transitions. [2019-09-10 08:21:52,842 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 664 transitions. Word has length 107 [2019-09-10 08:21:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:52,842 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 664 transitions. [2019-09-10 08:21:52,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:21:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 664 transitions. [2019-09-10 08:21:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:21:52,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:52,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:52,843 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1048990583, now seen corresponding path program 1 times [2019-09-10 08:21:52,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:52,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:52,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:53,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:53,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:21:53,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:53,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:21:53,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:21:53,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:21:53,629 INFO L87 Difference]: Start difference. First operand 551 states and 664 transitions. Second operand 17 states. [2019-09-10 08:21:54,432 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 08:21:54,602 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 08:21:54,759 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:21:54,967 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:21:55,162 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:57,052 INFO L93 Difference]: Finished difference Result 1125 states and 1440 transitions. [2019-09-10 08:21:57,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:21:57,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-10 08:21:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:57,054 INFO L225 Difference]: With dead ends: 1125 [2019-09-10 08:21:57,054 INFO L226 Difference]: Without dead ends: 1125 [2019-09-10 08:21:57,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:21:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-10 08:21:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 513. [2019-09-10 08:21:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-10 08:21:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 616 transitions. [2019-09-10 08:21:57,062 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 616 transitions. Word has length 107 [2019-09-10 08:21:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:57,062 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 616 transitions. [2019-09-10 08:21:57,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:21:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 616 transitions. [2019-09-10 08:21:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:21:57,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:57,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:57,064 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1429007226, now seen corresponding path program 1 times [2019-09-10 08:21:57,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:57,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:57,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:57,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:57,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:57,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:57,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:21:57,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:57,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:21:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:21:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:21:57,502 INFO L87 Difference]: Start difference. First operand 513 states and 616 transitions. Second operand 11 states. [2019-09-10 08:21:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:58,765 INFO L93 Difference]: Finished difference Result 917 states and 1135 transitions. [2019-09-10 08:21:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:21:58,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 107 [2019-09-10 08:21:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:58,767 INFO L225 Difference]: With dead ends: 917 [2019-09-10 08:21:58,767 INFO L226 Difference]: Without dead ends: 917 [2019-09-10 08:21:58,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:21:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-10 08:21:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 374. [2019-09-10 08:21:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-10 08:21:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 446 transitions. [2019-09-10 08:21:58,773 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 446 transitions. Word has length 107 [2019-09-10 08:21:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:58,773 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 446 transitions. [2019-09-10 08:21:58,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:21:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 446 transitions. [2019-09-10 08:21:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:21:58,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:58,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:58,774 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:58,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash 47871049, now seen corresponding path program 1 times [2019-09-10 08:21:58,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:58,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:58,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:58,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:58,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:59,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:59,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:21:59,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:59,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:21:59,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:21:59,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:21:59,505 INFO L87 Difference]: Start difference. First operand 374 states and 446 transitions. Second operand 16 states. [2019-09-10 08:22:00,658 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 08:22:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:02,012 INFO L93 Difference]: Finished difference Result 694 states and 845 transitions. [2019-09-10 08:22:02,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:22:02,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-10 08:22:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:02,014 INFO L225 Difference]: With dead ends: 694 [2019-09-10 08:22:02,014 INFO L226 Difference]: Without dead ends: 694 [2019-09-10 08:22:02,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:22:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-10 08:22:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 370. [2019-09-10 08:22:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-10 08:22:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 441 transitions. [2019-09-10 08:22:02,018 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 441 transitions. Word has length 108 [2019-09-10 08:22:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:02,018 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 441 transitions. [2019-09-10 08:22:02,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:22:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 441 transitions. [2019-09-10 08:22:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:22:02,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:02,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:02,019 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:02,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:02,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2055568258, now seen corresponding path program 1 times [2019-09-10 08:22:02,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:02,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:02,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:02,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:02,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:03,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:03,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:22:03,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:03,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:22:03,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:22:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:22:03,264 INFO L87 Difference]: Start difference. First operand 370 states and 441 transitions. Second operand 13 states. [2019-09-10 08:22:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:05,052 INFO L93 Difference]: Finished difference Result 1394 states and 1867 transitions. [2019-09-10 08:22:05,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:22:05,053 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-09-10 08:22:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:05,055 INFO L225 Difference]: With dead ends: 1394 [2019-09-10 08:22:05,055 INFO L226 Difference]: Without dead ends: 1394 [2019-09-10 08:22:05,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:22:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-09-10 08:22:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 330. [2019-09-10 08:22:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 08:22:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 391 transitions. [2019-09-10 08:22:05,061 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 391 transitions. Word has length 108 [2019-09-10 08:22:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:05,061 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 391 transitions. [2019-09-10 08:22:05,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:22:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 391 transitions. [2019-09-10 08:22:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:22:05,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:05,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:05,062 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:05,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:05,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1742987955, now seen corresponding path program 1 times [2019-09-10 08:22:05,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:05,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:05,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:06,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:06,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:22:06,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:06,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:22:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:22:06,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:06,314 INFO L87 Difference]: Start difference. First operand 330 states and 391 transitions. Second operand 21 states. [2019-09-10 08:22:07,443 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:22:07,727 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-09-10 08:22:07,898 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:22:08,070 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:22:09,544 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:22:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:10,077 INFO L93 Difference]: Finished difference Result 613 states and 727 transitions. [2019-09-10 08:22:10,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:22:10,078 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-10 08:22:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:10,079 INFO L225 Difference]: With dead ends: 613 [2019-09-10 08:22:10,079 INFO L226 Difference]: Without dead ends: 613 [2019-09-10 08:22:10,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 08:22:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-10 08:22:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 355. [2019-09-10 08:22:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-10 08:22:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 421 transitions. [2019-09-10 08:22:10,083 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 421 transitions. Word has length 108 [2019-09-10 08:22:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:10,083 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 421 transitions. [2019-09-10 08:22:10,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:22:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 421 transitions. [2019-09-10 08:22:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:22:10,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:10,084 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:10,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1038357806, now seen corresponding path program 1 times [2019-09-10 08:22:10,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:10,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:10,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:10,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:10,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:10,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:22:10,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:10,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:22:10,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:22:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:22:10,894 INFO L87 Difference]: Start difference. First operand 355 states and 421 transitions. Second operand 16 states. [2019-09-10 08:22:11,645 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:22:11,802 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:22:11,955 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:22:12,136 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:22:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:13,341 INFO L93 Difference]: Finished difference Result 618 states and 731 transitions. [2019-09-10 08:22:13,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:22:13,342 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-10 08:22:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:13,343 INFO L225 Difference]: With dead ends: 618 [2019-09-10 08:22:13,344 INFO L226 Difference]: Without dead ends: 618 [2019-09-10 08:22:13,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:22:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-10 08:22:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 362. [2019-09-10 08:22:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-10 08:22:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 430 transitions. [2019-09-10 08:22:13,348 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 430 transitions. Word has length 108 [2019-09-10 08:22:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:13,348 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 430 transitions. [2019-09-10 08:22:13,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:22:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 430 transitions. [2019-09-10 08:22:13,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:22:13,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:13,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:13,350 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash 109917810, now seen corresponding path program 1 times [2019-09-10 08:22:13,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:13,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:13,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:14,190 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:22:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:14,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:14,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:22:14,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:14,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:22:14,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:22:14,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:14,685 INFO L87 Difference]: Start difference. First operand 362 states and 430 transitions. Second operand 21 states. [2019-09-10 08:22:17,898 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 08:22:20,266 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 08:22:20,485 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:22:20,689 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:22:22,961 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 08:22:23,545 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 08:22:23,893 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:22:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:25,719 INFO L93 Difference]: Finished difference Result 715 states and 866 transitions. [2019-09-10 08:22:25,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:22:25,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-10 08:22:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:25,720 INFO L225 Difference]: With dead ends: 715 [2019-09-10 08:22:25,720 INFO L226 Difference]: Without dead ends: 715 [2019-09-10 08:22:25,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=344, Invalid=1137, Unknown=1, NotChecked=0, Total=1482 [2019-09-10 08:22:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-09-10 08:22:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 362. [2019-09-10 08:22:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-10 08:22:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 429 transitions. [2019-09-10 08:22:25,725 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 429 transitions. Word has length 108 [2019-09-10 08:22:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:25,725 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 429 transitions. [2019-09-10 08:22:25,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:22:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 429 transitions. [2019-09-10 08:22:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:22:25,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:25,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:25,726 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:25,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1668741492, now seen corresponding path program 1 times [2019-09-10 08:22:25,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:25,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:25,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:26,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:26,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:22:26,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:26,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:22:26,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:22:26,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:22:26,237 INFO L87 Difference]: Start difference. First operand 362 states and 429 transitions. Second operand 13 states. [2019-09-10 08:22:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:27,537 INFO L93 Difference]: Finished difference Result 908 states and 1168 transitions. [2019-09-10 08:22:27,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:22:27,538 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-09-10 08:22:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:27,539 INFO L225 Difference]: With dead ends: 908 [2019-09-10 08:22:27,540 INFO L226 Difference]: Without dead ends: 908 [2019-09-10 08:22:27,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:22:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-09-10 08:22:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 282. [2019-09-10 08:22:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-10 08:22:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 337 transitions. [2019-09-10 08:22:27,545 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 337 transitions. Word has length 108 [2019-09-10 08:22:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:27,545 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 337 transitions. [2019-09-10 08:22:27,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:22:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 337 transitions. [2019-09-10 08:22:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:22:27,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:27,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:27,546 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:27,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:27,546 INFO L82 PathProgramCache]: Analyzing trace with hash 881258931, now seen corresponding path program 1 times [2019-09-10 08:22:27,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:27,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:27,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:27,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:27,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:27,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:27,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:27,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:27,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:27,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:27,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:27,697 INFO L87 Difference]: Start difference. First operand 282 states and 337 transitions. Second operand 9 states. [2019-09-10 08:22:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:28,716 INFO L93 Difference]: Finished difference Result 539 states and 701 transitions. [2019-09-10 08:22:28,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:28,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-09-10 08:22:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:28,717 INFO L225 Difference]: With dead ends: 539 [2019-09-10 08:22:28,718 INFO L226 Difference]: Without dead ends: 539 [2019-09-10 08:22:28,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-10 08:22:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 282. [2019-09-10 08:22:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-10 08:22:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 336 transitions. [2019-09-10 08:22:28,722 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 336 transitions. Word has length 109 [2019-09-10 08:22:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:28,722 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 336 transitions. [2019-09-10 08:22:28,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 336 transitions. [2019-09-10 08:22:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:22:28,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:28,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:28,723 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:28,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:28,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1509496907, now seen corresponding path program 1 times [2019-09-10 08:22:28,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:28,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:28,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:28,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:28,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:29,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 08:22:29,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:29,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:22:29,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:29,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:22:29,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:22:29,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:22:29,363 INFO L87 Difference]: Start difference. First operand 282 states and 336 transitions. Second operand 13 states. [2019-09-10 08:22:29,889 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-10 08:22:30,025 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-10 08:22:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:30,829 INFO L93 Difference]: Finished difference Result 780 states and 1020 transitions. [2019-09-10 08:22:30,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:22:30,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2019-09-10 08:22:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:30,831 INFO L225 Difference]: With dead ends: 780 [2019-09-10 08:22:30,831 INFO L226 Difference]: Without dead ends: 780 [2019-09-10 08:22:30,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:22:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2019-09-10 08:22:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 220. [2019-09-10 08:22:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-10 08:22:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2019-09-10 08:22:30,837 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 109 [2019-09-10 08:22:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:30,837 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2019-09-10 08:22:30,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:22:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2019-09-10 08:22:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:22:30,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:30,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:30,838 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:30,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2070234167, now seen corresponding path program 1 times [2019-09-10 08:22:30,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:30,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:30,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:31,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:31,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:31,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:31,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:31,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:31,011 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand 9 states. [2019-09-10 08:22:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:31,692 INFO L93 Difference]: Finished difference Result 318 states and 398 transitions. [2019-09-10 08:22:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:22:31,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-10 08:22:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:31,693 INFO L225 Difference]: With dead ends: 318 [2019-09-10 08:22:31,693 INFO L226 Difference]: Without dead ends: 318 [2019-09-10 08:22:31,694 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 08:22:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-10 08:22:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 220. [2019-09-10 08:22:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-10 08:22:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2019-09-10 08:22:31,696 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 110 [2019-09-10 08:22:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:31,697 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2019-09-10 08:22:31,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2019-09-10 08:22:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:22:31,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:31,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:31,699 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1677363192, now seen corresponding path program 1 times [2019-09-10 08:22:31,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:31,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:31,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:31,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:31,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:32,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:22:32,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:32,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:22:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:22:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:22:32,416 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand 16 states. [2019-09-10 08:22:33,097 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:22:33,238 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:22:33,363 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:22:33,485 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 08:22:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:34,518 INFO L93 Difference]: Finished difference Result 705 states and 933 transitions. [2019-09-10 08:22:34,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:22:34,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 111 [2019-09-10 08:22:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:34,520 INFO L225 Difference]: With dead ends: 705 [2019-09-10 08:22:34,520 INFO L226 Difference]: Without dead ends: 705 [2019-09-10 08:22:34,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:22:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-09-10 08:22:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 255. [2019-09-10 08:22:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 08:22:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 305 transitions. [2019-09-10 08:22:34,524 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 305 transitions. Word has length 111 [2019-09-10 08:22:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:34,525 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 305 transitions. [2019-09-10 08:22:34,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:22:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 305 transitions. [2019-09-10 08:22:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:22:34,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:34,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:34,526 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:34,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1816444114, now seen corresponding path program 1 times [2019-09-10 08:22:34,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:34,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:34,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:35,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:35,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:22:35,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:35,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:22:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:22:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:22:35,301 INFO L87 Difference]: Start difference. First operand 255 states and 305 transitions. Second operand 13 states. [2019-09-10 08:22:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:36,328 INFO L93 Difference]: Finished difference Result 750 states and 993 transitions. [2019-09-10 08:22:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:22:36,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-09-10 08:22:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:36,330 INFO L225 Difference]: With dead ends: 750 [2019-09-10 08:22:36,330 INFO L226 Difference]: Without dead ends: 750 [2019-09-10 08:22:36,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:22:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-09-10 08:22:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 235. [2019-09-10 08:22:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-10 08:22:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 283 transitions. [2019-09-10 08:22:36,335 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 283 transitions. Word has length 112 [2019-09-10 08:22:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:36,335 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 283 transitions. [2019-09-10 08:22:36,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:22:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 283 transitions. [2019-09-10 08:22:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:22:36,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:36,336 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -285569651, now seen corresponding path program 1 times [2019-09-10 08:22:36,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:36,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:36,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:37,297 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 08:22:37,547 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:22:37,678 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 08:22:37,814 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:22:37,946 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:22:38,254 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-10 08:22:38,400 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 08:22:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:39,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:39,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-10 08:22:39,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:39,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 08:22:39,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 08:22:39,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:22:39,864 INFO L87 Difference]: Start difference. First operand 235 states and 283 transitions. Second operand 33 states. [2019-09-10 08:22:40,213 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-09-10 08:22:41,030 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 08:22:41,193 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:22:41,432 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:22:41,732 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:22:42,072 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:22:42,423 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:22:43,064 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-09-10 08:22:43,440 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-09-10 08:22:43,774 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-09-10 08:22:44,152 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-10 08:22:44,571 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 83 [2019-09-10 08:22:45,067 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 99 [2019-09-10 08:22:45,489 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 81 [2019-09-10 08:22:45,903 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 81 [2019-09-10 08:22:46,306 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-09-10 08:22:46,771 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-09-10 08:22:47,101 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-09-10 08:22:47,543 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-09-10 08:22:47,873 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 08:22:48,112 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 08:22:48,556 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 08:22:48,902 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 08:22:49,307 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:22:50,642 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2019-09-10 08:22:51,149 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:22:53,116 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:22:53,402 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 08:22:53,804 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-09-10 08:22:54,170 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 08:22:54,663 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-09-10 08:22:57,249 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-09-10 08:22:59,963 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-10 08:23:01,683 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-09-10 08:23:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:18,271 INFO L93 Difference]: Finished difference Result 2594 states and 3614 transitions. [2019-09-10 08:23:18,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 08:23:18,272 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 112 [2019-09-10 08:23:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:18,275 INFO L225 Difference]: With dead ends: 2594 [2019-09-10 08:23:18,275 INFO L226 Difference]: Without dead ends: 2594 [2019-09-10 08:23:18,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=1029, Invalid=5451, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 08:23:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2019-09-10 08:23:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 253. [2019-09-10 08:23:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-10 08:23:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 304 transitions. [2019-09-10 08:23:18,284 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 304 transitions. Word has length 112 [2019-09-10 08:23:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:18,285 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 304 transitions. [2019-09-10 08:23:18,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 08:23:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 304 transitions. [2019-09-10 08:23:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:23:18,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:18,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:18,286 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:18,286 INFO L82 PathProgramCache]: Analyzing trace with hash -310268750, now seen corresponding path program 1 times [2019-09-10 08:23:18,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:18,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:18,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:18,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:18,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:18,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:18,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:23:18,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:18,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:23:18,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:23:18,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:23:18,844 INFO L87 Difference]: Start difference. First operand 253 states and 304 transitions. Second operand 13 states. [2019-09-10 08:23:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:19,596 INFO L93 Difference]: Finished difference Result 510 states and 670 transitions. [2019-09-10 08:23:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:19,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2019-09-10 08:23:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:19,598 INFO L225 Difference]: With dead ends: 510 [2019-09-10 08:23:19,598 INFO L226 Difference]: Without dead ends: 510 [2019-09-10 08:23:19,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:23:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-10 08:23:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 194. [2019-09-10 08:23:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-10 08:23:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2019-09-10 08:23:19,601 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 113 [2019-09-10 08:23:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:19,601 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2019-09-10 08:23:19,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:23:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2019-09-10 08:23:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:23:19,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:19,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:19,603 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash 846487170, now seen corresponding path program 1 times [2019-09-10 08:23:19,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:19,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:19,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:19,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:19,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:19,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:19,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:19,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:19,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:19,721 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand 3 states. [2019-09-10 08:23:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:19,758 INFO L93 Difference]: Finished difference Result 265 states and 337 transitions. [2019-09-10 08:23:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:19,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 08:23:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:19,760 INFO L225 Difference]: With dead ends: 265 [2019-09-10 08:23:19,760 INFO L226 Difference]: Without dead ends: 265 [2019-09-10 08:23:19,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-10 08:23:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2019-09-10 08:23:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-10 08:23:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 336 transitions. [2019-09-10 08:23:19,764 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 336 transitions. Word has length 144 [2019-09-10 08:23:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:19,764 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 336 transitions. [2019-09-10 08:23:19,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 336 transitions. [2019-09-10 08:23:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:23:19,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:19,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:19,765 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:19,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1179395723, now seen corresponding path program 1 times [2019-09-10 08:23:19,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:19,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:19,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:19,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:19,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:19,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:19,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:23:19,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:19,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:23:19,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:23:19,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:19,926 INFO L87 Difference]: Start difference. First operand 263 states and 336 transitions. Second operand 7 states. [2019-09-10 08:23:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:20,360 INFO L93 Difference]: Finished difference Result 567 states and 764 transitions. [2019-09-10 08:23:20,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:23:20,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:23:20,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:20,362 INFO L225 Difference]: With dead ends: 567 [2019-09-10 08:23:20,362 INFO L226 Difference]: Without dead ends: 567 [2019-09-10 08:23:20,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:23:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-10 08:23:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 295. [2019-09-10 08:23:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-10 08:23:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 379 transitions. [2019-09-10 08:23:20,367 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 379 transitions. Word has length 146 [2019-09-10 08:23:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:20,367 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 379 transitions. [2019-09-10 08:23:20,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:23:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 379 transitions. [2019-09-10 08:23:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:23:20,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:20,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:20,368 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:20,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1500507275, now seen corresponding path program 1 times [2019-09-10 08:23:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:20,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:20,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:20,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:20,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:23:20,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:20,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:23:20,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:23:20,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:20,502 INFO L87 Difference]: Start difference. First operand 295 states and 379 transitions. Second operand 7 states. [2019-09-10 08:23:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:21,011 INFO L93 Difference]: Finished difference Result 927 states and 1274 transitions. [2019-09-10 08:23:21,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:23:21,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:23:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:21,012 INFO L225 Difference]: With dead ends: 927 [2019-09-10 08:23:21,012 INFO L226 Difference]: Without dead ends: 927 [2019-09-10 08:23:21,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:23:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-10 08:23:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 489. [2019-09-10 08:23:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-09-10 08:23:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 659 transitions. [2019-09-10 08:23:21,019 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 659 transitions. Word has length 146 [2019-09-10 08:23:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:21,019 INFO L475 AbstractCegarLoop]: Abstraction has 489 states and 659 transitions. [2019-09-10 08:23:21,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:23:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 659 transitions. [2019-09-10 08:23:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:23:21,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:21,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:21,020 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:21,021 INFO L82 PathProgramCache]: Analyzing trace with hash -656987622, now seen corresponding path program 1 times [2019-09-10 08:23:21,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:21,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:21,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:21,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:21,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:21,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:21,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:21,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:21,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:21,134 INFO L87 Difference]: Start difference. First operand 489 states and 659 transitions. Second operand 3 states. [2019-09-10 08:23:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:21,173 INFO L93 Difference]: Finished difference Result 683 states and 932 transitions. [2019-09-10 08:23:21,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:21,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:23:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:21,175 INFO L225 Difference]: With dead ends: 683 [2019-09-10 08:23:21,175 INFO L226 Difference]: Without dead ends: 683 [2019-09-10 08:23:21,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-10 08:23:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2019-09-10 08:23:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-09-10 08:23:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 931 transitions. [2019-09-10 08:23:21,182 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 931 transitions. Word has length 146 [2019-09-10 08:23:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:21,183 INFO L475 AbstractCegarLoop]: Abstraction has 681 states and 931 transitions. [2019-09-10 08:23:21,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 931 transitions. [2019-09-10 08:23:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:23:21,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:21,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:21,184 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash -723481134, now seen corresponding path program 1 times [2019-09-10 08:23:21,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:21,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:21,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:21,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:21,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:21,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:21,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:21,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:21,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:21,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:21,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:21,281 INFO L87 Difference]: Start difference. First operand 681 states and 931 transitions. Second operand 3 states. [2019-09-10 08:23:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:21,313 INFO L93 Difference]: Finished difference Result 1181 states and 1622 transitions. [2019-09-10 08:23:21,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:21,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:23:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:21,315 INFO L225 Difference]: With dead ends: 1181 [2019-09-10 08:23:21,315 INFO L226 Difference]: Without dead ends: 1181 [2019-09-10 08:23:21,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-09-10 08:23:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1179. [2019-09-10 08:23:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2019-09-10 08:23:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1621 transitions. [2019-09-10 08:23:21,325 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1621 transitions. Word has length 146 [2019-09-10 08:23:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:21,325 INFO L475 AbstractCegarLoop]: Abstraction has 1179 states and 1621 transitions. [2019-09-10 08:23:21,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1621 transitions. [2019-09-10 08:23:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:23:21,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:21,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:21,327 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash 803696779, now seen corresponding path program 1 times [2019-09-10 08:23:21,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:21,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:21,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:21,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:21,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:21,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:21,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:23:21,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:21,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:23:21,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:23:21,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:21,463 INFO L87 Difference]: Start difference. First operand 1179 states and 1621 transitions. Second operand 7 states. [2019-09-10 08:23:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:21,980 INFO L93 Difference]: Finished difference Result 4111 states and 5698 transitions. [2019-09-10 08:23:21,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:23:21,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:23:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:21,985 INFO L225 Difference]: With dead ends: 4111 [2019-09-10 08:23:21,985 INFO L226 Difference]: Without dead ends: 4111 [2019-09-10 08:23:21,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:23:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2019-09-10 08:23:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 2357. [2019-09-10 08:23:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2357 states. [2019-09-10 08:23:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3283 transitions. [2019-09-10 08:23:22,008 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3283 transitions. Word has length 146 [2019-09-10 08:23:22,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:22,008 INFO L475 AbstractCegarLoop]: Abstraction has 2357 states and 3283 transitions. [2019-09-10 08:23:22,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:23:22,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3283 transitions. [2019-09-10 08:23:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:23:22,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:22,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:22,010 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1196216693, now seen corresponding path program 1 times [2019-09-10 08:23:22,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:22,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:22,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:22,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:22,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:23:22,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:22,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:23:22,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:23:22,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:22,154 INFO L87 Difference]: Start difference. First operand 2357 states and 3283 transitions. Second operand 7 states. [2019-09-10 08:23:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:22,654 INFO L93 Difference]: Finished difference Result 7579 states and 10534 transitions. [2019-09-10 08:23:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:23:22,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:23:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:22,662 INFO L225 Difference]: With dead ends: 7579 [2019-09-10 08:23:22,662 INFO L226 Difference]: Without dead ends: 7579 [2019-09-10 08:23:22,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:23:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2019-09-10 08:23:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 4833. [2019-09-10 08:23:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2019-09-10 08:23:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 6775 transitions. [2019-09-10 08:23:22,711 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 6775 transitions. Word has length 146 [2019-09-10 08:23:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:22,711 INFO L475 AbstractCegarLoop]: Abstraction has 4833 states and 6775 transitions. [2019-09-10 08:23:22,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:23:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 6775 transitions. [2019-09-10 08:23:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:23:22,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:22,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:22,713 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:22,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:22,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1315067253, now seen corresponding path program 1 times [2019-09-10 08:23:22,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:22,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:22,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:22,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:22,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:23:22,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:22,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:23:22,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:23:22,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:22,858 INFO L87 Difference]: Start difference. First operand 4833 states and 6775 transitions. Second operand 7 states. [2019-09-10 08:23:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:23,388 INFO L93 Difference]: Finished difference Result 17191 states and 24058 transitions. [2019-09-10 08:23:23,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:23:23,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:23:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:23,402 INFO L225 Difference]: With dead ends: 17191 [2019-09-10 08:23:23,402 INFO L226 Difference]: Without dead ends: 17191 [2019-09-10 08:23:23,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:23:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17191 states. [2019-09-10 08:23:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17191 to 10025. [2019-09-10 08:23:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10025 states. [2019-09-10 08:23:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10025 states to 10025 states and 14095 transitions. [2019-09-10 08:23:23,520 INFO L78 Accepts]: Start accepts. Automaton has 10025 states and 14095 transitions. Word has length 146 [2019-09-10 08:23:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:23,521 INFO L475 AbstractCegarLoop]: Abstraction has 10025 states and 14095 transitions. [2019-09-10 08:23:23,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:23:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 10025 states and 14095 transitions. [2019-09-10 08:23:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:23:23,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:23,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:23,523 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1598265205, now seen corresponding path program 1 times [2019-09-10 08:23:23,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:23,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:23,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:23,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:23,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:23:23,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:23,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:23:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:23:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:23,713 INFO L87 Difference]: Start difference. First operand 10025 states and 14095 transitions. Second operand 7 states. [2019-09-10 08:23:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:24,263 INFO L93 Difference]: Finished difference Result 28803 states and 40389 transitions. [2019-09-10 08:23:24,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:23:24,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 08:23:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:24,287 INFO L225 Difference]: With dead ends: 28803 [2019-09-10 08:23:24,287 INFO L226 Difference]: Without dead ends: 28803 [2019-09-10 08:23:24,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:23:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28803 states. [2019-09-10 08:23:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28803 to 16473. [2019-09-10 08:23:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16473 states. [2019-09-10 08:23:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16473 states to 16473 states and 23167 transitions. [2019-09-10 08:23:24,472 INFO L78 Accepts]: Start accepts. Automaton has 16473 states and 23167 transitions. Word has length 146 [2019-09-10 08:23:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:24,472 INFO L475 AbstractCegarLoop]: Abstraction has 16473 states and 23167 transitions. [2019-09-10 08:23:24,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:23:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16473 states and 23167 transitions. [2019-09-10 08:23:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:23:24,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:24,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:24,475 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:24,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:24,475 INFO L82 PathProgramCache]: Analyzing trace with hash 661211626, now seen corresponding path program 1 times [2019-09-10 08:23:24,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:24,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:24,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:24,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:24,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:23:24,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:24,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:23:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:23:24,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:23:24,604 INFO L87 Difference]: Start difference. First operand 16473 states and 23167 transitions. Second operand 6 states. [2019-09-10 08:23:24,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:24,738 INFO L93 Difference]: Finished difference Result 27324 states and 37929 transitions. [2019-09-10 08:23:24,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:23:24,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-10 08:23:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:24,762 INFO L225 Difference]: With dead ends: 27324 [2019-09-10 08:23:24,762 INFO L226 Difference]: Without dead ends: 27324 [2019-09-10 08:23:24,762 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 08:23:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27324 states. [2019-09-10 08:23:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27324 to 16665. [2019-09-10 08:23:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-09-10 08:23:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 23295 transitions. [2019-09-10 08:23:24,940 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 23295 transitions. Word has length 147 [2019-09-10 08:23:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:24,941 INFO L475 AbstractCegarLoop]: Abstraction has 16665 states and 23295 transitions. [2019-09-10 08:23:24,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:23:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 23295 transitions. [2019-09-10 08:23:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:23:24,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:24,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:24,943 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash -935556183, now seen corresponding path program 1 times [2019-09-10 08:23:24,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:24,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:24,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:25,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:25,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:25,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:25,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:25,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:25,054 INFO L87 Difference]: Start difference. First operand 16665 states and 23295 transitions. Second operand 3 states. [2019-09-10 08:23:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:25,199 INFO L93 Difference]: Finished difference Result 27179 states and 38128 transitions. [2019-09-10 08:23:25,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:25,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-10 08:23:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:25,220 INFO L225 Difference]: With dead ends: 27179 [2019-09-10 08:23:25,220 INFO L226 Difference]: Without dead ends: 27179 [2019-09-10 08:23:25,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27179 states. [2019-09-10 08:23:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27179 to 19873. [2019-09-10 08:23:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19873 states. [2019-09-10 08:23:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19873 states to 19873 states and 27991 transitions. [2019-09-10 08:23:25,402 INFO L78 Accepts]: Start accepts. Automaton has 19873 states and 27991 transitions. Word has length 147 [2019-09-10 08:23:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:25,402 INFO L475 AbstractCegarLoop]: Abstraction has 19873 states and 27991 transitions. [2019-09-10 08:23:25,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19873 states and 27991 transitions. [2019-09-10 08:23:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:23:25,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:25,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:25,405 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash 992244541, now seen corresponding path program 1 times [2019-09-10 08:23:25,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:25,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:25,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:25,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:25,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:25,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:25,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:25,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:25,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:25,512 INFO L87 Difference]: Start difference. First operand 19873 states and 27991 transitions. Second operand 3 states. [2019-09-10 08:23:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:25,566 INFO L93 Difference]: Finished difference Result 18579 states and 25832 transitions. [2019-09-10 08:23:25,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:25,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-10 08:23:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:25,583 INFO L225 Difference]: With dead ends: 18579 [2019-09-10 08:23:25,583 INFO L226 Difference]: Without dead ends: 18579 [2019-09-10 08:23:25,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:25,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18579 states. [2019-09-10 08:23:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18579 to 14125. [2019-09-10 08:23:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14125 states. [2019-09-10 08:23:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14125 states to 14125 states and 19621 transitions. [2019-09-10 08:23:25,714 INFO L78 Accepts]: Start accepts. Automaton has 14125 states and 19621 transitions. Word has length 148 [2019-09-10 08:23:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:25,714 INFO L475 AbstractCegarLoop]: Abstraction has 14125 states and 19621 transitions. [2019-09-10 08:23:25,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 14125 states and 19621 transitions. [2019-09-10 08:23:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:23:25,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:25,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:25,715 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 536479185, now seen corresponding path program 1 times [2019-09-10 08:23:25,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:25,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:25,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:25,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:25,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:25,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:25,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:25,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:25,824 INFO L87 Difference]: Start difference. First operand 14125 states and 19621 transitions. Second operand 3 states. [2019-09-10 08:23:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:25,873 INFO L93 Difference]: Finished difference Result 17769 states and 24398 transitions. [2019-09-10 08:23:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:25,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-10 08:23:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:25,890 INFO L225 Difference]: With dead ends: 17769 [2019-09-10 08:23:25,890 INFO L226 Difference]: Without dead ends: 17769 [2019-09-10 08:23:25,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17769 states. [2019-09-10 08:23:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17769 to 17119. [2019-09-10 08:23:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17119 states. [2019-09-10 08:23:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17119 states to 17119 states and 23623 transitions. [2019-09-10 08:23:26,024 INFO L78 Accepts]: Start accepts. Automaton has 17119 states and 23623 transitions. Word has length 149 [2019-09-10 08:23:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:26,024 INFO L475 AbstractCegarLoop]: Abstraction has 17119 states and 23623 transitions. [2019-09-10 08:23:26,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 17119 states and 23623 transitions. [2019-09-10 08:23:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:23:26,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:26,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:26,026 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash -251713815, now seen corresponding path program 1 times [2019-09-10 08:23:26,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:26,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:26,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:26,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:26,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:26,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:26,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:26,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:26,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:26,772 INFO L87 Difference]: Start difference. First operand 17119 states and 23623 transitions. Second operand 3 states. [2019-09-10 08:23:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:26,821 INFO L93 Difference]: Finished difference Result 16473 states and 22568 transitions. [2019-09-10 08:23:26,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:26,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 08:23:26,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:26,837 INFO L225 Difference]: With dead ends: 16473 [2019-09-10 08:23:26,838 INFO L226 Difference]: Without dead ends: 16473 [2019-09-10 08:23:26,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16473 states. [2019-09-10 08:23:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16473 to 16471. [2019-09-10 08:23:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16471 states. [2019-09-10 08:23:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16471 states to 16471 states and 22567 transitions. [2019-09-10 08:23:26,979 INFO L78 Accepts]: Start accepts. Automaton has 16471 states and 22567 transitions. Word has length 150 [2019-09-10 08:23:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:26,980 INFO L475 AbstractCegarLoop]: Abstraction has 16471 states and 22567 transitions. [2019-09-10 08:23:26,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 16471 states and 22567 transitions. [2019-09-10 08:23:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:23:26,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:26,981 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:26,981 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:26,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1150986759, now seen corresponding path program 1 times [2019-09-10 08:23:26,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:26,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:26,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:26,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:26,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:27,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:27,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:27,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:27,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:27,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:27,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:27,098 INFO L87 Difference]: Start difference. First operand 16471 states and 22567 transitions. Second operand 3 states. [2019-09-10 08:23:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:27,163 INFO L93 Difference]: Finished difference Result 18087 states and 24736 transitions. [2019-09-10 08:23:27,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:27,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-10 08:23:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:27,180 INFO L225 Difference]: With dead ends: 18087 [2019-09-10 08:23:27,180 INFO L226 Difference]: Without dead ends: 18087 [2019-09-10 08:23:27,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18087 states. [2019-09-10 08:23:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18087 to 18085. [2019-09-10 08:23:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18085 states. [2019-09-10 08:23:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18085 states to 18085 states and 24735 transitions. [2019-09-10 08:23:27,325 INFO L78 Accepts]: Start accepts. Automaton has 18085 states and 24735 transitions. Word has length 151 [2019-09-10 08:23:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:27,325 INFO L475 AbstractCegarLoop]: Abstraction has 18085 states and 24735 transitions. [2019-09-10 08:23:27,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 18085 states and 24735 transitions. [2019-09-10 08:23:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:23:27,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:27,328 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:27,328 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1877475909, now seen corresponding path program 1 times [2019-09-10 08:23:27,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:27,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:27,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:27,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:27,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:23:27,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2019-09-10 08:23:27,678 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7185], [7188], [7192], [7205], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9200], [9205], [9208], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9256], [9258], [9260], [9263], [9278], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9322], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:23:27,728 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:23:27,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:23:28,432 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:23:30,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:23:30,033 INFO L272 AbstractInterpreter]: Visited 168 different actions 697 times. Merged at 57 different actions 474 times. Widened at 24 different actions 89 times. Performed 3488 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3488 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 45 fixpoints after 13 different actions. Largest state had 791 variables. [2019-09-10 08:23:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:30,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:23:30,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:30,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:23:30,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:30,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:23:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:30,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 4186 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:23:30,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:23:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:23:30,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:23:31,254 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-10 08:23:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:23:31,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:23:31,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:23:31,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:31,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:23:31,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:23:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:23:31,321 INFO L87 Difference]: Start difference. First operand 18085 states and 24735 transitions. Second operand 8 states. [2019-09-10 08:23:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:31,828 INFO L93 Difference]: Finished difference Result 107749 states and 147267 transitions. [2019-09-10 08:23:31,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:23:31,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 186 [2019-09-10 08:23:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:32,089 INFO L225 Difference]: With dead ends: 107749 [2019-09-10 08:23:32,090 INFO L226 Difference]: Without dead ends: 107749 [2019-09-10 08:23:32,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:23:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107749 states. [2019-09-10 08:23:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107749 to 29449. [2019-09-10 08:23:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29449 states. [2019-09-10 08:23:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29449 states to 29449 states and 40143 transitions. [2019-09-10 08:23:32,952 INFO L78 Accepts]: Start accepts. Automaton has 29449 states and 40143 transitions. Word has length 186 [2019-09-10 08:23:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:32,953 INFO L475 AbstractCegarLoop]: Abstraction has 29449 states and 40143 transitions. [2019-09-10 08:23:32,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:23:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 29449 states and 40143 transitions. [2019-09-10 08:23:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:23:32,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:32,961 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:32,961 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:32,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2041792443, now seen corresponding path program 1 times [2019-09-10 08:23:32,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:32,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:32,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:33,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:33,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:23:33,686 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2019-09-10 08:23:33,690 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7185], [7188], [7192], [7205], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9212], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9256], [9258], [9260], [9263], [9278], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9310], [9315], [9318], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:23:33,715 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:23:33,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:23:34,129 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:23:35,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:23:35,620 INFO L272 AbstractInterpreter]: Visited 168 different actions 742 times. Merged at 57 different actions 516 times. Widened at 25 different actions 68 times. Performed 3537 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3537 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 45 fixpoints after 14 different actions. Largest state had 791 variables. [2019-09-10 08:23:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:35,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:23:35,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:35,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:23:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:35,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:23:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:36,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 4186 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:23:36,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:23:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:23:36,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:23:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-10 08:23:36,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:23:36,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:23:36,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:36,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:23:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:23:36,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:23:36,894 INFO L87 Difference]: Start difference. First operand 29449 states and 40143 transitions. Second operand 8 states. [2019-09-10 08:23:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:37,210 INFO L93 Difference]: Finished difference Result 118493 states and 161752 transitions. [2019-09-10 08:23:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:23:37,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 186 [2019-09-10 08:23:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:37,382 INFO L225 Difference]: With dead ends: 118493 [2019-09-10 08:23:37,382 INFO L226 Difference]: Without dead ends: 118493 [2019-09-10 08:23:37,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:23:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118493 states. [2019-09-10 08:23:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118493 to 46447. [2019-09-10 08:23:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46447 states. [2019-09-10 08:23:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46447 states to 46447 states and 63135 transitions. [2019-09-10 08:23:38,252 INFO L78 Accepts]: Start accepts. Automaton has 46447 states and 63135 transitions. Word has length 186 [2019-09-10 08:23:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:38,253 INFO L475 AbstractCegarLoop]: Abstraction has 46447 states and 63135 transitions. [2019-09-10 08:23:38,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:23:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 46447 states and 63135 transitions. [2019-09-10 08:23:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:23:38,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:38,258 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:38,258 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash 41878971, now seen corresponding path program 1 times [2019-09-10 08:23:38,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:38,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:38,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:38,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:23:38,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:38,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:23:38,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:38,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:23:38,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:23:38,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:23:38,819 INFO L87 Difference]: Start difference. First operand 46447 states and 63135 transitions. Second operand 6 states. [2019-09-10 08:23:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:39,217 INFO L93 Difference]: Finished difference Result 62197 states and 84406 transitions. [2019-09-10 08:23:39,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:23:39,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 08:23:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:39,304 INFO L225 Difference]: With dead ends: 62197 [2019-09-10 08:23:39,304 INFO L226 Difference]: Without dead ends: 62197 [2019-09-10 08:23:39,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:23:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62197 states. [2019-09-10 08:23:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62197 to 57811. [2019-09-10 08:23:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57811 states. [2019-09-10 08:23:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57811 states to 57811 states and 78543 transitions. [2019-09-10 08:23:39,991 INFO L78 Accepts]: Start accepts. Automaton has 57811 states and 78543 transitions. Word has length 186 [2019-09-10 08:23:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:39,992 INFO L475 AbstractCegarLoop]: Abstraction has 57811 states and 78543 transitions. [2019-09-10 08:23:39,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:23:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 57811 states and 78543 transitions. [2019-09-10 08:23:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 08:23:39,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:39,998 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:39,998 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:39,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:39,999 INFO L82 PathProgramCache]: Analyzing trace with hash -360169541, now seen corresponding path program 1 times [2019-09-10 08:23:39,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:40,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:40,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:40,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:40,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:23:40,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:40,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:23:40,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:40,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:23:40,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:23:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:23:40,221 INFO L87 Difference]: Start difference. First operand 57811 states and 78543 transitions. Second operand 6 states. [2019-09-10 08:23:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:40,801 INFO L93 Difference]: Finished difference Result 103930 states and 141336 transitions. [2019-09-10 08:23:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:23:40,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 08:23:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:40,938 INFO L225 Difference]: With dead ends: 103930 [2019-09-10 08:23:40,938 INFO L226 Difference]: Without dead ends: 103930 [2019-09-10 08:23:40,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:23:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103930 states. [2019-09-10 08:23:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103930 to 102043. [2019-09-10 08:23:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102043 states. [2019-09-10 08:23:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102043 states to 102043 states and 138807 transitions. [2019-09-10 08:23:42,013 INFO L78 Accepts]: Start accepts. Automaton has 102043 states and 138807 transitions. Word has length 186 [2019-09-10 08:23:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:42,013 INFO L475 AbstractCegarLoop]: Abstraction has 102043 states and 138807 transitions. [2019-09-10 08:23:42,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:23:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 102043 states and 138807 transitions. [2019-09-10 08:23:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:23:42,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:42,018 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:42,018 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1052865823, now seen corresponding path program 1 times [2019-09-10 08:23:42,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:42,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:42,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:42,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:42,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:44,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:44,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:23:44,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2019-09-10 08:23:44,447 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7185], [7188], [7192], [7205], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9212], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9244], [9249], [9252], [9256], [9258], [9260], [9263], [9278], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9322], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9392], [9395], [9398], [9406], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:23:44,452 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:23:44,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:23:44,798 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:23:46,345 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:23:46,345 INFO L272 AbstractInterpreter]: Visited 173 different actions 932 times. Merged at 62 different actions 660 times. Widened at 28 different actions 109 times. Performed 4220 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 85 fixpoints after 20 different actions. Largest state had 792 variables. [2019-09-10 08:23:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:46,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:23:46,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:46,346 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:23:46,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:46,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:23:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:46,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 4188 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:23:46,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:23:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:23:47,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:23:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:23:47,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:23:47,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:23:47,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:47,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:23:47,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:23:47,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:23:47,559 INFO L87 Difference]: Start difference. First operand 102043 states and 138807 transitions. Second operand 8 states. [2019-09-10 08:23:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:48,115 INFO L93 Difference]: Finished difference Result 239275 states and 325909 transitions. [2019-09-10 08:23:48,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:23:48,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 187 [2019-09-10 08:23:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:48,439 INFO L225 Difference]: With dead ends: 239275 [2019-09-10 08:23:48,439 INFO L226 Difference]: Without dead ends: 239275 [2019-09-10 08:23:48,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:23:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239275 states. [2019-09-10 08:23:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239275 to 113407. [2019-09-10 08:23:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113407 states. [2019-09-10 08:23:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113407 states to 113407 states and 154215 transitions. [2019-09-10 08:23:50,470 INFO L78 Accepts]: Start accepts. Automaton has 113407 states and 154215 transitions. Word has length 187 [2019-09-10 08:23:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:50,471 INFO L475 AbstractCegarLoop]: Abstraction has 113407 states and 154215 transitions. [2019-09-10 08:23:50,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:23:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 113407 states and 154215 transitions. [2019-09-10 08:23:50,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:23:50,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:50,476 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:50,478 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:50,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash 201313651, now seen corresponding path program 1 times [2019-09-10 08:23:50,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:50,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:50,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:50,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:50,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:50,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:50,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:23:50,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:50,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:23:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:23:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:50,667 INFO L87 Difference]: Start difference. First operand 113407 states and 154215 transitions. Second operand 3 states. [2019-09-10 08:23:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:50,911 INFO L93 Difference]: Finished difference Result 105489 states and 141016 transitions. [2019-09-10 08:23:50,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:50,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-10 08:23:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:51,017 INFO L225 Difference]: With dead ends: 105489 [2019-09-10 08:23:51,017 INFO L226 Difference]: Without dead ends: 105489 [2019-09-10 08:23:51,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 08:23:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105489 states. [2019-09-10 08:23:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105489 to 102823. [2019-09-10 08:23:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102823 states. [2019-09-10 08:23:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102823 states to 102823 states and 137907 transitions. [2019-09-10 08:23:52,472 INFO L78 Accepts]: Start accepts. Automaton has 102823 states and 137907 transitions. Word has length 187 [2019-09-10 08:23:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:52,473 INFO L475 AbstractCegarLoop]: Abstraction has 102823 states and 137907 transitions. [2019-09-10 08:23:52,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 102823 states and 137907 transitions. [2019-09-10 08:23:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:23:52,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:52,477 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:52,478 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:52,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:52,478 INFO L82 PathProgramCache]: Analyzing trace with hash 866535055, now seen corresponding path program 1 times [2019-09-10 08:23:52,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:52,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:52,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:52,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:52,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:52,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:52,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:23:52,842 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2019-09-10 08:23:52,843 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7185], [7188], [7192], [7205], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9212], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9256], [9258], [9260], [9263], [9266], [9271], [9274], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9322], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9376], [9379], [9382], [9390], [9392], [9395], [9398], [9406], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:23:52,847 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:23:52,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:23:53,076 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:23:54,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:23:54,390 INFO L272 AbstractInterpreter]: Visited 176 different actions 1116 times. Merged at 63 different actions 821 times. Widened at 30 different actions 153 times. Performed 4724 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4724 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 101 fixpoints after 24 different actions. Largest state had 793 variables. [2019-09-10 08:23:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:54,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:23:54,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:54,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:23:54,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:54,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:23:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:55,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 4190 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:23:55,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:23:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:23:55,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:23:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:23:55,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:23:55,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 8] total 23 [2019-09-10 08:23:55,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:55,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:23:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:23:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:23:55,923 INFO L87 Difference]: Start difference. First operand 102823 states and 137907 transitions. Second operand 8 states. [2019-09-10 08:23:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:56,444 INFO L93 Difference]: Finished difference Result 226525 states and 304297 transitions. [2019-09-10 08:23:56,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:23:56,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 188 [2019-09-10 08:23:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:56,692 INFO L225 Difference]: With dead ends: 226525 [2019-09-10 08:23:56,693 INFO L226 Difference]: Without dead ends: 226525 [2019-09-10 08:23:56,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:23:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226525 states. [2019-09-10 08:24:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226525 to 113107. [2019-09-10 08:24:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113107 states. [2019-09-10 08:24:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113107 states to 113107 states and 151659 transitions. [2019-09-10 08:24:00,893 INFO L78 Accepts]: Start accepts. Automaton has 113107 states and 151659 transitions. Word has length 188 [2019-09-10 08:24:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:00,893 INFO L475 AbstractCegarLoop]: Abstraction has 113107 states and 151659 transitions. [2019-09-10 08:24:00,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:24:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 113107 states and 151659 transitions. [2019-09-10 08:24:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 08:24:00,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:00,899 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:00,899 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:00,900 INFO L82 PathProgramCache]: Analyzing trace with hash -544074859, now seen corresponding path program 1 times [2019-09-10 08:24:00,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:00,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:24:01,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:01,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:01,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:01,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:01,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:01,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:01,017 INFO L87 Difference]: Start difference. First operand 113107 states and 151659 transitions. Second operand 3 states. [2019-09-10 08:24:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:01,281 INFO L93 Difference]: Finished difference Result 139515 states and 184304 transitions. [2019-09-10 08:24:01,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:01,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-10 08:24:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:01,434 INFO L225 Difference]: With dead ends: 139515 [2019-09-10 08:24:01,435 INFO L226 Difference]: Without dead ends: 139515 [2019-09-10 08:24:01,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139515 states. [2019-09-10 08:24:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139515 to 134153. [2019-09-10 08:24:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134153 states. [2019-09-10 08:24:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134153 states to 134153 states and 177871 transitions. [2019-09-10 08:24:03,177 INFO L78 Accepts]: Start accepts. Automaton has 134153 states and 177871 transitions. Word has length 188 [2019-09-10 08:24:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:03,177 INFO L475 AbstractCegarLoop]: Abstraction has 134153 states and 177871 transitions. [2019-09-10 08:24:03,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 134153 states and 177871 transitions. [2019-09-10 08:24:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 08:24:03,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:03,184 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:03,184 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:03,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:03,185 INFO L82 PathProgramCache]: Analyzing trace with hash 886141477, now seen corresponding path program 1 times [2019-09-10 08:24:03,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:03,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:03,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:03,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:03,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:03,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:24:03,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:24:03,625 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2019-09-10 08:24:03,627 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7183], [7185], [7188], [7192], [7194], [7199], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8956], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9212], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9256], [9258], [9260], [9263], [9278], [9280], [9282], [9285], [9300], [9302], [9304], [9307], [9322], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9376], [9379], [9382], [9390], [9392], [9395], [9398], [9406], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:24:03,632 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:24:03,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:24:03,914 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:24:08,543 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:24:08,543 INFO L272 AbstractInterpreter]: Visited 176 different actions 1260 times. Merged at 65 different actions 947 times. Widened at 31 different actions 149 times. Performed 5444 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5444 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 138 fixpoints after 24 different actions. Largest state had 793 variables. [2019-09-10 08:24:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:08,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:24:08,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:24:08,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:24:08,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:08,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:24:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:09,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 4189 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:24:09,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:24:09,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:09,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:09,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:09,610 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:24:09,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:09,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:09,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:09,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:09,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:13,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:24:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:13,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:24:13,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 08:24:13,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:24:13,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:24:13,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:24:13,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:24:13,341 INFO L87 Difference]: Start difference. First operand 134153 states and 177871 transitions. Second operand 21 states. [2019-09-10 08:24:15,747 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:24:16,028 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:24:16,764 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:24:17,395 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:24:17,582 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:18,003 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:24:18,308 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:18,457 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:24:18,620 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:24:18,904 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:24:19,309 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:24:19,493 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:24:19,658 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:24:19,804 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:24:20,141 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-09-10 08:24:20,343 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:24:20,542 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:24:20,717 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:24:22,301 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:22,478 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:23,133 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:23,451 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:24:23,636 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:24:23,798 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:24:23,980 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:24:24,154 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:24:24,317 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:24:24,475 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:24:25,154 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:25,381 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:24:25,837 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:24:25,996 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:24:26,214 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:24:26,395 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:24:26,550 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:26,743 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:24:26,897 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:27,063 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 08:24:27,198 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:24:27,733 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:24:28,020 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:24:28,366 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:24:28,576 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:28,782 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:24:28,944 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:24:29,131 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:24:29,311 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:24:29,496 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:29,696 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:24:29,873 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:24:30,019 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:30,189 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:24:30,939 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:24:31,114 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:24:31,299 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:24:31,770 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:31,926 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:24:32,146 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:24:32,313 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:24:32,479 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:24:32,674 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:24:32,848 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:24:32,994 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:24:33,193 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:24:34,011 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:24:34,166 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:24:34,487 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:24:34,646 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:34,846 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:35,038 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:24:35,367 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:24:35,521 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:24:35,666 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:24:36,018 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:24:36,424 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:24:36,571 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:24:36,873 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:24:37,696 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:39,509 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:39,679 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:40,239 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:40,424 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:40,590 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:24:40,744 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:24:41,087 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:41,234 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:41,649 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:24:41,834 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:24:41,997 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:24:42,221 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:24:42,390 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:24:42,598 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:24:42,779 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:24:43,193 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:24:43,809 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:24:43,984 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:24:44,309 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:24:44,501 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:24:44,701 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:24:44,886 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:24:45,061 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:24:45,541 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:24:45,741 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:24:45,902 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:24:46,061 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:24:46,252 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:24:46,443 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:24:46,599 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:24:46,757 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:24:46,944 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:24:47,141 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:24:47,287 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:24:47,442 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:24:47,719 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:24:47,878 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:24:48,191 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:24:48,346 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:24:48,501 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:24:48,680 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:24:48,942 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:24:49,230 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:24:49,645 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:24:49,848 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:24:50,137 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 08:24:50,306 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 08:24:50,487 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:24:50,716 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:24:50,933 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:24:51,233 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 08:24:51,412 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 08:24:51,598 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:24:51,791 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:51,969 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:24:52,137 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:24:52,296 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:24:52,449 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:24:52,625 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:52,800 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:53,001 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:24:53,208 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:24:53,360 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:24:53,535 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:24:53,705 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:24:53,911 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:24:54,076 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:24:54,283 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:24:54,428 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:24:54,605 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:24:54,746 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:24:54,958 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:24:55,125 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:24:55,316 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:24:55,612 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:24:55,911 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:24:56,150 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:24:56,310 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:24:56,482 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-10 08:24:57,037 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:57,235 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:57,399 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:24:57,560 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:24:57,732 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:24:57,921 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:24:58,075 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:24:58,268 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:24:58,478 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:58,668 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:24:58,809 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:24:58,972 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:24:59,138 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:24:59,302 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:24:59,470 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:24:59,624 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:24:59,796 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:25:00,223 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:25:00,386 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:25:00,541 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:25:00,957 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:25:01,580 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:25:02,066 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:25:02,214 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:25:02,370 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:25:02,881 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:25:03,094 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:25:03,262 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:25:03,458 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:25:03,674 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:25:03,872 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 08:25:04,038 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:25:04,210 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:25:04,391 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:25:04,548 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:25:04,704 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:25:05,295 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:25:05,461 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:25:05,776 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:25:06,123 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:25:06,459 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:25:07,236 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:25:07,544 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:25:07,715 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 08:25:08,087 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:25:08,280 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:25:08,871 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:25:09,023 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 08:25:09,694 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:25:09,873 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:25:12,342 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:25:12,552 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:25:13,168 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:25:13,336 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:25:13,506 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:25:13,688 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:25:13,839 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:25:13,990 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:25:14,197 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:25:14,363 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:25:14,574 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:25:14,760 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:25:14,963 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:25:15,147 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 08:25:15,353 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:25:15,666 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:25:16,000 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:25:16,161 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 08:25:16,479 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:25:16,759 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:25:16,909 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:25:17,572 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:25:18,058 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:25:18,270 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:25:18,899 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:25:19,074 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:25:19,425 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:25:19,600 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-10 08:25:20,591 WARN L188 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:25:20,757 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 08:25:20,930 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:25:21,079 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-10 08:25:21,945 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:25:22,572 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:25:22,782 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:25:22,955 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 08:25:23,151 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:25:23,344 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 08:25:23,527 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:25:23,784 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:25:24,032 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:25:24,598 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:25:24,973 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:25:25,144 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:25:25,401 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-09-10 08:25:25,607 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:25:25,780 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 08:25:26,540 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:25:26,706 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 08:25:27,141 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-09-10 08:25:27,878 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 08:25:28,195 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:25:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:52,794 INFO L93 Difference]: Finished difference Result 3340993 states and 4343153 transitions. [2019-09-10 08:25:52,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 415 states. [2019-09-10 08:25:52,795 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 189 [2019-09-10 08:25:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:00,318 INFO L225 Difference]: With dead ends: 3340993 [2019-09-10 08:26:00,318 INFO L226 Difference]: Without dead ends: 3340993 [2019-09-10 08:26:00,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 304 SyntacticMatches, 57 SemanticMatches, 441 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85189 ImplicationChecksByTransitivity, 66.7s TimeCoverageRelationStatistics Valid=22847, Invalid=172959, Unknown=0, NotChecked=0, Total=195806 [2019-09-10 08:26:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340993 states. [2019-09-10 08:26:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340993 to 656656. [2019-09-10 08:26:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656656 states. [2019-09-10 08:26:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656656 states to 656656 states and 865502 transitions. [2019-09-10 08:26:44,392 INFO L78 Accepts]: Start accepts. Automaton has 656656 states and 865502 transitions. Word has length 189 [2019-09-10 08:26:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:44,392 INFO L475 AbstractCegarLoop]: Abstraction has 656656 states and 865502 transitions. [2019-09-10 08:26:44,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:26:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 656656 states and 865502 transitions. [2019-09-10 08:26:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 08:26:44,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:44,435 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:44,436 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1539375448, now seen corresponding path program 1 times [2019-09-10 08:26:44,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:44,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:44,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:44,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:44,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 08:26:44,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:44,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:44,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:44,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:44,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:44,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:44,654 INFO L87 Difference]: Start difference. First operand 656656 states and 865502 transitions. Second operand 9 states. [2019-09-10 08:26:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:57,366 INFO L93 Difference]: Finished difference Result 1329246 states and 1746919 transitions. [2019-09-10 08:26:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:26:57,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2019-09-10 08:26:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:00,287 INFO L225 Difference]: With dead ends: 1329246 [2019-09-10 08:27:00,287 INFO L226 Difference]: Without dead ends: 1329246 [2019-09-10 08:27:00,288 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 08:27:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329246 states. [2019-09-10 08:27:19,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329246 to 656656. [2019-09-10 08:27:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656656 states. [2019-09-10 08:27:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656656 states to 656656 states and 865498 transitions. [2019-09-10 08:27:21,142 INFO L78 Accepts]: Start accepts. Automaton has 656656 states and 865498 transitions. Word has length 190 [2019-09-10 08:27:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:21,142 INFO L475 AbstractCegarLoop]: Abstraction has 656656 states and 865498 transitions. [2019-09-10 08:27:21,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 656656 states and 865498 transitions. [2019-09-10 08:27:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 08:27:21,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:21,184 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:21,184 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1884381843, now seen corresponding path program 1 times [2019-09-10 08:27:21,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:21,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:21,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:21,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:21,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:21,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:27:21,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:27:21,586 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2019-09-10 08:27:21,586 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [206], [209], [212], [215], [337], [341], [378], [381], [384], [387], [488], [492], [5024], [5027], [5030], [5033], [5111], [5115], [7175], [7177], [7180], [7185], [7188], [7192], [7205], [7207], [7299], [7302], [7305], [7308], [7367], [7371], [8293], [8296], [8297], [8299], [8392], [8395], [8398], [8401], [8443], [8447], [8825], [8919], [8922], [8925], [8928], [8954], [8958], [9172], [9175], [9179], [9182], [9185], [9189], [9191], [9194], [9197], [9200], [9205], [9208], [9214], [9216], [9219], [9234], [9236], [9238], [9241], [9256], [9258], [9260], [9263], [9278], [9280], [9282], [9285], [9288], [9293], [9296], [9302], [9304], [9307], [9322], [9324], [9326], [9328], [9331], [9334], [9342], [9344], [9347], [9350], [9358], [9360], [9363], [9366], [9374], [9376], [9379], [9382], [9390], [9392], [9395], [9398], [9406], [9408], [9411], [9414], [9422], [9481], [9482], [9486], [9487], [9488] [2019-09-10 08:27:21,590 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:27:21,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:27:30,721 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:27:32,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:27:32,083 INFO L272 AbstractInterpreter]: Visited 180 different actions 1072 times. Merged at 67 different actions 784 times. Widened at 29 different actions 152 times. Performed 4742 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4742 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 92 fixpoints after 24 different actions. Largest state had 793 variables. [2019-09-10 08:27:32,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:32,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:27:32,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:27:32,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:27:32,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:32,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:27:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:32,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 4196 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 08:27:32,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:27:32,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:27:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:33,568 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:27:33,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:27:34,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:27:34,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:27:34,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:27:56,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:27:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:56,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:27:56,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2019-09-10 08:27:56,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:27:56,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:27:56,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:27:56,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=427, Unknown=1, NotChecked=0, Total=506 [2019-09-10 08:27:56,857 INFO L87 Difference]: Start difference. First operand 656656 states and 865498 transitions. Second operand 18 states. [2019-09-10 08:28:15,445 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-09-10 08:28:17,090 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 08:28:17,778 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-09-10 08:28:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:39,472 INFO L93 Difference]: Finished difference Result 3673308 states and 4803339 transitions. [2019-09-10 08:28:39,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 08:28:39,473 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 192 [2019-09-10 08:28:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted.