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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:49:59,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:49:59,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:49:59,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:49:59,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:49:59,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:49:59,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:49:59,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:49:59,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:49:59,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:49:59,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:49:59,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:49:59,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:49:59,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:49:59,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:49:59,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:49:59,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:49:59,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:49:59,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:49:59,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:49:59,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:49:59,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:49:59,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:49:59,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:49:59,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:49:59,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:49:59,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:49:59,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:49:59,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:49:59,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:49:59,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:49:59,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:49:59,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:49:59,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:49:59,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:49:59,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:49:59,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:49:59,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:49:59,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:49:59,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:49:59,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:49:59,538 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:49:59,564 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:49:59,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:49:59,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:49:59,565 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:49:59,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:49:59,566 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:49:59,566 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:49:59,566 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:49:59,567 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:49:59,567 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:49:59,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:49:59,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:49:59,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:49:59,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:49:59,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:49:59,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:49:59,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:49:59,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:49:59,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:49:59,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:49:59,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:49:59,570 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:49:59,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:49:59,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:49:59,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:49:59,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:49:59,571 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:49:59,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:49:59,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:49:59,571 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:49:59,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:49:59,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:49:59,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:49:59,617 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:49:59,618 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:49:59,619 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:49:59,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5a1c62c/72288cc1b6334e4f998db2ac86c79b8b/FLAG06b0509e1 [2019-09-10 08:50:00,270 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:50:00,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:50:00,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5a1c62c/72288cc1b6334e4f998db2ac86c79b8b/FLAG06b0509e1 [2019-09-10 08:50:00,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5a1c62c/72288cc1b6334e4f998db2ac86c79b8b [2019-09-10 08:50:00,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:50:00,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:50:00,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:50:00,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:50:00,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:50:00,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:50:00" (1/1) ... [2019-09-10 08:50:00,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2cf39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:00, skipping insertion in model container [2019-09-10 08:50:00,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:50:00" (1/1) ... [2019-09-10 08:50:00,558 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:50:00,632 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:50:01,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:50:01,233 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:50:01,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:50:01,614 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:50:01,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01 WrapperNode [2019-09-10 08:50:01,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:50:01,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:50:01,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:50:01,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:50:01,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01" (1/1) ... [2019-09-10 08:50:01,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01" (1/1) ... [2019-09-10 08:50:01,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01" (1/1) ... [2019-09-10 08:50:01,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01" (1/1) ... [2019-09-10 08:50:01,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01" (1/1) ... [2019-09-10 08:50:01,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01" (1/1) ... [2019-09-10 08:50:01,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01" (1/1) ... [2019-09-10 08:50:01,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:50:01,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:50:01,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:50:01,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:50:01,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01" (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:50:01,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:50:01,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:50:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:50:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:50:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:50:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:50:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:50:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:50:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:50:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:50:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:50:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:50:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:50:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:50:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:50:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:50:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:50:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:50:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:50:03,428 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:50:03,429 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:50:03,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:50:03 BoogieIcfgContainer [2019-09-10 08:50:03,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:50:03,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:50:03,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:50:03,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:50:03,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:50:00" (1/3) ... [2019-09-10 08:50:03,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1bbfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:50:03, skipping insertion in model container [2019-09-10 08:50:03,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:01" (2/3) ... [2019-09-10 08:50:03,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1bbfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:50:03, skipping insertion in model container [2019-09-10 08:50:03,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:50:03" (3/3) ... [2019-09-10 08:50:03,440 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 08:50:03,451 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:50:03,477 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:50:03,497 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:50:03,534 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:50:03,534 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:50:03,534 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:50:03,534 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:50:03,534 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:50:03,535 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:50:03,535 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:50:03,535 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:50:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states. [2019-09-10 08:50:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:50:03,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:03,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:03,623 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash -35123060, now seen corresponding path program 1 times [2019-09-10 08:50:03,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:03,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:03,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:04,254 INFO L134 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:50:04,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:04,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:04,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:04,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:04,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:04,281 INFO L87 Difference]: Start difference. First operand 347 states. Second operand 3 states. [2019-09-10 08:50:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:04,431 INFO L93 Difference]: Finished difference Result 485 states and 839 transitions. [2019-09-10 08:50:04,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:04,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:50:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:04,453 INFO L225 Difference]: With dead ends: 485 [2019-09-10 08:50:04,453 INFO L226 Difference]: Without dead ends: 477 [2019-09-10 08:50:04,457 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:50:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-10 08:50:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2019-09-10 08:50:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-10 08:50:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 783 transitions. [2019-09-10 08:50:04,534 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 783 transitions. Word has length 122 [2019-09-10 08:50:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:04,535 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 783 transitions. [2019-09-10 08:50:04,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 783 transitions. [2019-09-10 08:50:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:50:04,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:04,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:04,542 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:04,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:04,542 INFO L82 PathProgramCache]: Analyzing trace with hash 993718675, now seen corresponding path program 1 times [2019-09-10 08:50:04,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:04,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:04,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:04,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:04,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:50:04,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:04,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:04,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:04,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:04,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:04,775 INFO L87 Difference]: Start difference. First operand 475 states and 783 transitions. Second operand 3 states. [2019-09-10 08:50:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:04,821 INFO L93 Difference]: Finished difference Result 733 states and 1211 transitions. [2019-09-10 08:50:04,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:04,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:50:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:04,830 INFO L225 Difference]: With dead ends: 733 [2019-09-10 08:50:04,830 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 08:50:04,831 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:50:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 08:50:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2019-09-10 08:50:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-10 08:50:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1210 transitions. [2019-09-10 08:50:04,868 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1210 transitions. Word has length 125 [2019-09-10 08:50:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:04,870 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1210 transitions. [2019-09-10 08:50:04,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1210 transitions. [2019-09-10 08:50:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:50:04,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:04,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, 1, 1, 1, 1, 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:50:04,877 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1625513079, now seen corresponding path program 1 times [2019-09-10 08:50:04,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:04,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:04,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:04,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:04,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:05,158 INFO L134 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:50:05,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:05,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:05,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:05,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:05,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:05,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:05,164 INFO L87 Difference]: Start difference. First operand 731 states and 1210 transitions. Second operand 3 states. [2019-09-10 08:50:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:05,216 INFO L93 Difference]: Finished difference Result 1225 states and 2027 transitions. [2019-09-10 08:50:05,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:05,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 08:50:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:05,232 INFO L225 Difference]: With dead ends: 1225 [2019-09-10 08:50:05,233 INFO L226 Difference]: Without dead ends: 1225 [2019-09-10 08:50:05,233 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:50:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-10 08:50:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2019-09-10 08:50:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-09-10 08:50:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2026 transitions. [2019-09-10 08:50:05,289 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2026 transitions. Word has length 128 [2019-09-10 08:50:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:05,291 INFO L475 AbstractCegarLoop]: Abstraction has 1223 states and 2026 transitions. [2019-09-10 08:50:05,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2026 transitions. [2019-09-10 08:50:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:50:05,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:05,298 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,299 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash 649173988, now seen corresponding path program 1 times [2019-09-10 08:50:05,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:05,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:05,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:05,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:05,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:05,645 INFO L134 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:50:05,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:05,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:05,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:05,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:05,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:05,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:05,649 INFO L87 Difference]: Start difference. First operand 1223 states and 2026 transitions. Second operand 3 states. [2019-09-10 08:50:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:05,712 INFO L93 Difference]: Finished difference Result 2169 states and 3583 transitions. [2019-09-10 08:50:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:05,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 08:50:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:05,728 INFO L225 Difference]: With dead ends: 2169 [2019-09-10 08:50:05,729 INFO L226 Difference]: Without dead ends: 2169 [2019-09-10 08:50:05,729 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:50:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-09-10 08:50:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2167. [2019-09-10 08:50:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-09-10 08:50:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3582 transitions. [2019-09-10 08:50:05,792 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3582 transitions. Word has length 131 [2019-09-10 08:50:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:05,793 INFO L475 AbstractCegarLoop]: Abstraction has 2167 states and 3582 transitions. [2019-09-10 08:50:05,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3582 transitions. [2019-09-10 08:50:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:50:05,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:05,801 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,801 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:05,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1855611538, now seen corresponding path program 1 times [2019-09-10 08:50:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:05,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:05,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:06,103 INFO L134 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:50:06,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:06,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:50:06,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:06,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:50:06,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:50:06,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:50:06,105 INFO L87 Difference]: Start difference. First operand 2167 states and 3582 transitions. Second operand 6 states. [2019-09-10 08:50:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:06,486 INFO L93 Difference]: Finished difference Result 6263 states and 10406 transitions. [2019-09-10 08:50:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:50:06,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 08:50:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:06,525 INFO L225 Difference]: With dead ends: 6263 [2019-09-10 08:50:06,525 INFO L226 Difference]: Without dead ends: 6263 [2019-09-10 08:50:06,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:50:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2019-09-10 08:50:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 4929. [2019-09-10 08:50:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4929 states. [2019-09-10 08:50:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 8167 transitions. [2019-09-10 08:50:06,711 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 8167 transitions. Word has length 134 [2019-09-10 08:50:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:06,711 INFO L475 AbstractCegarLoop]: Abstraction has 4929 states and 8167 transitions. [2019-09-10 08:50:06,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:50:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 8167 transitions. [2019-09-10 08:50:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:50:06,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:06,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:06,716 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:06,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1755551114, now seen corresponding path program 1 times [2019-09-10 08:50:06,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:06,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:06,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:06,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:06,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:06,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:50:06,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:06,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:06,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:06,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:06,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:06,928 INFO L87 Difference]: Start difference. First operand 4929 states and 8167 transitions. Second operand 4 states. [2019-09-10 08:50:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:07,111 INFO L93 Difference]: Finished difference Result 8327 states and 13848 transitions. [2019-09-10 08:50:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:07,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 08:50:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:07,165 INFO L225 Difference]: With dead ends: 8327 [2019-09-10 08:50:07,166 INFO L226 Difference]: Without dead ends: 8327 [2019-09-10 08:50:07,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-09-10 08:50:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7273. [2019-09-10 08:50:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-10 08:50:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 12070 transitions. [2019-09-10 08:50:07,606 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 12070 transitions. Word has length 135 [2019-09-10 08:50:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:07,607 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 12070 transitions. [2019-09-10 08:50:07,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 12070 transitions. [2019-09-10 08:50:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:50:07,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:07,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:07,619 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:07,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1365624242, now seen corresponding path program 1 times [2019-09-10 08:50:07,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:07,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:07,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:07,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:07,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:07,732 INFO L134 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:50:07,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:07,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:07,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:07,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:07,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:07,735 INFO L87 Difference]: Start difference. First operand 7273 states and 12070 transitions. Second operand 3 states. [2019-09-10 08:50:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:07,811 INFO L93 Difference]: Finished difference Result 11099 states and 18426 transitions. [2019-09-10 08:50:07,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:07,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:50:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:07,872 INFO L225 Difference]: With dead ends: 11099 [2019-09-10 08:50:07,873 INFO L226 Difference]: Without dead ends: 11099 [2019-09-10 08:50:07,873 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:50:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11099 states. [2019-09-10 08:50:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11099 to 11097. [2019-09-10 08:50:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11097 states. [2019-09-10 08:50:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11097 states to 11097 states and 18425 transitions. [2019-09-10 08:50:08,097 INFO L78 Accepts]: Start accepts. Automaton has 11097 states and 18425 transitions. Word has length 136 [2019-09-10 08:50:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:08,098 INFO L475 AbstractCegarLoop]: Abstraction has 11097 states and 18425 transitions. [2019-09-10 08:50:08,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 11097 states and 18425 transitions. [2019-09-10 08:50:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:50:08,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:08,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,105 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1188137794, now seen corresponding path program 1 times [2019-09-10 08:50:08,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:08,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:08,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:08,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:08,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:08,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:08,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:08,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:08,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:08,298 INFO L87 Difference]: Start difference. First operand 11097 states and 18425 transitions. Second operand 3 states. [2019-09-10 08:50:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:08,512 INFO L93 Difference]: Finished difference Result 15670 states and 25957 transitions. [2019-09-10 08:50:08,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:08,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:50:08,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:08,555 INFO L225 Difference]: With dead ends: 15670 [2019-09-10 08:50:08,555 INFO L226 Difference]: Without dead ends: 15670 [2019-09-10 08:50:08,556 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:50:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15670 states. [2019-09-10 08:50:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15670 to 15668. [2019-09-10 08:50:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15668 states. [2019-09-10 08:50:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 25956 transitions. [2019-09-10 08:50:08,866 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 25956 transitions. Word has length 136 [2019-09-10 08:50:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:08,866 INFO L475 AbstractCegarLoop]: Abstraction has 15668 states and 25956 transitions. [2019-09-10 08:50:08,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 25956 transitions. [2019-09-10 08:50:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:50:08,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:08,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,869 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:08,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1350880053, now seen corresponding path program 1 times [2019-09-10 08:50:08,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:08,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:08,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:08,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:08,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:09,067 INFO L134 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:50:09,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:09,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:09,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:09,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:09,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:09,069 INFO L87 Difference]: Start difference. First operand 15668 states and 25956 transitions. Second operand 4 states. [2019-09-10 08:50:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:09,296 INFO L93 Difference]: Finished difference Result 26712 states and 44251 transitions. [2019-09-10 08:50:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:09,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 08:50:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:09,387 INFO L225 Difference]: With dead ends: 26712 [2019-09-10 08:50:09,388 INFO L226 Difference]: Without dead ends: 26712 [2019-09-10 08:50:09,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26712 states. [2019-09-10 08:50:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26712 to 23307. [2019-09-10 08:50:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23307 states. [2019-09-10 08:50:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23307 states to 23307 states and 38542 transitions. [2019-09-10 08:50:10,449 INFO L78 Accepts]: Start accepts. Automaton has 23307 states and 38542 transitions. Word has length 136 [2019-09-10 08:50:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:10,449 INFO L475 AbstractCegarLoop]: Abstraction has 23307 states and 38542 transitions. [2019-09-10 08:50:10,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 23307 states and 38542 transitions. [2019-09-10 08:50:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:50:10,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:10,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:10,452 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash -788578752, now seen corresponding path program 1 times [2019-09-10 08:50:10,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:10,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:10,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:10,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:10,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:10,554 INFO L134 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:50:10,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:10,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:10,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:10,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:10,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:10,556 INFO L87 Difference]: Start difference. First operand 23307 states and 38542 transitions. Second operand 3 states. [2019-09-10 08:50:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:10,688 INFO L93 Difference]: Finished difference Result 33980 states and 56028 transitions. [2019-09-10 08:50:10,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:10,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:50:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:10,762 INFO L225 Difference]: With dead ends: 33980 [2019-09-10 08:50:10,762 INFO L226 Difference]: Without dead ends: 33980 [2019-09-10 08:50:10,763 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:50:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33980 states. [2019-09-10 08:50:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33980 to 33978. [2019-09-10 08:50:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33978 states. [2019-09-10 08:50:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33978 states to 33978 states and 56027 transitions. [2019-09-10 08:50:11,399 INFO L78 Accepts]: Start accepts. Automaton has 33978 states and 56027 transitions. Word has length 136 [2019-09-10 08:50:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:11,400 INFO L475 AbstractCegarLoop]: Abstraction has 33978 states and 56027 transitions. [2019-09-10 08:50:11,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 33978 states and 56027 transitions. [2019-09-10 08:50:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:50:11,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:11,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:11,402 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash -783429068, now seen corresponding path program 1 times [2019-09-10 08:50:11,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:11,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:11,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:11,503 INFO L134 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:50:11,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:11,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:11,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:11,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:11,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:11,505 INFO L87 Difference]: Start difference. First operand 33978 states and 56027 transitions. Second operand 3 states. [2019-09-10 08:50:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:11,713 INFO L93 Difference]: Finished difference Result 50517 states and 82988 transitions. [2019-09-10 08:50:11,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:11,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-10 08:50:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:11,821 INFO L225 Difference]: With dead ends: 50517 [2019-09-10 08:50:11,822 INFO L226 Difference]: Without dead ends: 50517 [2019-09-10 08:50:11,822 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:50:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50517 states. [2019-09-10 08:50:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50517 to 50515. [2019-09-10 08:50:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50515 states. [2019-09-10 08:50:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50515 states to 50515 states and 82987 transitions. [2019-09-10 08:50:13,439 INFO L78 Accepts]: Start accepts. Automaton has 50515 states and 82987 transitions. Word has length 136 [2019-09-10 08:50:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:13,439 INFO L475 AbstractCegarLoop]: Abstraction has 50515 states and 82987 transitions. [2019-09-10 08:50:13,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 50515 states and 82987 transitions. [2019-09-10 08:50:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:50:13,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:13,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:13,442 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1129443555, now seen corresponding path program 1 times [2019-09-10 08:50:13,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:13,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:13,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:13,940 INFO L134 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:50:13,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:13,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:50:13,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:13,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:50:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:50:13,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:50:13,944 INFO L87 Difference]: Start difference. First operand 50515 states and 82987 transitions. Second operand 7 states. [2019-09-10 08:50:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:15,116 INFO L93 Difference]: Finished difference Result 185545 states and 303013 transitions. [2019-09-10 08:50:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:50:15,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-10 08:50:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:15,466 INFO L225 Difference]: With dead ends: 185545 [2019-09-10 08:50:15,466 INFO L226 Difference]: Without dead ends: 185545 [2019-09-10 08:50:15,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:50:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185545 states. [2019-09-10 08:50:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185545 to 140538. [2019-09-10 08:50:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140538 states. [2019-09-10 08:50:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140538 states to 140538 states and 228866 transitions. [2019-09-10 08:50:19,139 INFO L78 Accepts]: Start accepts. Automaton has 140538 states and 228866 transitions. Word has length 137 [2019-09-10 08:50:19,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:19,140 INFO L475 AbstractCegarLoop]: Abstraction has 140538 states and 228866 transitions. [2019-09-10 08:50:19,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:50:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 140538 states and 228866 transitions. [2019-09-10 08:50:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:50:19,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:19,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:19,142 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -705506052, now seen corresponding path program 1 times [2019-09-10 08:50:19,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:19,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:19,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:19,253 INFO L134 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:50:19,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:19,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:19,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:19,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:19,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:19,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:19,255 INFO L87 Difference]: Start difference. First operand 140538 states and 228866 transitions. Second operand 4 states. [2019-09-10 08:50:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:22,165 INFO L93 Difference]: Finished difference Result 274270 states and 446077 transitions. [2019-09-10 08:50:22,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:22,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 08:50:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:22,678 INFO L225 Difference]: With dead ends: 274270 [2019-09-10 08:50:22,678 INFO L226 Difference]: Without dead ends: 274270 [2019-09-10 08:50:22,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274270 states. [2019-09-10 08:50:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274270 to 206995. [2019-09-10 08:50:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206995 states. [2019-09-10 08:50:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206995 states to 206995 states and 336271 transitions. [2019-09-10 08:50:26,304 INFO L78 Accepts]: Start accepts. Automaton has 206995 states and 336271 transitions. Word has length 138 [2019-09-10 08:50:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:26,304 INFO L475 AbstractCegarLoop]: Abstraction has 206995 states and 336271 transitions. [2019-09-10 08:50:26,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 206995 states and 336271 transitions. [2019-09-10 08:50:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 08:50:26,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:26,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:26,306 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:26,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:26,307 INFO L82 PathProgramCache]: Analyzing trace with hash -876112340, now seen corresponding path program 1 times [2019-09-10 08:50:26,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:26,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:26,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:29,956 INFO L134 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:50:29,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:29,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:50:29,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:29,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:50:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:50:29,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:50:29,958 INFO L87 Difference]: Start difference. First operand 206995 states and 336271 transitions. Second operand 6 states. [2019-09-10 08:50:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:30,856 INFO L93 Difference]: Finished difference Result 298865 states and 485662 transitions. [2019-09-10 08:50:30,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:50:30,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 08:50:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:31,371 INFO L225 Difference]: With dead ends: 298865 [2019-09-10 08:50:31,372 INFO L226 Difference]: Without dead ends: 298865 [2019-09-10 08:50:31,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:50:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298865 states. [2019-09-10 08:50:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298865 to 236155. [2019-09-10 08:50:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236155 states. [2019-09-10 08:50:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236155 states to 236155 states and 382876 transitions. [2019-09-10 08:50:37,884 INFO L78 Accepts]: Start accepts. Automaton has 236155 states and 382876 transitions. Word has length 140 [2019-09-10 08:50:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:37,884 INFO L475 AbstractCegarLoop]: Abstraction has 236155 states and 382876 transitions. [2019-09-10 08:50:37,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:50:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 236155 states and 382876 transitions. [2019-09-10 08:50:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:50:37,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:37,886 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:37,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1795769074, now seen corresponding path program 1 times [2019-09-10 08:50:37,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:37,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:37,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:37,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:37,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:39,044 INFO L134 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:50:39,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:39,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:50:39,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:39,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:50:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:50:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:50:39,046 INFO L87 Difference]: Start difference. First operand 236155 states and 382876 transitions. Second operand 6 states. [2019-09-10 08:50:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:40,345 INFO L93 Difference]: Finished difference Result 458673 states and 744378 transitions. [2019-09-10 08:50:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:50:40,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 08:50:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:41,178 INFO L225 Difference]: With dead ends: 458673 [2019-09-10 08:50:41,178 INFO L226 Difference]: Without dead ends: 458673 [2019-09-10 08:50:41,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:50:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458673 states. [2019-09-10 08:50:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458673 to 420187. [2019-09-10 08:50:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420187 states. [2019-09-10 08:50:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420187 states to 420187 states and 680963 transitions. [2019-09-10 08:50:52,466 INFO L78 Accepts]: Start accepts. Automaton has 420187 states and 680963 transitions. Word has length 143 [2019-09-10 08:50:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:52,467 INFO L475 AbstractCegarLoop]: Abstraction has 420187 states and 680963 transitions. [2019-09-10 08:50:52,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:50:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 420187 states and 680963 transitions. [2019-09-10 08:50:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:50:52,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:52,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:52,469 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:52,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:52,469 INFO L82 PathProgramCache]: Analyzing trace with hash 163824457, now seen corresponding path program 1 times [2019-09-10 08:50:52,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:52,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:52,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:52,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:52,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:52,647 INFO L134 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:50:52,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:52,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:50:52,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:52,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:50:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:50:52,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:52,651 INFO L87 Difference]: Start difference. First operand 420187 states and 680963 transitions. Second operand 5 states. [2019-09-10 08:51:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:02,030 INFO L93 Difference]: Finished difference Result 704201 states and 1133907 transitions. [2019-09-10 08:51:02,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:51:02,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 08:51:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:03,304 INFO L225 Difference]: With dead ends: 704201 [2019-09-10 08:51:03,304 INFO L226 Difference]: Without dead ends: 704201 [2019-09-10 08:51:03,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:51:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704201 states. [2019-09-10 08:51:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704201 to 426099. [2019-09-10 08:51:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426099 states. [2019-09-10 08:51:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426099 states to 426099 states and 686830 transitions. [2019-09-10 08:51:12,874 INFO L78 Accepts]: Start accepts. Automaton has 426099 states and 686830 transitions. Word has length 144 [2019-09-10 08:51:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:12,874 INFO L475 AbstractCegarLoop]: Abstraction has 426099 states and 686830 transitions. [2019-09-10 08:51:12,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:51:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 426099 states and 686830 transitions. [2019-09-10 08:51:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:51:12,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:12,885 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2019-09-10 08:51:12,885 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash 537249617, now seen corresponding path program 1 times [2019-09-10 08:51:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:12,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:12,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:51:13,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:13,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:13,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:13,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:13,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:13,042 INFO L87 Difference]: Start difference. First operand 426099 states and 686830 transitions. Second operand 3 states. [2019-09-10 08:51:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:14,235 INFO L93 Difference]: Finished difference Result 358126 states and 575876 transitions. [2019-09-10 08:51:14,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:14,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-10 08:51:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:14,760 INFO L225 Difference]: With dead ends: 358126 [2019-09-10 08:51:14,760 INFO L226 Difference]: Without dead ends: 358126 [2019-09-10 08:51:14,761 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:51:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358126 states. [2019-09-10 08:51:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358126 to 357295. [2019-09-10 08:51:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357295 states. [2019-09-10 08:51:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357295 states to 357295 states and 574614 transitions. [2019-09-10 08:51:25,319 INFO L78 Accepts]: Start accepts. Automaton has 357295 states and 574614 transitions. Word has length 178 [2019-09-10 08:51:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:25,319 INFO L475 AbstractCegarLoop]: Abstraction has 357295 states and 574614 transitions. [2019-09-10 08:51:25,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 357295 states and 574614 transitions. [2019-09-10 08:51:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 08:51:25,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:25,326 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2019-09-10 08:51:25,326 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:25,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1114295107, now seen corresponding path program 1 times [2019-09-10 08:51:25,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:25,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:25,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:25,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:25,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 08:51:26,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:26,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:26,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:26,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:26,716 INFO L87 Difference]: Start difference. First operand 357295 states and 574614 transitions. Second operand 4 states. [2019-09-10 08:51:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:28,264 INFO L93 Difference]: Finished difference Result 672275 states and 1077871 transitions. [2019-09-10 08:51:28,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:51:28,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-10 08:51:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:36,146 INFO L225 Difference]: With dead ends: 672275 [2019-09-10 08:51:36,146 INFO L226 Difference]: Without dead ends: 672275 [2019-09-10 08:51:36,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:51:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672275 states. [2019-09-10 08:51:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672275 to 578438. [2019-09-10 08:51:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578438 states. [2019-09-10 08:51:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578438 states to 578438 states and 929380 transitions. [2019-09-10 08:51:44,449 INFO L78 Accepts]: Start accepts. Automaton has 578438 states and 929380 transitions. Word has length 178 [2019-09-10 08:51:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:44,449 INFO L475 AbstractCegarLoop]: Abstraction has 578438 states and 929380 transitions. [2019-09-10 08:51:44,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 578438 states and 929380 transitions. [2019-09-10 08:51:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:51:44,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:44,454 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] [2019-09-10 08:51:44,454 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 549360595, now seen corresponding path program 1 times [2019-09-10 08:51:44,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:44,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:44,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:51:44,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:44,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:51:44,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:44,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:51:44,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:51:44,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:51:44,691 INFO L87 Difference]: Start difference. First operand 578438 states and 929380 transitions. Second operand 6 states. [2019-09-10 08:51:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:57,973 INFO L93 Difference]: Finished difference Result 787737 states and 1268980 transitions. [2019-09-10 08:51:57,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:51:57,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-10 08:51:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:59,302 INFO L225 Difference]: With dead ends: 787737 [2019-09-10 08:51:59,303 INFO L226 Difference]: Without dead ends: 787737 [2019-09-10 08:51:59,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:51:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787737 states. [2019-09-10 08:52:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787737 to 656046. [2019-09-10 08:52:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656046 states. [2019-09-10 08:52:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656046 states to 656046 states and 1054743 transitions. [2019-09-10 08:52:08,695 INFO L78 Accepts]: Start accepts. Automaton has 656046 states and 1054743 transitions. Word has length 179 [2019-09-10 08:52:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:08,695 INFO L475 AbstractCegarLoop]: Abstraction has 656046 states and 1054743 transitions. [2019-09-10 08:52:08,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:52:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 656046 states and 1054743 transitions. [2019-09-10 08:52:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:52:08,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:08,700 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] [2019-09-10 08:52:08,701 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:08,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1888394913, now seen corresponding path program 1 times [2019-09-10 08:52:08,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:08,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:08,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:52:08,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:08,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:52:08,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:08,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:52:08,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:52:08,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:52:08,888 INFO L87 Difference]: Start difference. First operand 656046 states and 1054743 transitions. Second operand 6 states. [2019-09-10 08:52:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:18,847 INFO L93 Difference]: Finished difference Result 796732 states and 1281917 transitions. [2019-09-10 08:52:18,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:52:18,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-10 08:52:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:19,906 INFO L225 Difference]: With dead ends: 796732 [2019-09-10 08:52:19,906 INFO L226 Difference]: Without dead ends: 796732 [2019-09-10 08:52:19,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:52:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796732 states. [2019-09-10 08:52:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796732 to 732426. [2019-09-10 08:52:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732426 states. [2019-09-10 08:52:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732426 states to 732426 states and 1177238 transitions. [2019-09-10 08:52:35,857 INFO L78 Accepts]: Start accepts. Automaton has 732426 states and 1177238 transitions. Word has length 179 [2019-09-10 08:52:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:35,858 INFO L475 AbstractCegarLoop]: Abstraction has 732426 states and 1177238 transitions. [2019-09-10 08:52:35,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:52:35,858 INFO L276 IsEmpty]: Start isEmpty. Operand 732426 states and 1177238 transitions. [2019-09-10 08:52:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 08:52:35,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:35,862 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] [2019-09-10 08:52:35,863 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:35,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:35,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1417541805, now seen corresponding path program 1 times [2019-09-10 08:52:35,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:35,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:35,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:35,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:35,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:35,993 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:52:35,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:35,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:35,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:35,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:35,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:35,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:35,995 INFO L87 Difference]: Start difference. First operand 732426 states and 1177238 transitions. Second operand 3 states. [2019-09-10 08:52:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:44,226 INFO L93 Difference]: Finished difference Result 300496 states and 483473 transitions. [2019-09-10 08:52:44,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:44,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-10 08:52:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:44,609 INFO L225 Difference]: With dead ends: 300496 [2019-09-10 08:52:44,609 INFO L226 Difference]: Without dead ends: 300496 [2019-09-10 08:52:44,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300496 states. [2019-09-10 08:52:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300496 to 300494. [2019-09-10 08:52:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300494 states. [2019-09-10 08:52:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300494 states to 300494 states and 483472 transitions. [2019-09-10 08:52:48,973 INFO L78 Accepts]: Start accepts. Automaton has 300494 states and 483472 transitions. Word has length 179 [2019-09-10 08:52:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:48,974 INFO L475 AbstractCegarLoop]: Abstraction has 300494 states and 483472 transitions. [2019-09-10 08:52:48,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 300494 states and 483472 transitions. [2019-09-10 08:52:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:52:48,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:48,976 INFO L399 BasicCegarLoop]: trace histogram [2, 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] [2019-09-10 08:52:48,977 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:48,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:48,977 INFO L82 PathProgramCache]: Analyzing trace with hash -215859023, now seen corresponding path program 1 times [2019-09-10 08:52:48,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:48,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:48,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:48,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:48,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:49,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:52:49,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:52:49,216 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2019-09-10 08:52:49,219 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [252], [255], [258], [261], [265], [268], [290], [293], [296], [298], [300], [335], [370], [373], [395], [403], [405], [408], [411], [414], [417], [420], [427], [435], [437], [440], [441], [443], [452], [455], [466], [469], [479], [485], [489], [493], [497], [499], [502], [548], [558], [568], [578], [598], [601], [647], [657], [667], [677], [697], [700], [746], [756], [766], [776], [786], [790], [794], [796], [799], [845], [855], [865], [875], [1504], [1505], [1509], [1510], [1511] [2019-09-10 08:52:49,300 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:52:49,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:52:49,515 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:52:50,150 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:52:50,154 INFO L272 AbstractInterpreter]: Visited 158 different actions 465 times. Merged at 54 different actions 285 times. Widened at 26 different actions 35 times. Performed 1681 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1681 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 6 different actions. Largest state had 297 variables. [2019-09-10 08:52:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:50,159 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:52:50,963 INFO L227 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 88.28% of their original sizes. [2019-09-10 08:52:50,963 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:53:30,421 INFO L420 sIntCurrentIteration]: We unified 179 AI predicates to 179 [2019-09-10 08:53:30,421 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:53:30,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:53:30,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [118] imperfect sequences [9] total 125 [2019-09-10 08:53:30,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:30,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-10 08:53:30,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-10 08:53:30,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1779, Invalid=12027, Unknown=0, NotChecked=0, Total=13806 [2019-09-10 08:53:30,429 INFO L87 Difference]: Start difference. First operand 300494 states and 483472 transitions. Second operand 118 states. [2019-09-10 08:57:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:07,112 INFO L93 Difference]: Finished difference Result 1438104 states and 2293620 transitions. [2019-09-10 08:57:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-10 08:57:07,112 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 180 [2019-09-10 08:57:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:10,158 INFO L225 Difference]: With dead ends: 1438104 [2019-09-10 08:57:10,159 INFO L226 Difference]: Without dead ends: 1438104 [2019-09-10 08:57:10,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16055 ImplicationChecksByTransitivity, 50.4s TimeCoverageRelationStatistics Valid=5759, Invalid=39823, Unknown=0, NotChecked=0, Total=45582 [2019-09-10 08:57:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438104 states. [2019-09-10 08:57:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438104 to 356295. [2019-09-10 08:57:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356295 states. [2019-09-10 08:57:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356295 states to 356295 states and 572592 transitions. [2019-09-10 08:57:31,493 INFO L78 Accepts]: Start accepts. Automaton has 356295 states and 572592 transitions. Word has length 180 [2019-09-10 08:57:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:31,493 INFO L475 AbstractCegarLoop]: Abstraction has 356295 states and 572592 transitions. [2019-09-10 08:57:31,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-10 08:57:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 356295 states and 572592 transitions. [2019-09-10 08:57:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 08:57:31,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:31,508 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] [2019-09-10 08:57:31,509 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:31,509 INFO L82 PathProgramCache]: Analyzing trace with hash -668676940, now seen corresponding path program 1 times [2019-09-10 08:57:31,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:31,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:31,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:31,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:31,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:37,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:37,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:37,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:37,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:37,672 INFO L87 Difference]: Start difference. First operand 356295 states and 572592 transitions. Second operand 3 states. [2019-09-10 08:57:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:38,086 INFO L93 Difference]: Finished difference Result 146670 states and 234974 transitions. [2019-09-10 08:57:38,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:38,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-10 08:57:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:57:38,362 INFO L225 Difference]: With dead ends: 146670 [2019-09-10 08:57:38,362 INFO L226 Difference]: Without dead ends: 146670 [2019-09-10 08:57:38,362 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:57:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146670 states. [2019-09-10 08:57:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146670 to 146668. [2019-09-10 08:57:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146668 states. [2019-09-10 08:57:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146668 states to 146668 states and 234973 transitions. [2019-09-10 08:57:40,049 INFO L78 Accepts]: Start accepts. Automaton has 146668 states and 234973 transitions. Word has length 180 [2019-09-10 08:57:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:40,049 INFO L475 AbstractCegarLoop]: Abstraction has 146668 states and 234973 transitions. [2019-09-10 08:57:40,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 146668 states and 234973 transitions. [2019-09-10 08:57:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 08:57:40,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:40,053 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-10 08:57:40,054 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1589177119, now seen corresponding path program 1 times [2019-09-10 08:57:40,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:40,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:40,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:40,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:40,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:57:40,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:57:40,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:57:40,221 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2019-09-10 08:57:40,223 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [252], [255], [258], [261], [265], [268], [290], [298], [300], [303], [325], [328], [331], [333], [335], [338], [360], [368], [370], [373], [395], [403], [405], [408], [411], [414], [417], [420], [427], [435], [437], [440], [441], [443], [452], [455], [466], [469], [481], [485], [489], [493], [497], [499], [502], [548], [558], [568], [578], [584], [588], [592], [596], [598], [601], [647], [657], [667], [677], [687], [691], [695], [697], [700], [746], [756], [766], [776], [782], [786], [790], [794], [796], [799], [845], [855], [865], [875], [1504], [1505], [1509], [1510], [1511] [2019-09-10 08:57:40,246 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:57:40,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:57:40,305 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:57:41,107 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:57:41,108 INFO L272 AbstractInterpreter]: Visited 172 different actions 829 times. Merged at 68 different actions 599 times. Widened at 36 different actions 103 times. Performed 2728 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2728 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 15 different actions. Largest state had 297 variables. [2019-09-10 08:57:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:41,109 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:57:41,649 INFO L227 lantSequenceWeakener]: Weakened 123 states. On average, predicates are now at 88.54% of their original sizes. [2019-09-10 08:57:41,649 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:58:20,304 INFO L420 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2019-09-10 08:58:20,305 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:58:20,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:58:20,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [129] imperfect sequences [5] total 132 [2019-09-10 08:58:20,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:20,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-10 08:58:20,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-10 08:58:20,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1818, Invalid=14694, Unknown=0, NotChecked=0, Total=16512 [2019-09-10 08:58:20,309 INFO L87 Difference]: Start difference. First operand 146668 states and 234973 transitions. Second operand 129 states.