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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:01:16,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:01:16,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:01:16,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:01:16,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:01:16,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:01:16,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:01:16,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:01:16,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:01:16,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:01:16,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:01:16,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:01:16,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:01:16,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:01:16,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:01:16,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:01:16,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:01:16,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:01:16,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:01:16,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:01:16,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:01:16,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:01:16,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:01:16,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:01:16,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:01:16,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:01:16,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:01:16,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:01:16,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:01:16,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:01:16,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:01:16,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:01:16,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:01:16,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:01:16,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:01:16,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:01:16,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:01:16,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:01:16,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:01:16,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:01:16,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:01:16,500 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 09:01:16,515 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:01:16,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:01:16,516 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:01:16,516 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:01:16,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:01:16,517 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:01:16,517 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:01:16,517 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:01:16,517 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:01:16,518 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:01:16,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:01:16,518 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:01:16,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:01:16,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:01:16,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:01:16,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:01:16,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:01:16,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:01:16,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:01:16,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:01:16,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:01:16,520 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:01:16,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:01:16,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:01:16,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:01:16,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:01:16,521 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:01:16,522 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:01:16,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:01:16,522 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:01:16,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:01:16,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:01:16,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:01:16,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:01:16,588 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:01:16,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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:01:16,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b60a1c67/cd5d07233fad4f988203c75d6bddd333/FLAGc47a1a744 [2019-09-10 09:01:17,446 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:01:17,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:01:17,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b60a1c67/cd5d07233fad4f988203c75d6bddd333/FLAGc47a1a744 [2019-09-10 09:01:17,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b60a1c67/cd5d07233fad4f988203c75d6bddd333 [2019-09-10 09:01:17,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:01:17,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:01:17,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:01:17,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:01:17,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:01:17,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:01:17" (1/1) ... [2019-09-10 09:01:17,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270b417c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:17, skipping insertion in model container [2019-09-10 09:01:17,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:01:17" (1/1) ... [2019-09-10 09:01:17,634 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:01:17,782 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:01:18,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:01:18,971 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:01:19,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:01:19,782 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:01:19,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19 WrapperNode [2019-09-10 09:01:19,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:01:19,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:01:19,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:01:19,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:01:19,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19" (1/1) ... [2019-09-10 09:01:19,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19" (1/1) ... [2019-09-10 09:01:19,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19" (1/1) ... [2019-09-10 09:01:19,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19" (1/1) ... [2019-09-10 09:01:19,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19" (1/1) ... [2019-09-10 09:01:19,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19" (1/1) ... [2019-09-10 09:01:19,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19" (1/1) ... [2019-09-10 09:01:19,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:01:19,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:01:19,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:01:19,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:01:20,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19" (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 09:01:20,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:01:20,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:01:20,099 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:01:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:01:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:01:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:01:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:01:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:01:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:01:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:01:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:01:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:01:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:01:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:01:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:01:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:01:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:01:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:01:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:01:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:01:24,473 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:01:24,474 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:01:24,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:01:24 BoogieIcfgContainer [2019-09-10 09:01:24,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:01:24,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:01:24,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:01:24,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:01:24,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:01:17" (1/3) ... [2019-09-10 09:01:24,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a46074d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:01:24, skipping insertion in model container [2019-09-10 09:01:24,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:19" (2/3) ... [2019-09-10 09:01:24,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a46074d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:01:24, skipping insertion in model container [2019-09-10 09:01:24,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:01:24" (3/3) ... [2019-09-10 09:01:24,489 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:01:24,500 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:01:24,523 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:01:24,541 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:01:24,568 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:01:24,568 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:01:24,568 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:01:24,568 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:01:24,568 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:01:24,568 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:01:24,569 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:01:24,569 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:01:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states. [2019-09-10 09:01:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-10 09:01:24,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:24,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:24,662 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:24,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:24,668 INFO L82 PathProgramCache]: Analyzing trace with hash 822825100, now seen corresponding path program 1 times [2019-09-10 09:01:24,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:24,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:24,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:24,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:24,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:25,762 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 09:01:25,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:25,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:25,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:25,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:25,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:25,790 INFO L87 Difference]: Start difference. First operand 1529 states. Second operand 3 states. [2019-09-10 09:01:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:25,999 INFO L93 Difference]: Finished difference Result 2124 states and 3721 transitions. [2019-09-10 09:01:26,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:26,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-10 09:01:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:26,035 INFO L225 Difference]: With dead ends: 2124 [2019-09-10 09:01:26,035 INFO L226 Difference]: Without dead ends: 2116 [2019-09-10 09:01:26,037 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 09:01:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-09-10 09:01:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2114. [2019-09-10 09:01:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-09-10 09:01:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3545 transitions. [2019-09-10 09:01:26,190 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3545 transitions. Word has length 376 [2019-09-10 09:01:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:26,194 INFO L475 AbstractCegarLoop]: Abstraction has 2114 states and 3545 transitions. [2019-09-10 09:01:26,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3545 transitions. [2019-09-10 09:01:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-10 09:01:26,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:26,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:26,209 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash 724616216, now seen corresponding path program 1 times [2019-09-10 09:01:26,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:26,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:26,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:26,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:26,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:26,663 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 09:01:26,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:26,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:26,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:26,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:26,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:26,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:26,670 INFO L87 Difference]: Start difference. First operand 2114 states and 3545 transitions. Second operand 3 states. [2019-09-10 09:01:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:26,906 INFO L93 Difference]: Finished difference Result 3116 states and 5173 transitions. [2019-09-10 09:01:26,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:26,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-10 09:01:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:26,928 INFO L225 Difference]: With dead ends: 3116 [2019-09-10 09:01:26,928 INFO L226 Difference]: Without dead ends: 3116 [2019-09-10 09:01:26,930 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 09:01:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2019-09-10 09:01:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3114. [2019-09-10 09:01:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2019-09-10 09:01:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 5172 transitions. [2019-09-10 09:01:27,077 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 5172 transitions. Word has length 376 [2019-09-10 09:01:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:27,077 INFO L475 AbstractCegarLoop]: Abstraction has 3114 states and 5172 transitions. [2019-09-10 09:01:27,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 5172 transitions. [2019-09-10 09:01:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-10 09:01:27,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:27,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:27,090 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1055361571, now seen corresponding path program 1 times [2019-09-10 09:01:27,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:27,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:27,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:27,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:27,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:27,402 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 09:01:27,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:27,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:27,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:27,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:27,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:27,408 INFO L87 Difference]: Start difference. First operand 3114 states and 5172 transitions. Second operand 3 states. [2019-09-10 09:01:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:27,572 INFO L93 Difference]: Finished difference Result 4750 states and 7818 transitions. [2019-09-10 09:01:27,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:27,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-10 09:01:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:27,607 INFO L225 Difference]: With dead ends: 4750 [2019-09-10 09:01:27,608 INFO L226 Difference]: Without dead ends: 4750 [2019-09-10 09:01:27,608 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 09:01:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4750 states. [2019-09-10 09:01:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4750 to 4748. [2019-09-10 09:01:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2019-09-10 09:01:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 7817 transitions. [2019-09-10 09:01:27,779 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 7817 transitions. Word has length 376 [2019-09-10 09:01:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:27,781 INFO L475 AbstractCegarLoop]: Abstraction has 4748 states and 7817 transitions. [2019-09-10 09:01:27,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 7817 transitions. [2019-09-10 09:01:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-10 09:01:27,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:27,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:27,808 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash -991064276, now seen corresponding path program 1 times [2019-09-10 09:01:27,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:27,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:27,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:27,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:27,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:28,450 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 09:01:28,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:28,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:01:28,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:28,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:01:28,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:01:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:28,454 INFO L87 Difference]: Start difference. First operand 4748 states and 7817 transitions. Second operand 4 states. [2019-09-10 09:01:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:28,648 INFO L93 Difference]: Finished difference Result 6652 states and 10971 transitions. [2019-09-10 09:01:28,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:01:28,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2019-09-10 09:01:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:28,685 INFO L225 Difference]: With dead ends: 6652 [2019-09-10 09:01:28,685 INFO L226 Difference]: Without dead ends: 6652 [2019-09-10 09:01:28,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2019-09-10 09:01:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 5324. [2019-09-10 09:01:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5324 states. [2019-09-10 09:01:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 8793 transitions. [2019-09-10 09:01:28,870 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 8793 transitions. Word has length 376 [2019-09-10 09:01:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:28,871 INFO L475 AbstractCegarLoop]: Abstraction has 5324 states and 8793 transitions. [2019-09-10 09:01:28,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:01:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 8793 transitions. [2019-09-10 09:01:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-10 09:01:28,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:28,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:28,886 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:28,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1954837219, now seen corresponding path program 1 times [2019-09-10 09:01:28,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:28,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:28,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:28,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:29,393 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 09:01:29,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:29,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:29,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:29,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:29,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:29,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:29,396 INFO L87 Difference]: Start difference. First operand 5324 states and 8793 transitions. Second operand 3 states. [2019-09-10 09:01:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:29,547 INFO L93 Difference]: Finished difference Result 7706 states and 12742 transitions. [2019-09-10 09:01:29,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:29,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-10 09:01:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:29,589 INFO L225 Difference]: With dead ends: 7706 [2019-09-10 09:01:29,589 INFO L226 Difference]: Without dead ends: 7706 [2019-09-10 09:01:29,589 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 09:01:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7706 states. [2019-09-10 09:01:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7706 to 7704. [2019-09-10 09:01:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7704 states. [2019-09-10 09:01:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 12741 transitions. [2019-09-10 09:01:29,878 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 12741 transitions. Word has length 376 [2019-09-10 09:01:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:29,879 INFO L475 AbstractCegarLoop]: Abstraction has 7704 states and 12741 transitions. [2019-09-10 09:01:29,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 12741 transitions. [2019-09-10 09:01:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-10 09:01:29,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:29,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:29,915 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:29,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:29,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1152448316, now seen corresponding path program 1 times [2019-09-10 09:01:29,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:29,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:29,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:29,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:29,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:01:30,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:30,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:01:30,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:30,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:01:30,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:01:30,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:01:30,515 INFO L87 Difference]: Start difference. First operand 7704 states and 12741 transitions. Second operand 5 states. [2019-09-10 09:01:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:30,862 INFO L93 Difference]: Finished difference Result 19626 states and 32664 transitions. [2019-09-10 09:01:30,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:01:30,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 377 [2019-09-10 09:01:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:30,924 INFO L225 Difference]: With dead ends: 19626 [2019-09-10 09:01:30,924 INFO L226 Difference]: Without dead ends: 19626 [2019-09-10 09:01:30,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:01:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19626 states. [2019-09-10 09:01:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19626 to 15020. [2019-09-10 09:01:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15020 states. [2019-09-10 09:01:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15020 states to 15020 states and 24961 transitions. [2019-09-10 09:01:31,351 INFO L78 Accepts]: Start accepts. Automaton has 15020 states and 24961 transitions. Word has length 377 [2019-09-10 09:01:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:31,352 INFO L475 AbstractCegarLoop]: Abstraction has 15020 states and 24961 transitions. [2019-09-10 09:01:31,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:01:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 15020 states and 24961 transitions. [2019-09-10 09:01:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-10 09:01:31,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:31,381 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:31,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1738520537, now seen corresponding path program 1 times [2019-09-10 09:01:31,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:31,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:31,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:31,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:31,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:33,233 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 09:01:33,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:33,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:01:33,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:33,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:01:33,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:01:33,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:33,235 INFO L87 Difference]: Start difference. First operand 15020 states and 24961 transitions. Second operand 4 states. [2019-09-10 09:01:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:33,433 INFO L93 Difference]: Finished difference Result 27306 states and 45397 transitions. [2019-09-10 09:01:33,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:01:33,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2019-09-10 09:01:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:33,511 INFO L225 Difference]: With dead ends: 27306 [2019-09-10 09:01:33,512 INFO L226 Difference]: Without dead ends: 27306 [2019-09-10 09:01:33,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27306 states. [2019-09-10 09:01:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27306 to 23458. [2019-09-10 09:01:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23458 states. [2019-09-10 09:01:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23458 states to 23458 states and 38999 transitions. [2019-09-10 09:01:34,010 INFO L78 Accepts]: Start accepts. Automaton has 23458 states and 38999 transitions. Word has length 378 [2019-09-10 09:01:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:34,011 INFO L475 AbstractCegarLoop]: Abstraction has 23458 states and 38999 transitions. [2019-09-10 09:01:34,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:01:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 23458 states and 38999 transitions. [2019-09-10 09:01:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-10 09:01:34,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:34,036 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:34,037 INFO L82 PathProgramCache]: Analyzing trace with hash 47984045, now seen corresponding path program 1 times [2019-09-10 09:01:34,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:34,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:34,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:35,017 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 09:01:35,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:35,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:01:35,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:35,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:01:35,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:01:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:35,019 INFO L87 Difference]: Start difference. First operand 23458 states and 38999 transitions. Second operand 4 states. [2019-09-10 09:01:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:35,321 INFO L93 Difference]: Finished difference Result 52130 states and 86745 transitions. [2019-09-10 09:01:35,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:01:35,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2019-09-10 09:01:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:35,479 INFO L225 Difference]: With dead ends: 52130 [2019-09-10 09:01:35,479 INFO L226 Difference]: Without dead ends: 52130 [2019-09-10 09:01:35,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:01:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52130 states. [2019-09-10 09:01:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52130 to 44232. [2019-09-10 09:01:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44232 states. [2019-09-10 09:01:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44232 states to 44232 states and 73561 transitions. [2019-09-10 09:01:36,362 INFO L78 Accepts]: Start accepts. Automaton has 44232 states and 73561 transitions. Word has length 382 [2019-09-10 09:01:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:36,363 INFO L475 AbstractCegarLoop]: Abstraction has 44232 states and 73561 transitions. [2019-09-10 09:01:36,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:01:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 44232 states and 73561 transitions. [2019-09-10 09:01:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-10 09:01:36,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:36,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:36,401 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1181837992, now seen corresponding path program 1 times [2019-09-10 09:01:36,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:36,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:36,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:36,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:36,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:37,961 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 09:01:37,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:37,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:01:37,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:37,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:01:37,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:01:37,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:01:37,964 INFO L87 Difference]: Start difference. First operand 44232 states and 73561 transitions. Second operand 5 states. [2019-09-10 09:01:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:38,520 INFO L93 Difference]: Finished difference Result 136148 states and 226918 transitions. [2019-09-10 09:01:38,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:01:38,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 382 [2019-09-10 09:01:38,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:38,788 INFO L225 Difference]: With dead ends: 136148 [2019-09-10 09:01:38,788 INFO L226 Difference]: Without dead ends: 136148 [2019-09-10 09:01:38,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:01:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136148 states. [2019-09-10 09:01:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136148 to 108320. [2019-09-10 09:01:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108320 states. [2019-09-10 09:01:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108320 states to 108320 states and 180349 transitions. [2019-09-10 09:01:40,508 INFO L78 Accepts]: Start accepts. Automaton has 108320 states and 180349 transitions. Word has length 382 [2019-09-10 09:01:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:40,509 INFO L475 AbstractCegarLoop]: Abstraction has 108320 states and 180349 transitions. [2019-09-10 09:01:40,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:01:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 108320 states and 180349 transitions. [2019-09-10 09:01:40,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-10 09:01:40,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:40,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:40,546 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:40,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash 954181943, now seen corresponding path program 1 times [2019-09-10 09:01:40,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:40,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:40,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:40,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:40,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:01:41,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:41,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:41,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:41,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:41,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:41,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:41,064 INFO L87 Difference]: Start difference. First operand 108320 states and 180349 transitions. Second operand 3 states. [2019-09-10 09:01:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:41,761 INFO L93 Difference]: Finished difference Result 195302 states and 324689 transitions. [2019-09-10 09:01:41,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:41,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-09-10 09:01:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:42,169 INFO L225 Difference]: With dead ends: 195302 [2019-09-10 09:01:42,169 INFO L226 Difference]: Without dead ends: 195302 [2019-09-10 09:01:42,170 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 09:01:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195302 states. [2019-09-10 09:01:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195302 to 187016. [2019-09-10 09:01:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187016 states. [2019-09-10 09:01:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187016 states to 187016 states and 309572 transitions. [2019-09-10 09:01:47,773 INFO L78 Accepts]: Start accepts. Automaton has 187016 states and 309572 transitions. Word has length 382 [2019-09-10 09:01:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:47,773 INFO L475 AbstractCegarLoop]: Abstraction has 187016 states and 309572 transitions. [2019-09-10 09:01:47,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 187016 states and 309572 transitions. [2019-09-10 09:01:47,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-10 09:01:47,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:47,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:47,815 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:47,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash 727343335, now seen corresponding path program 1 times [2019-09-10 09:01:47,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:47,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:47,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:47,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:47,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:48,595 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 09:01:48,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:48,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:01:48,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:48,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:01:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:01:48,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:01:48,598 INFO L87 Difference]: Start difference. First operand 187016 states and 309572 transitions. Second operand 7 states. [2019-09-10 09:01:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:54,460 INFO L93 Difference]: Finished difference Result 445516 states and 738599 transitions. [2019-09-10 09:01:54,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:01:54,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2019-09-10 09:01:54,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:55,436 INFO L225 Difference]: With dead ends: 445516 [2019-09-10 09:01:55,436 INFO L226 Difference]: Without dead ends: 445516 [2019-09-10 09:01:55,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 09:01:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445516 states. [2019-09-10 09:01:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445516 to 198020. [2019-09-10 09:01:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198020 states. [2019-09-10 09:01:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198020 states to 198020 states and 327960 transitions. [2019-09-10 09:01:59,060 INFO L78 Accepts]: Start accepts. Automaton has 198020 states and 327960 transitions. Word has length 382 [2019-09-10 09:01:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:59,061 INFO L475 AbstractCegarLoop]: Abstraction has 198020 states and 327960 transitions. [2019-09-10 09:01:59,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:01:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 198020 states and 327960 transitions. [2019-09-10 09:01:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-10 09:01:59,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:59,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:01:59,091 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1949809634, now seen corresponding path program 1 times [2019-09-10 09:01:59,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:59,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:59,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:59,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:01:59,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:01:59,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:59,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:01:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:01:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:01:59,734 INFO L87 Difference]: Start difference. First operand 198020 states and 327960 transitions. Second operand 7 states. [2019-09-10 09:02:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:02,213 INFO L93 Difference]: Finished difference Result 457360 states and 758515 transitions. [2019-09-10 09:02:02,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:02:02,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2019-09-10 09:02:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:03,017 INFO L225 Difference]: With dead ends: 457360 [2019-09-10 09:02:03,017 INFO L226 Difference]: Without dead ends: 457360 [2019-09-10 09:02:03,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 09:02:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457360 states. [2019-09-10 09:02:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457360 to 220268. [2019-09-10 09:02:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220268 states. [2019-09-10 09:02:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220268 states to 220268 states and 364976 transitions. [2019-09-10 09:02:11,669 INFO L78 Accepts]: Start accepts. Automaton has 220268 states and 364976 transitions. Word has length 382 [2019-09-10 09:02:11,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:11,670 INFO L475 AbstractCegarLoop]: Abstraction has 220268 states and 364976 transitions. [2019-09-10 09:02:11,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:02:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 220268 states and 364976 transitions. [2019-09-10 09:02:11,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-10 09:02:11,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:11,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:11,700 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:11,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 446914932, now seen corresponding path program 1 times [2019-09-10 09:02:11,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:11,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:11,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:11,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:11,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:13,252 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 09:02:13,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:13,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:02:13,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:13,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:02:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:02:13,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:02:13,255 INFO L87 Difference]: Start difference. First operand 220268 states and 364976 transitions. Second operand 7 states. [2019-09-10 09:02:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:15,002 INFO L93 Difference]: Finished difference Result 532088 states and 882515 transitions. [2019-09-10 09:02:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:02:15,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2019-09-10 09:02:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:15,962 INFO L225 Difference]: With dead ends: 532088 [2019-09-10 09:02:15,963 INFO L226 Difference]: Without dead ends: 532088 [2019-09-10 09:02:15,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 09:02:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532088 states. [2019-09-10 09:02:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532088 to 241900. [2019-09-10 09:02:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241900 states. [2019-09-10 09:02:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241900 states to 241900 states and 400860 transitions. [2019-09-10 09:02:25,427 INFO L78 Accepts]: Start accepts. Automaton has 241900 states and 400860 transitions. Word has length 382 [2019-09-10 09:02:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:25,428 INFO L475 AbstractCegarLoop]: Abstraction has 241900 states and 400860 transitions. [2019-09-10 09:02:25,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:02:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 241900 states and 400860 transitions. [2019-09-10 09:02:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-10 09:02:26,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:26,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:26,265 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1329868963, now seen corresponding path program 1 times [2019-09-10 09:02:26,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:26,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:26,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:26,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:26,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:26,818 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 09:02:26,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:26,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:02:26,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:26,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:02:26,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:02:26,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:02:26,821 INFO L87 Difference]: Start difference. First operand 241900 states and 400860 transitions. Second operand 7 states. [2019-09-10 09:02:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:27,750 INFO L93 Difference]: Finished difference Result 260930 states and 432533 transitions. [2019-09-10 09:02:27,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:02:27,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2019-09-10 09:02:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:28,168 INFO L225 Difference]: With dead ends: 260930 [2019-09-10 09:02:28,168 INFO L226 Difference]: Without dead ends: 260930 [2019-09-10 09:02:28,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 09:02:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260930 states. [2019-09-10 09:02:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260930 to 248432. [2019-09-10 09:02:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248432 states. [2019-09-10 09:02:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248432 states to 248432 states and 411768 transitions. [2019-09-10 09:02:39,296 INFO L78 Accepts]: Start accepts. Automaton has 248432 states and 411768 transitions. Word has length 382 [2019-09-10 09:02:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:39,297 INFO L475 AbstractCegarLoop]: Abstraction has 248432 states and 411768 transitions. [2019-09-10 09:02:39,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:02:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 248432 states and 411768 transitions. [2019-09-10 09:02:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-10 09:02:39,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:39,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:39,320 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:39,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1451385970, now seen corresponding path program 1 times [2019-09-10 09:02:39,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:39,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:39,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:39,661 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 09:02:39,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:39,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:39,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:39,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:39,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:39,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:39,664 INFO L87 Difference]: Start difference. First operand 248432 states and 411768 transitions. Second operand 3 states. [2019-09-10 09:02:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:40,266 INFO L93 Difference]: Finished difference Result 241949 states and 400523 transitions. [2019-09-10 09:02:40,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:40,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-09-10 09:02:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:40,666 INFO L225 Difference]: With dead ends: 241949 [2019-09-10 09:02:40,667 INFO L226 Difference]: Without dead ends: 241949 [2019-09-10 09:02:40,667 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 09:02:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241949 states. [2019-09-10 09:02:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241949 to 241947. [2019-09-10 09:02:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241947 states. [2019-09-10 09:02:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241947 states to 241947 states and 400522 transitions. [2019-09-10 09:02:44,404 INFO L78 Accepts]: Start accepts. Automaton has 241947 states and 400522 transitions. Word has length 382 [2019-09-10 09:02:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:44,405 INFO L475 AbstractCegarLoop]: Abstraction has 241947 states and 400522 transitions. [2019-09-10 09:02:44,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 241947 states and 400522 transitions. [2019-09-10 09:02:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-10 09:02:44,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:44,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:02:44,419 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash -883565018, now seen corresponding path program 1 times [2019-09-10 09:02:44,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:44,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:44,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:44,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:44,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:44,968 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 09:02:44,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:44,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:02:44,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:44,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:02:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:02:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:02:44,972 INFO L87 Difference]: Start difference. First operand 241947 states and 400522 transitions. Second operand 6 states. [2019-09-10 09:02:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:46,517 INFO L93 Difference]: Finished difference Result 504953 states and 834175 transitions. [2019-09-10 09:02:46,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:02:46,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 382 [2019-09-10 09:02:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:48,678 INFO L225 Difference]: With dead ends: 504953 [2019-09-10 09:02:48,678 INFO L226 Difference]: Without dead ends: 504953 [2019-09-10 09:02:48,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:02:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504953 states. [2019-09-10 09:02:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504953 to 495059. [2019-09-10 09:02:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495059 states. [2019-09-10 09:03:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495059 states to 495059 states and 818008 transitions. [2019-09-10 09:03:01,229 INFO L78 Accepts]: Start accepts. Automaton has 495059 states and 818008 transitions. Word has length 382 [2019-09-10 09:03:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:01,230 INFO L475 AbstractCegarLoop]: Abstraction has 495059 states and 818008 transitions. [2019-09-10 09:03:01,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:03:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 495059 states and 818008 transitions. [2019-09-10 09:03:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-10 09:03:01,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:01,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:03:01,252 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash 980547119, now seen corresponding path program 1 times [2019-09-10 09:03:01,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:01,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:01,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:01,556 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 09:03:01,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:01,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:01,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:01,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:01,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:01,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:01,559 INFO L87 Difference]: Start difference. First operand 495059 states and 818008 transitions. Second operand 3 states. [2019-09-10 09:03:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:10,743 INFO L93 Difference]: Finished difference Result 967150 states and 1592773 transitions. [2019-09-10 09:03:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:10,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2019-09-10 09:03:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:13,156 INFO L225 Difference]: With dead ends: 967150 [2019-09-10 09:03:13,156 INFO L226 Difference]: Without dead ends: 967150 [2019-09-10 09:03:13,156 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 09:03:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967150 states. [2019-09-10 09:03:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967150 to 965330. [2019-09-10 09:03:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965330 states. [2019-09-10 09:03:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965330 states to 965330 states and 1589136 transitions. [2019-09-10 09:03:40,583 INFO L78 Accepts]: Start accepts. Automaton has 965330 states and 1589136 transitions. Word has length 383 [2019-09-10 09:03:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:40,583 INFO L475 AbstractCegarLoop]: Abstraction has 965330 states and 1589136 transitions. [2019-09-10 09:03:40,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 965330 states and 1589136 transitions. [2019-09-10 09:03:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-10 09:03:40,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:40,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:03:40,602 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash 710004661, now seen corresponding path program 1 times [2019-09-10 09:03:40,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:40,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:40,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:40,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:03:42,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:42,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:03:42,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:42,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:03:42,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:03:42,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:03:42,383 INFO L87 Difference]: Start difference. First operand 965330 states and 1589136 transitions. Second operand 7 states. [2019-09-10 09:04:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:13,533 INFO L93 Difference]: Finished difference Result 2364139 states and 3890259 transitions. [2019-09-10 09:04:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 09:04:13,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 383 [2019-09-10 09:04:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:18,147 INFO L225 Difference]: With dead ends: 2364139 [2019-09-10 09:04:18,147 INFO L226 Difference]: Without dead ends: 2364139 [2019-09-10 09:04:18,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-10 09:04:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364139 states.