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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:55:00,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:55:00,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:55:00,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:55:00,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:55:00,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:55:00,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:55:00,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:55:00,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:55:00,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:55:00,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:55:00,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:55:00,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:55:00,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:55:00,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:55:00,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:55:00,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:55:00,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:55:00,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:55:00,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:55:00,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:55:00,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:55:00,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:55:00,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:55:00,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:55:00,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:55:00,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:55:00,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:55:00,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:55:00,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:55:00,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:55:00,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:55:00,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:55:00,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:55:00,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:55:00,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:55:00,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:55:00,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:55:00,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:55:00,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:55:00,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:55:00,518 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:55:00,533 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:55:00,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:55:00,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:55:00,534 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:55:00,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:55:00,535 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:55:00,535 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:55:00,536 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:55:00,536 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:55:00,536 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:55:00,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:55:00,537 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:55:00,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:55:00,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:55:00,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:55:00,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:55:00,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:55:00,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:55:00,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:55:00,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:55:00,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:55:00,539 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:55:00,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:55:00,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:55:00,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:55:00,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:55:00,540 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:55:00,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:55:00,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:55:00,541 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:55:00,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:55:00,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:55:00,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:55:00,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:55:00,588 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:55:00,588 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:55:00,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c681160/086be9376cc4448db3daa1ea002ef0f5/FLAG4ca8c6f44 [2019-09-10 08:55:01,310 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:55:01,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:55:01,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c681160/086be9376cc4448db3daa1ea002ef0f5/FLAG4ca8c6f44 [2019-09-10 08:55:01,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c681160/086be9376cc4448db3daa1ea002ef0f5 [2019-09-10 08:55:01,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:55:01,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:55:01,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:55:01,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:55:01,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:55:01,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:55:01" (1/1) ... [2019-09-10 08:55:01,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270da6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:01, skipping insertion in model container [2019-09-10 08:55:01,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:55:01" (1/1) ... [2019-09-10 08:55:01,476 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:55:01,644 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:55:03,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:55:03,061 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:55:04,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:55:04,155 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:55:04,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04 WrapperNode [2019-09-10 08:55:04,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:55:04,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:55:04,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:55:04,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:55:04,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04" (1/1) ... [2019-09-10 08:55:04,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04" (1/1) ... [2019-09-10 08:55:04,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04" (1/1) ... [2019-09-10 08:55:04,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04" (1/1) ... [2019-09-10 08:55:04,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04" (1/1) ... [2019-09-10 08:55:04,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04" (1/1) ... [2019-09-10 08:55:04,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04" (1/1) ... [2019-09-10 08:55:04,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:55:04,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:55:04,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:55:04,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:55:04,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04" (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:55:04,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:55:04,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:55:04,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:55:04,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:55:04,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:55:04,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:55:04,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:55:04,475 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:55:04,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:55:04,475 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:55:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:55:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:55:04,477 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:55:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:55:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:55:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:55:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:55:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:55:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:55:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:55:07,825 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:55:07,826 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:55:07,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:55:07 BoogieIcfgContainer [2019-09-10 08:55:07,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:55:07,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:55:07,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:55:07,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:55:07,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:55:01" (1/3) ... [2019-09-10 08:55:07,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3664bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:55:07, skipping insertion in model container [2019-09-10 08:55:07,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:55:04" (2/3) ... [2019-09-10 08:55:07,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3664bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:55:07, skipping insertion in model container [2019-09-10 08:55:07,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:55:07" (3/3) ... [2019-09-10 08:55:07,841 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:55:07,851 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:55:07,881 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 08:55:07,906 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 08:55:07,940 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:55:07,941 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:55:07,941 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:55:07,941 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:55:07,941 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:55:07,942 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:55:07,942 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:55:07,942 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:55:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states. [2019-09-10 08:55:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:55:08,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:08,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:08,045 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:08,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:08,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2079914003, now seen corresponding path program 1 times [2019-09-10 08:55:08,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:08,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:08,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:08,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:08,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:09,186 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:55:09,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:09,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:09,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:09,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:09,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:09,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:09,215 INFO L87 Difference]: Start difference. First operand 1016 states. Second operand 3 states. [2019-09-10 08:55:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:09,594 INFO L93 Difference]: Finished difference Result 1477 states and 2605 transitions. [2019-09-10 08:55:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:09,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:55:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:09,624 INFO L225 Difference]: With dead ends: 1477 [2019-09-10 08:55:09,624 INFO L226 Difference]: Without dead ends: 1469 [2019-09-10 08:55:09,626 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:55:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-09-10 08:55:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1467. [2019-09-10 08:55:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2019-09-10 08:55:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2247 transitions. [2019-09-10 08:55:09,752 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2247 transitions. Word has length 324 [2019-09-10 08:55:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:09,756 INFO L475 AbstractCegarLoop]: Abstraction has 1467 states and 2247 transitions. [2019-09-10 08:55:09,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2247 transitions. [2019-09-10 08:55:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:55:09,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:09,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:09,774 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:09,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1212724027, now seen corresponding path program 1 times [2019-09-10 08:55:09,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:09,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:09,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:10,221 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:55:10,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:10,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:10,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:10,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:10,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:10,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:10,225 INFO L87 Difference]: Start difference. First operand 1467 states and 2247 transitions. Second operand 3 states. [2019-09-10 08:55:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:10,482 INFO L93 Difference]: Finished difference Result 2381 states and 3666 transitions. [2019-09-10 08:55:10,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:10,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:55:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:10,500 INFO L225 Difference]: With dead ends: 2381 [2019-09-10 08:55:10,500 INFO L226 Difference]: Without dead ends: 2381 [2019-09-10 08:55:10,501 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:55:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2019-09-10 08:55:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2379. [2019-09-10 08:55:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2019-09-10 08:55:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3665 transitions. [2019-09-10 08:55:10,576 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3665 transitions. Word has length 324 [2019-09-10 08:55:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:10,577 INFO L475 AbstractCegarLoop]: Abstraction has 2379 states and 3665 transitions. [2019-09-10 08:55:10,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3665 transitions. [2019-09-10 08:55:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:55:10,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:10,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:10,590 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 813423402, now seen corresponding path program 1 times [2019-09-10 08:55:10,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:10,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:10,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:10,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:10,985 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:55:10,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:10,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:10,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:10,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:10,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:10,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:10,988 INFO L87 Difference]: Start difference. First operand 2379 states and 3665 transitions. Second operand 3 states. [2019-09-10 08:55:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:11,333 INFO L93 Difference]: Finished difference Result 4257 states and 6582 transitions. [2019-09-10 08:55:11,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:11,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:55:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:11,356 INFO L225 Difference]: With dead ends: 4257 [2019-09-10 08:55:11,356 INFO L226 Difference]: Without dead ends: 4257 [2019-09-10 08:55:11,357 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:55:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2019-09-10 08:55:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 4255. [2019-09-10 08:55:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4255 states. [2019-09-10 08:55:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 6581 transitions. [2019-09-10 08:55:11,451 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 6581 transitions. Word has length 324 [2019-09-10 08:55:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:11,452 INFO L475 AbstractCegarLoop]: Abstraction has 4255 states and 6581 transitions. [2019-09-10 08:55:11,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 6581 transitions. [2019-09-10 08:55:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:55:11,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:11,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:11,464 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash 813084778, now seen corresponding path program 1 times [2019-09-10 08:55:11,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:11,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:11,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:11,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:12,318 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:55:12,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:12,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:12,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:12,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:12,320 INFO L87 Difference]: Start difference. First operand 4255 states and 6581 transitions. Second operand 4 states. [2019-09-10 08:55:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:12,531 INFO L93 Difference]: Finished difference Result 8342 states and 12825 transitions. [2019-09-10 08:55:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:12,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 08:55:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:12,575 INFO L225 Difference]: With dead ends: 8342 [2019-09-10 08:55:12,575 INFO L226 Difference]: Without dead ends: 8342 [2019-09-10 08:55:12,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:55:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8342 states. [2019-09-10 08:55:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8342 to 8171. [2019-09-10 08:55:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8171 states. [2019-09-10 08:55:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 12600 transitions. [2019-09-10 08:55:12,761 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 12600 transitions. Word has length 324 [2019-09-10 08:55:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:12,761 INFO L475 AbstractCegarLoop]: Abstraction has 8171 states and 12600 transitions. [2019-09-10 08:55:12,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 12600 transitions. [2019-09-10 08:55:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:55:12,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:12,782 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:12,782 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash -47582525, now seen corresponding path program 1 times [2019-09-10 08:55:12,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:12,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:12,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:13,019 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:55:13,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:13,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:13,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:13,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:13,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:13,022 INFO L87 Difference]: Start difference. First operand 8171 states and 12600 transitions. Second operand 3 states. [2019-09-10 08:55:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:13,126 INFO L93 Difference]: Finished difference Result 16322 states and 25165 transitions. [2019-09-10 08:55:13,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:13,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:55:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:13,190 INFO L225 Difference]: With dead ends: 16322 [2019-09-10 08:55:13,190 INFO L226 Difference]: Without dead ends: 16322 [2019-09-10 08:55:13,191 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:55:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16322 states. [2019-09-10 08:55:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16322 to 8184. [2019-09-10 08:55:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8184 states. [2019-09-10 08:55:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8184 states to 8184 states and 12619 transitions. [2019-09-10 08:55:13,467 INFO L78 Accepts]: Start accepts. Automaton has 8184 states and 12619 transitions. Word has length 326 [2019-09-10 08:55:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:13,467 INFO L475 AbstractCegarLoop]: Abstraction has 8184 states and 12619 transitions. [2019-09-10 08:55:13,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8184 states and 12619 transitions. [2019-09-10 08:55:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:55:13,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:13,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:13,488 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2014553918, now seen corresponding path program 1 times [2019-09-10 08:55:13,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:13,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:13,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:13,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:13,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:14,639 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:55:14,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:14,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:14,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:14,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:14,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:14,642 INFO L87 Difference]: Start difference. First operand 8184 states and 12619 transitions. Second operand 3 states. [2019-09-10 08:55:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:14,852 INFO L93 Difference]: Finished difference Result 16039 states and 24582 transitions. [2019-09-10 08:55:14,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:14,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:55:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:14,898 INFO L225 Difference]: With dead ends: 16039 [2019-09-10 08:55:14,898 INFO L226 Difference]: Without dead ends: 16039 [2019-09-10 08:55:14,899 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:55:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16039 states. [2019-09-10 08:55:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16039 to 15868. [2019-09-10 08:55:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15868 states. [2019-09-10 08:55:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15868 states to 15868 states and 24357 transitions. [2019-09-10 08:55:15,329 INFO L78 Accepts]: Start accepts. Automaton has 15868 states and 24357 transitions. Word has length 326 [2019-09-10 08:55:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:15,330 INFO L475 AbstractCegarLoop]: Abstraction has 15868 states and 24357 transitions. [2019-09-10 08:55:15,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 15868 states and 24357 transitions. [2019-09-10 08:55:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:55:15,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:15,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:15,382 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:15,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:15,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1271718060, now seen corresponding path program 1 times [2019-09-10 08:55:15,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:15,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:15,787 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:55:15,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:15,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:15,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:15,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:15,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:15,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:15,792 INFO L87 Difference]: Start difference. First operand 15868 states and 24357 transitions. Second operand 3 states. [2019-09-10 08:55:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:15,959 INFO L93 Difference]: Finished difference Result 31683 states and 48619 transitions. [2019-09-10 08:55:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:15,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 08:55:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:16,024 INFO L225 Difference]: With dead ends: 31683 [2019-09-10 08:55:16,024 INFO L226 Difference]: Without dead ends: 31683 [2019-09-10 08:55:16,025 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:55:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31683 states. [2019-09-10 08:55:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31683 to 15886. [2019-09-10 08:55:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15886 states. [2019-09-10 08:55:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 24378 transitions. [2019-09-10 08:55:16,395 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 24378 transitions. Word has length 327 [2019-09-10 08:55:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:16,395 INFO L475 AbstractCegarLoop]: Abstraction has 15886 states and 24378 transitions. [2019-09-10 08:55:16,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 24378 transitions. [2019-09-10 08:55:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:55:16,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:16,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:16,423 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash -720506535, now seen corresponding path program 1 times [2019-09-10 08:55:16,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:16,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:16,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:16,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:16,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:16,730 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:55:16,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:16,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:16,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:16,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:16,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:16,734 INFO L87 Difference]: Start difference. First operand 15886 states and 24378 transitions. Second operand 3 states. [2019-09-10 08:55:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:17,002 INFO L93 Difference]: Finished difference Result 29333 states and 44687 transitions. [2019-09-10 08:55:17,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:17,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 08:55:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:17,095 INFO L225 Difference]: With dead ends: 29333 [2019-09-10 08:55:17,095 INFO L226 Difference]: Without dead ends: 29333 [2019-09-10 08:55:17,096 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:55:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29333 states. [2019-09-10 08:55:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29333 to 29162. [2019-09-10 08:55:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29162 states. [2019-09-10 08:55:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29162 states to 29162 states and 44462 transitions. [2019-09-10 08:55:17,817 INFO L78 Accepts]: Start accepts. Automaton has 29162 states and 44462 transitions. Word has length 328 [2019-09-10 08:55:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:17,818 INFO L475 AbstractCegarLoop]: Abstraction has 29162 states and 44462 transitions. [2019-09-10 08:55:17,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29162 states and 44462 transitions. [2019-09-10 08:55:17,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:55:17,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:17,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:17,866 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:17,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1085513782, now seen corresponding path program 1 times [2019-09-10 08:55:17,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:17,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:18,292 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:55:18,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:18,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:18,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:18,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:18,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:18,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:18,294 INFO L87 Difference]: Start difference. First operand 29162 states and 44462 transitions. Second operand 4 states. [2019-09-10 08:55:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:18,524 INFO L93 Difference]: Finished difference Result 56120 states and 85447 transitions. [2019-09-10 08:55:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:18,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 08:55:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:18,614 INFO L225 Difference]: With dead ends: 56120 [2019-09-10 08:55:18,614 INFO L226 Difference]: Without dead ends: 56120 [2019-09-10 08:55:18,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:55:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56120 states. [2019-09-10 08:55:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56120 to 29397. [2019-09-10 08:55:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29397 states. [2019-09-10 08:55:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29397 states to 29397 states and 44850 transitions. [2019-09-10 08:55:20,056 INFO L78 Accepts]: Start accepts. Automaton has 29397 states and 44850 transitions. Word has length 328 [2019-09-10 08:55:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:20,056 INFO L475 AbstractCegarLoop]: Abstraction has 29397 states and 44850 transitions. [2019-09-10 08:55:20,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 29397 states and 44850 transitions. [2019-09-10 08:55:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:55:20,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:20,095 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:20,095 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1858070503, now seen corresponding path program 1 times [2019-09-10 08:55:20,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:20,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:20,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:20,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:20,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:20,299 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:55:20,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:20,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:20,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:20,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:20,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:20,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:20,301 INFO L87 Difference]: Start difference. First operand 29397 states and 44850 transitions. Second operand 3 states. [2019-09-10 08:55:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:20,517 INFO L93 Difference]: Finished difference Result 47235 states and 72621 transitions. [2019-09-10 08:55:20,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:20,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:55:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:20,579 INFO L225 Difference]: With dead ends: 47235 [2019-09-10 08:55:20,580 INFO L226 Difference]: Without dead ends: 47235 [2019-09-10 08:55:20,581 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:55:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47235 states. [2019-09-10 08:55:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47235 to 37053. [2019-09-10 08:55:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37053 states. [2019-09-10 08:55:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37053 states to 37053 states and 57444 transitions. [2019-09-10 08:55:21,160 INFO L78 Accepts]: Start accepts. Automaton has 37053 states and 57444 transitions. Word has length 330 [2019-09-10 08:55:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:21,160 INFO L475 AbstractCegarLoop]: Abstraction has 37053 states and 57444 transitions. [2019-09-10 08:55:21,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 37053 states and 57444 transitions. [2019-09-10 08:55:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:55:21,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:21,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:21,204 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:21,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1930508395, now seen corresponding path program 1 times [2019-09-10 08:55:21,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:21,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:21,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:21,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:21,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:55:21,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:21,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:21,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:21,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:21,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:21,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:21,650 INFO L87 Difference]: Start difference. First operand 37053 states and 57444 transitions. Second operand 3 states. [2019-09-10 08:55:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:21,942 INFO L93 Difference]: Finished difference Result 73339 states and 113532 transitions. [2019-09-10 08:55:21,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:21,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:55:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:22,047 INFO L225 Difference]: With dead ends: 73339 [2019-09-10 08:55:22,047 INFO L226 Difference]: Without dead ends: 73339 [2019-09-10 08:55:22,048 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:55:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73339 states. [2019-09-10 08:55:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73339 to 37157. [2019-09-10 08:55:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37157 states. [2019-09-10 08:55:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37157 states to 37157 states and 57587 transitions. [2019-09-10 08:55:22,719 INFO L78 Accepts]: Start accepts. Automaton has 37157 states and 57587 transitions. Word has length 330 [2019-09-10 08:55:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:22,719 INFO L475 AbstractCegarLoop]: Abstraction has 37157 states and 57587 transitions. [2019-09-10 08:55:22,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 37157 states and 57587 transitions. [2019-09-10 08:55:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 08:55:22,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:22,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:22,745 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 294622740, now seen corresponding path program 1 times [2019-09-10 08:55:22,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:22,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:22,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:22,929 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:55:22,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:22,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:22,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:22,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:22,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:22,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:22,931 INFO L87 Difference]: Start difference. First operand 37157 states and 57587 transitions. Second operand 3 states. [2019-09-10 08:55:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:23,255 INFO L93 Difference]: Finished difference Result 73464 states and 113678 transitions. [2019-09-10 08:55:23,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:23,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-10 08:55:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:23,365 INFO L225 Difference]: With dead ends: 73464 [2019-09-10 08:55:23,365 INFO L226 Difference]: Without dead ends: 73464 [2019-09-10 08:55:23,366 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:55:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73464 states. [2019-09-10 08:55:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73464 to 37282. [2019-09-10 08:55:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37282 states. [2019-09-10 08:55:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37282 states to 37282 states and 57733 transitions. [2019-09-10 08:55:25,172 INFO L78 Accepts]: Start accepts. Automaton has 37282 states and 57733 transitions. Word has length 331 [2019-09-10 08:55:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:25,173 INFO L475 AbstractCegarLoop]: Abstraction has 37282 states and 57733 transitions. [2019-09-10 08:55:25,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 37282 states and 57733 transitions. [2019-09-10 08:55:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:55:25,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:25,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:25,200 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1498157719, now seen corresponding path program 1 times [2019-09-10 08:55:25,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:25,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:25,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:25,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:25,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:55:25,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:25,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:25,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:25,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:25,394 INFO L87 Difference]: Start difference. First operand 37282 states and 57733 transitions. Second operand 3 states. [2019-09-10 08:55:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:25,714 INFO L93 Difference]: Finished difference Result 59100 states and 92050 transitions. [2019-09-10 08:55:25,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:25,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:55:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:25,790 INFO L225 Difference]: With dead ends: 59100 [2019-09-10 08:55:25,791 INFO L226 Difference]: Without dead ends: 59100 [2019-09-10 08:55:25,791 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:55:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59100 states. [2019-09-10 08:55:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59100 to 50954. [2019-09-10 08:55:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50954 states. [2019-09-10 08:55:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50954 states to 50954 states and 80083 transitions. [2019-09-10 08:55:26,804 INFO L78 Accepts]: Start accepts. Automaton has 50954 states and 80083 transitions. Word has length 332 [2019-09-10 08:55:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:26,805 INFO L475 AbstractCegarLoop]: Abstraction has 50954 states and 80083 transitions. [2019-09-10 08:55:26,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 50954 states and 80083 transitions. [2019-09-10 08:55:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:55:26,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:26,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:26,829 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:26,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:26,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2084302370, now seen corresponding path program 1 times [2019-09-10 08:55:26,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:26,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:26,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:55:27,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:27,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:27,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:27,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:27,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:27,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:27,217 INFO L87 Difference]: Start difference. First operand 50954 states and 80083 transitions. Second operand 4 states. [2019-09-10 08:55:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:27,391 INFO L93 Difference]: Finished difference Result 48468 states and 76129 transitions. [2019-09-10 08:55:27,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:27,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 08:55:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:27,474 INFO L225 Difference]: With dead ends: 48468 [2019-09-10 08:55:27,474 INFO L226 Difference]: Without dead ends: 47671 [2019-09-10 08:55:27,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:55:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47671 states. [2019-09-10 08:55:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47671 to 47651. [2019-09-10 08:55:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47651 states. [2019-09-10 08:55:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47651 states to 47651 states and 74862 transitions. [2019-09-10 08:55:27,957 INFO L78 Accepts]: Start accepts. Automaton has 47651 states and 74862 transitions. Word has length 332 [2019-09-10 08:55:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:27,957 INFO L475 AbstractCegarLoop]: Abstraction has 47651 states and 74862 transitions. [2019-09-10 08:55:27,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 47651 states and 74862 transitions. [2019-09-10 08:55:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 08:55:27,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:27,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:27,979 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash 10678946, now seen corresponding path program 1 times [2019-09-10 08:55:27,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:27,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:27,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:27,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:28,436 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:55:28,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:28,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:55:28,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:28,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:55:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:55:28,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:55:28,441 INFO L87 Difference]: Start difference. First operand 47651 states and 74862 transitions. Second operand 9 states. [2019-09-10 08:55:29,890 WARN L188 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-09-10 08:55:36,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:36,055 INFO L93 Difference]: Finished difference Result 339851 states and 538981 transitions. [2019-09-10 08:55:36,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:55:36,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 333 [2019-09-10 08:55:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:36,635 INFO L225 Difference]: With dead ends: 339851 [2019-09-10 08:55:36,635 INFO L226 Difference]: Without dead ends: 339851 [2019-09-10 08:55:36,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:55:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339851 states. [2019-09-10 08:55:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339851 to 145833. [2019-09-10 08:55:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145833 states. [2019-09-10 08:55:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145833 states to 145833 states and 229434 transitions. [2019-09-10 08:55:42,325 INFO L78 Accepts]: Start accepts. Automaton has 145833 states and 229434 transitions. Word has length 333 [2019-09-10 08:55:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:42,326 INFO L475 AbstractCegarLoop]: Abstraction has 145833 states and 229434 transitions. [2019-09-10 08:55:42,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:55:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 145833 states and 229434 transitions. [2019-09-10 08:55:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 08:55:42,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:42,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:42,368 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:42,369 INFO L82 PathProgramCache]: Analyzing trace with hash -435112094, now seen corresponding path program 1 times [2019-09-10 08:55:42,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:42,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:42,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:42,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:42,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:55:42,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:42,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:55:42,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:42,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:55:42,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:55:42,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:55:42,964 INFO L87 Difference]: Start difference. First operand 145833 states and 229434 transitions. Second operand 10 states. [2019-09-10 08:55:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:46,438 INFO L93 Difference]: Finished difference Result 296660 states and 469085 transitions. [2019-09-10 08:55:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:55:46,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 333 [2019-09-10 08:55:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:46,822 INFO L225 Difference]: With dead ends: 296660 [2019-09-10 08:55:46,823 INFO L226 Difference]: Without dead ends: 296660 [2019-09-10 08:55:46,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:55:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296660 states. [2019-09-10 08:55:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296660 to 106318. [2019-09-10 08:55:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106318 states. [2019-09-10 08:55:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106318 states to 106318 states and 166321 transitions. [2019-09-10 08:55:52,624 INFO L78 Accepts]: Start accepts. Automaton has 106318 states and 166321 transitions. Word has length 333 [2019-09-10 08:55:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:52,625 INFO L475 AbstractCegarLoop]: Abstraction has 106318 states and 166321 transitions. [2019-09-10 08:55:52,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:55:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 106318 states and 166321 transitions. [2019-09-10 08:55:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 08:55:52,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:52,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,655 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:52,656 INFO L82 PathProgramCache]: Analyzing trace with hash -729000614, now seen corresponding path program 1 times [2019-09-10 08:55:52,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:52,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:52,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:53,841 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:55:53,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:53,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:53,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:53,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:53,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:53,843 INFO L87 Difference]: Start difference. First operand 106318 states and 166321 transitions. Second operand 4 states. [2019-09-10 08:55:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:54,586 INFO L93 Difference]: Finished difference Result 207621 states and 323434 transitions. [2019-09-10 08:55:54,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:54,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-09-10 08:55:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:54,948 INFO L225 Difference]: With dead ends: 207621 [2019-09-10 08:55:54,948 INFO L226 Difference]: Without dead ends: 207621 [2019-09-10 08:55:54,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:55:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207621 states. [2019-09-10 08:56:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207621 to 207464. [2019-09-10 08:56:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207464 states. [2019-09-10 08:56:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207464 states to 207464 states and 323227 transitions. [2019-09-10 08:56:00,980 INFO L78 Accepts]: Start accepts. Automaton has 207464 states and 323227 transitions. Word has length 333 [2019-09-10 08:56:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:00,981 INFO L475 AbstractCegarLoop]: Abstraction has 207464 states and 323227 transitions. [2019-09-10 08:56:00,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:56:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 207464 states and 323227 transitions. [2019-09-10 08:56:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 08:56:01,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:01,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:01,037 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash 819018217, now seen corresponding path program 1 times [2019-09-10 08:56:01,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:01,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:01,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:01,289 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:56:01,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:01,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:01,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:01,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:01,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:01,291 INFO L87 Difference]: Start difference. First operand 207464 states and 323227 transitions. Second operand 3 states. [2019-09-10 08:56:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:02,269 INFO L93 Difference]: Finished difference Result 406765 states and 631871 transitions. [2019-09-10 08:56:02,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:02,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-10 08:56:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:02,883 INFO L225 Difference]: With dead ends: 406765 [2019-09-10 08:56:02,883 INFO L226 Difference]: Without dead ends: 406765 [2019-09-10 08:56:02,883 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:56:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406765 states. [2019-09-10 08:56:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406765 to 406612. [2019-09-10 08:56:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406612 states. [2019-09-10 08:56:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406612 states to 406612 states and 631672 transitions. [2019-09-10 08:56:12,623 INFO L78 Accepts]: Start accepts. Automaton has 406612 states and 631672 transitions. Word has length 335 [2019-09-10 08:56:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:12,623 INFO L475 AbstractCegarLoop]: Abstraction has 406612 states and 631672 transitions. [2019-09-10 08:56:12,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 406612 states and 631672 transitions. [2019-09-10 08:56:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 08:56:12,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:12,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,734 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash 938770134, now seen corresponding path program 1 times [2019-09-10 08:56:12,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:12,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:12,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:12,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:12,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:12,921 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:56:12,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:12,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:12,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:12,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:12,923 INFO L87 Difference]: Start difference. First operand 406612 states and 631672 transitions. Second operand 3 states. [2019-09-10 08:56:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:15,879 INFO L93 Difference]: Finished difference Result 696065 states and 1086182 transitions. [2019-09-10 08:56:15,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:15,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-10 08:56:15,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:16,896 INFO L225 Difference]: With dead ends: 696065 [2019-09-10 08:56:16,896 INFO L226 Difference]: Without dead ends: 696065 [2019-09-10 08:56:16,897 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:56:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696065 states. [2019-09-10 08:56:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696065 to 633508. [2019-09-10 08:56:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633508 states. [2019-09-10 08:56:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633508 states to 633508 states and 991392 transitions. [2019-09-10 08:56:41,725 INFO L78 Accepts]: Start accepts. Automaton has 633508 states and 991392 transitions. Word has length 336 [2019-09-10 08:56:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:41,726 INFO L475 AbstractCegarLoop]: Abstraction has 633508 states and 991392 transitions. [2019-09-10 08:56:41,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 633508 states and 991392 transitions. [2019-09-10 08:56:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 08:56:41,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:41,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:41,856 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1433509614, now seen corresponding path program 1 times [2019-09-10 08:56:41,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:41,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:41,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:56:42,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:42,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:56:42,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:42,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:56:42,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:56:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:56:42,131 INFO L87 Difference]: Start difference. First operand 633508 states and 991392 transitions. Second operand 3 states. [2019-09-10 08:56:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:46,971 INFO L93 Difference]: Finished difference Result 1243800 states and 1936526 transitions. [2019-09-10 08:56:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:56:46,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-10 08:56:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:59,643 INFO L225 Difference]: With dead ends: 1243800 [2019-09-10 08:56:59,644 INFO L226 Difference]: Without dead ends: 1243800 [2019-09-10 08:56:59,644 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:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243800 states. [2019-09-10 08:57:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243800 to 1243651. [2019-09-10 08:57:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243651 states. [2019-09-10 08:57:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243651 states to 1243651 states and 1936335 transitions. [2019-09-10 08:57:43,404 INFO L78 Accepts]: Start accepts. Automaton has 1243651 states and 1936335 transitions. Word has length 337 [2019-09-10 08:57:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:43,404 INFO L475 AbstractCegarLoop]: Abstraction has 1243651 states and 1936335 transitions. [2019-09-10 08:57:43,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:57:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1243651 states and 1936335 transitions. [2019-09-10 08:57:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 08:57:43,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:43,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,646 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:43,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash 806350193, now seen corresponding path program 1 times [2019-09-10 08:57:43,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:43,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:43,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:43,944 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:57:43,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:43,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:57:43,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:43,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:57:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:57:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:57:43,946 INFO L87 Difference]: Start difference. First operand 1243651 states and 1936335 transitions. Second operand 4 states. [2019-09-10 08:58:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:58:01,916 INFO L93 Difference]: Finished difference Result 2138946 states and 3320663 transitions. [2019-09-10 08:58:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:58:01,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-09-10 08:58:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:16,883 INFO L225 Difference]: With dead ends: 2138946 [2019-09-10 08:58:16,883 INFO L226 Difference]: Without dead ends: 2138946 [2019-09-10 08:58:16,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:58:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138946 states. [2019-09-10 08:58:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138946 to 1209041. [2019-09-10 08:58:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209041 states. [2019-09-10 08:58:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209041 states to 1209041 states and 1880867 transitions. [2019-09-10 08:58:59,171 INFO L78 Accepts]: Start accepts. Automaton has 1209041 states and 1880867 transitions. Word has length 337 [2019-09-10 08:58:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:59,172 INFO L475 AbstractCegarLoop]: Abstraction has 1209041 states and 1880867 transitions. [2019-09-10 08:58:59,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:58:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1209041 states and 1880867 transitions. [2019-09-10 08:58:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 08:58:59,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:59,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:59,365 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 813007865, now seen corresponding path program 1 times [2019-09-10 08:58:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:59,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:59,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:59,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:59:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:59:13,038 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:59:13,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:59:13,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:59:13,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:59:13,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:59:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:59:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:59:13,040 INFO L87 Difference]: Start difference. First operand 1209041 states and 1880867 transitions. Second operand 3 states. [2019-09-10 08:59:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:19,926 INFO L93 Difference]: Finished difference Result 2162926 states and 3361934 transitions. [2019-09-10 08:59:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:59:19,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-10 08:59:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:25,532 INFO L225 Difference]: With dead ends: 2162926 [2019-09-10 08:59:25,532 INFO L226 Difference]: Without dead ends: 2162926 [2019-09-10 08:59:25,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:59:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162926 states. [2019-09-10 09:00:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162926 to 1209522. [2019-09-10 09:00:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209522 states.