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_floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:26:27,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:26:27,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:26:27,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:26:27,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:26:27,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:26:27,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:26:27,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:26:27,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:26:27,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:26:27,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:26:27,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:26:27,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:26:27,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:26:27,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:26:27,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:26:27,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:26:27,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:26:27,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:26:27,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:26:27,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:26:27,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:26:27,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:26:27,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:26:27,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:26:27,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:26:27,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:26:27,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:26:27,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:26:27,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:26:27,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:26:27,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:26:27,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:26:27,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:26:27,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:26:27,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:26:27,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:26:27,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:26:27,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:26:27,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:26:27,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:26:27,329 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 06:26:27,351 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:26:27,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:26:27,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:26:27,353 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:26:27,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:26:27,354 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:26:27,354 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:26:27,354 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:26:27,354 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:26:27,355 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:26:27,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:26:27,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:26:27,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:26:27,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:26:27,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:26:27,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:26:27,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:26:27,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:26:27,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:26:27,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:26:27,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:26:27,359 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:26:27,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:26:27,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:26:27,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:26:27,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:26:27,361 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:26:27,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:26:27,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:26:27,361 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:26:27,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:26:27,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:26:27,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:26:27,439 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:26:27,440 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:26:27,441 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:26:27,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b68709f/cea2eb77fac34778b5b3ce422d696c2b/FLAGee4a69523 [2019-09-10 06:26:28,153 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:26:28,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:26:28,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b68709f/cea2eb77fac34778b5b3ce422d696c2b/FLAGee4a69523 [2019-09-10 06:26:28,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b68709f/cea2eb77fac34778b5b3ce422d696c2b [2019-09-10 06:26:28,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:26:28,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:26:28,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:26:28,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:26:28,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:26:28,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:26:28" (1/1) ... [2019-09-10 06:26:28,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6b1866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:28, skipping insertion in model container [2019-09-10 06:26:28,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:26:28" (1/1) ... [2019-09-10 06:26:28,319 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:26:28,483 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:26:29,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:26:29,875 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:26:30,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:26:30,767 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:26:30,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30 WrapperNode [2019-09-10 06:26:30,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:26:30,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:26:30,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:26:30,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:26:30,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30" (1/1) ... [2019-09-10 06:26:30,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30" (1/1) ... [2019-09-10 06:26:30,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30" (1/1) ... [2019-09-10 06:26:30,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30" (1/1) ... [2019-09-10 06:26:30,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30" (1/1) ... [2019-09-10 06:26:30,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30" (1/1) ... [2019-09-10 06:26:30,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30" (1/1) ... [2019-09-10 06:26:30,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:26:30,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:26:30,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:26:30,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:26:30,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30" (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 06:26:31,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:26:31,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:26:31,064 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:26:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:26:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:26:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:26:31,065 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:26:31,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:26:31,065 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:26:31,065 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:26:31,065 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:26:31,066 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:26:31,066 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:26:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:26:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:26:31,068 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:26:31,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:26:31,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:26:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:26:34,230 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:26:34,231 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:26:34,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:26:34 BoogieIcfgContainer [2019-09-10 06:26:34,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:26:34,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:26:34,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:26:34,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:26:34,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:26:28" (1/3) ... [2019-09-10 06:26:34,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b8d0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:26:34, skipping insertion in model container [2019-09-10 06:26:34,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:26:30" (2/3) ... [2019-09-10 06:26:34,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b8d0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:26:34, skipping insertion in model container [2019-09-10 06:26:34,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:26:34" (3/3) ... [2019-09-10 06:26:34,251 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:26:34,266 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:26:34,295 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 06:26:34,314 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 06:26:34,344 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:26:34,344 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:26:34,345 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:26:34,345 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:26:34,345 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:26:34,345 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:26:34,345 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:26:34,345 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:26:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states. [2019-09-10 06:26:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:26:34,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:34,439 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] [2019-09-10 06:26:34,442 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1092745861, now seen corresponding path program 1 times [2019-09-10 06:26:34,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:34,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:34,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:34,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:34,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:35,505 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 06:26:35,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:35,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:35,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:35,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:35,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:35,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:35,532 INFO L87 Difference]: Start difference. First operand 910 states. Second operand 3 states. [2019-09-10 06:26:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:36,077 INFO L93 Difference]: Finished difference Result 1410 states and 2518 transitions. [2019-09-10 06:26:36,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:36,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-10 06:26:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:36,115 INFO L225 Difference]: With dead ends: 1410 [2019-09-10 06:26:36,116 INFO L226 Difference]: Without dead ends: 1402 [2019-09-10 06:26:36,119 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 06:26:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-09-10 06:26:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1400. [2019-09-10 06:26:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2019-09-10 06:26:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2161 transitions. [2019-09-10 06:26:36,244 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2161 transitions. Word has length 302 [2019-09-10 06:26:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:36,247 INFO L475 AbstractCegarLoop]: Abstraction has 1400 states and 2161 transitions. [2019-09-10 06:26:36,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2161 transitions. [2019-09-10 06:26:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:26:36,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:36,254 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] [2019-09-10 06:26:36,254 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:36,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1093084485, now seen corresponding path program 1 times [2019-09-10 06:26:36,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:36,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:36,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:37,219 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 06:26:37,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:37,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:37,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:37,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:37,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:37,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:37,225 INFO L87 Difference]: Start difference. First operand 1400 states and 2161 transitions. Second operand 4 states. [2019-09-10 06:26:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:37,427 INFO L93 Difference]: Finished difference Result 2750 states and 4220 transitions. [2019-09-10 06:26:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:37,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-10 06:26:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:37,443 INFO L225 Difference]: With dead ends: 2750 [2019-09-10 06:26:37,443 INFO L226 Difference]: Without dead ends: 2750 [2019-09-10 06:26:37,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:26:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-09-10 06:26:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2608. [2019-09-10 06:26:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2608 states. [2019-09-10 06:26:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 4024 transitions. [2019-09-10 06:26:37,513 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 4024 transitions. Word has length 302 [2019-09-10 06:26:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:37,514 INFO L475 AbstractCegarLoop]: Abstraction has 2608 states and 4024 transitions. [2019-09-10 06:26:37,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 4024 transitions. [2019-09-10 06:26:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:26:37,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:37,522 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] [2019-09-10 06:26:37,523 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:37,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:37,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1873824137, now seen corresponding path program 1 times [2019-09-10 06:26:37,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:37,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:37,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:37,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:37,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:37,824 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 06:26:37,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:37,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:37,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:37,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:37,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:37,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:37,827 INFO L87 Difference]: Start difference. First operand 2608 states and 4024 transitions. Second operand 3 states. [2019-09-10 06:26:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:37,972 INFO L93 Difference]: Finished difference Result 5128 states and 7870 transitions. [2019-09-10 06:26:37,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:37,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:26:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:37,998 INFO L225 Difference]: With dead ends: 5128 [2019-09-10 06:26:37,998 INFO L226 Difference]: Without dead ends: 5128 [2019-09-10 06:26:37,998 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 06:26:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5128 states. [2019-09-10 06:26:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5128 to 4986. [2019-09-10 06:26:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4986 states. [2019-09-10 06:26:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 7674 transitions. [2019-09-10 06:26:38,120 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 7674 transitions. Word has length 304 [2019-09-10 06:26:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:38,121 INFO L475 AbstractCegarLoop]: Abstraction has 4986 states and 7674 transitions. [2019-09-10 06:26:38,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 7674 transitions. [2019-09-10 06:26:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:26:38,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:38,136 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] [2019-09-10 06:26:38,136 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:38,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1199834830, now seen corresponding path program 1 times [2019-09-10 06:26:38,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:38,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:38,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:38,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:38,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:38,291 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 06:26:38,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:38,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:38,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:38,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:38,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:38,293 INFO L87 Difference]: Start difference. First operand 4986 states and 7674 transitions. Second operand 3 states. [2019-09-10 06:26:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:38,457 INFO L93 Difference]: Finished difference Result 9939 states and 15288 transitions. [2019-09-10 06:26:38,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:38,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:26:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:38,515 INFO L225 Difference]: With dead ends: 9939 [2019-09-10 06:26:38,515 INFO L226 Difference]: Without dead ends: 9939 [2019-09-10 06:26:38,516 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 06:26:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9939 states. [2019-09-10 06:26:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9939 to 5005. [2019-09-10 06:26:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5005 states. [2019-09-10 06:26:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5005 states to 5005 states and 7702 transitions. [2019-09-10 06:26:38,714 INFO L78 Accepts]: Start accepts. Automaton has 5005 states and 7702 transitions. Word has length 304 [2019-09-10 06:26:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:38,714 INFO L475 AbstractCegarLoop]: Abstraction has 5005 states and 7702 transitions. [2019-09-10 06:26:38,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states and 7702 transitions. [2019-09-10 06:26:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-10 06:26:38,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:38,727 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] [2019-09-10 06:26:38,728 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash -747414031, now seen corresponding path program 1 times [2019-09-10 06:26:38,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:38,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:38,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:38,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:38,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:38,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:38,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:38,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:38,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:38,879 INFO L87 Difference]: Start difference. First operand 5005 states and 7702 transitions. Second operand 3 states. [2019-09-10 06:26:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:38,964 INFO L93 Difference]: Finished difference Result 9957 states and 15309 transitions. [2019-09-10 06:26:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:38,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-10 06:26:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:39,007 INFO L225 Difference]: With dead ends: 9957 [2019-09-10 06:26:39,008 INFO L226 Difference]: Without dead ends: 9957 [2019-09-10 06:26:39,008 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 06:26:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2019-09-10 06:26:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 5023. [2019-09-10 06:26:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2019-09-10 06:26:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 7723 transitions. [2019-09-10 06:26:39,204 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 7723 transitions. Word has length 305 [2019-09-10 06:26:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:39,204 INFO L475 AbstractCegarLoop]: Abstraction has 5023 states and 7723 transitions. [2019-09-10 06:26:39,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 7723 transitions. [2019-09-10 06:26:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:26:39,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:39,219 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] [2019-09-10 06:26:39,219 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:39,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:39,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1395518428, now seen corresponding path program 1 times [2019-09-10 06:26:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:39,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:39,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:39,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:39,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:39,664 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 06:26:39,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:39,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:39,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:39,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:39,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:39,667 INFO L87 Difference]: Start difference. First operand 5023 states and 7723 transitions. Second operand 3 states. [2019-09-10 06:26:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:39,828 INFO L93 Difference]: Finished difference Result 9780 states and 14935 transitions. [2019-09-10 06:26:39,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:39,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:26:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:39,850 INFO L225 Difference]: With dead ends: 9780 [2019-09-10 06:26:39,851 INFO L226 Difference]: Without dead ends: 9780 [2019-09-10 06:26:39,851 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 06:26:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2019-09-10 06:26:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 9638. [2019-09-10 06:26:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9638 states. [2019-09-10 06:26:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 14739 transitions. [2019-09-10 06:26:40,034 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 14739 transitions. Word has length 306 [2019-09-10 06:26:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:40,034 INFO L475 AbstractCegarLoop]: Abstraction has 9638 states and 14739 transitions. [2019-09-10 06:26:40,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 14739 transitions. [2019-09-10 06:26:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:26:40,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:40,056 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] [2019-09-10 06:26:40,057 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1763591873, now seen corresponding path program 1 times [2019-09-10 06:26:40,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:40,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:40,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:40,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:40,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:40,424 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 06:26:40,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:40,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:40,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:40,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:40,427 INFO L87 Difference]: Start difference. First operand 9638 states and 14739 transitions. Second operand 4 states. [2019-09-10 06:26:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:40,596 INFO L93 Difference]: Finished difference Result 17837 states and 27168 transitions. [2019-09-10 06:26:40,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:40,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-10 06:26:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:40,717 INFO L225 Difference]: With dead ends: 17837 [2019-09-10 06:26:40,717 INFO L226 Difference]: Without dead ends: 17837 [2019-09-10 06:26:40,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:26:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17837 states. [2019-09-10 06:26:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17837 to 9873. [2019-09-10 06:26:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9873 states. [2019-09-10 06:26:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 15127 transitions. [2019-09-10 06:26:40,943 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 15127 transitions. Word has length 306 [2019-09-10 06:26:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:40,943 INFO L475 AbstractCegarLoop]: Abstraction has 9873 states and 15127 transitions. [2019-09-10 06:26:40,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 15127 transitions. [2019-09-10 06:26:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:26:40,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:40,964 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] [2019-09-10 06:26:40,965 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1458963152, now seen corresponding path program 1 times [2019-09-10 06:26:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:40,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:40,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:40,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:40,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:41,108 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 06:26:41,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:41,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:41,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:41,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:41,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:41,112 INFO L87 Difference]: Start difference. First operand 9873 states and 15127 transitions. Second operand 3 states. [2019-09-10 06:26:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:41,260 INFO L93 Difference]: Finished difference Result 18979 states and 28898 transitions. [2019-09-10 06:26:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:41,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:26:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:41,307 INFO L225 Difference]: With dead ends: 18979 [2019-09-10 06:26:41,307 INFO L226 Difference]: Without dead ends: 18979 [2019-09-10 06:26:41,308 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 06:26:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18979 states. [2019-09-10 06:26:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18979 to 9977. [2019-09-10 06:26:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9977 states. [2019-09-10 06:26:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9977 states to 9977 states and 15270 transitions. [2019-09-10 06:26:41,525 INFO L78 Accepts]: Start accepts. Automaton has 9977 states and 15270 transitions. Word has length 308 [2019-09-10 06:26:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:41,526 INFO L475 AbstractCegarLoop]: Abstraction has 9977 states and 15270 transitions. [2019-09-10 06:26:41,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 9977 states and 15270 transitions. [2019-09-10 06:26:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-10 06:26:41,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:41,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] [2019-09-10 06:26:41,546 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash 399951671, now seen corresponding path program 1 times [2019-09-10 06:26:41,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:41,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:41,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:41,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:41,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:41,741 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 06:26:41,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:41,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:41,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:41,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:41,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:41,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:41,746 INFO L87 Difference]: Start difference. First operand 9977 states and 15270 transitions. Second operand 3 states. [2019-09-10 06:26:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:41,912 INFO L93 Difference]: Finished difference Result 19104 states and 29044 transitions. [2019-09-10 06:26:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:41,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-10 06:26:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:41,952 INFO L225 Difference]: With dead ends: 19104 [2019-09-10 06:26:41,952 INFO L226 Difference]: Without dead ends: 19104 [2019-09-10 06:26:41,954 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 06:26:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19104 states. [2019-09-10 06:26:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19104 to 10102. [2019-09-10 06:26:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10102 states. [2019-09-10 06:26:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10102 states to 10102 states and 15416 transitions. [2019-09-10 06:26:42,179 INFO L78 Accepts]: Start accepts. Automaton has 10102 states and 15416 transitions. Word has length 309 [2019-09-10 06:26:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:42,180 INFO L475 AbstractCegarLoop]: Abstraction has 10102 states and 15416 transitions. [2019-09-10 06:26:42,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 10102 states and 15416 transitions. [2019-09-10 06:26:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:26:42,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:42,201 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] [2019-09-10 06:26:42,201 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:42,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:42,202 INFO L82 PathProgramCache]: Analyzing trace with hash 549610147, now seen corresponding path program 1 times [2019-09-10 06:26:42,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:42,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:42,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:42,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:42,551 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 06:26:42,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:42,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:42,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:42,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:42,555 INFO L87 Difference]: Start difference. First operand 10102 states and 15416 transitions. Second operand 4 states. [2019-09-10 06:26:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:42,616 INFO L93 Difference]: Finished difference Result 9709 states and 14845 transitions. [2019-09-10 06:26:42,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:42,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-09-10 06:26:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:42,641 INFO L225 Difference]: With dead ends: 9709 [2019-09-10 06:26:42,641 INFO L226 Difference]: Without dead ends: 8912 [2019-09-10 06:26:42,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:26:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8912 states. [2019-09-10 06:26:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8912 to 8892. [2019-09-10 06:26:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8892 states. [2019-09-10 06:26:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8892 states to 8892 states and 13578 transitions. [2019-09-10 06:26:42,770 INFO L78 Accepts]: Start accepts. Automaton has 8892 states and 13578 transitions. Word has length 310 [2019-09-10 06:26:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:42,770 INFO L475 AbstractCegarLoop]: Abstraction has 8892 states and 13578 transitions. [2019-09-10 06:26:42,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 8892 states and 13578 transitions. [2019-09-10 06:26:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:26:42,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:42,792 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:42,793 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:42,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:42,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1515996479, now seen corresponding path program 1 times [2019-09-10 06:26:42,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:42,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:42,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:42,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:42,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:43,416 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 06:26:43,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:43,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:26:43,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:43,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:26:43,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:26:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:26:43,419 INFO L87 Difference]: Start difference. First operand 8892 states and 13578 transitions. Second operand 9 states. [2019-09-10 06:26:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:44,169 INFO L93 Difference]: Finished difference Result 14109 states and 21417 transitions. [2019-09-10 06:26:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:44,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 314 [2019-09-10 06:26:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:44,200 INFO L225 Difference]: With dead ends: 14109 [2019-09-10 06:26:44,201 INFO L226 Difference]: Without dead ends: 14109 [2019-09-10 06:26:44,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:26:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14109 states. [2019-09-10 06:26:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14109 to 14107. [2019-09-10 06:26:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14107 states. [2019-09-10 06:26:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 21416 transitions. [2019-09-10 06:26:44,392 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 21416 transitions. Word has length 314 [2019-09-10 06:26:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:44,393 INFO L475 AbstractCegarLoop]: Abstraction has 14107 states and 21416 transitions. [2019-09-10 06:26:44,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:26:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 21416 transitions. [2019-09-10 06:26:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:26:44,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:44,428 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] [2019-09-10 06:26:44,428 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash -479267222, now seen corresponding path program 1 times [2019-09-10 06:26:44,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:44,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:44,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:44,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:44,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:45,760 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 06:26:45,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:45,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:26:45,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:45,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:26:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:26:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:26:45,762 INFO L87 Difference]: Start difference. First operand 14107 states and 21416 transitions. Second operand 14 states. [2019-09-10 06:26:45,890 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2019-09-10 06:26:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:50,803 INFO L93 Difference]: Finished difference Result 40886 states and 62194 transitions. [2019-09-10 06:26:50,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:26:50,808 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 314 [2019-09-10 06:26:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:50,895 INFO L225 Difference]: With dead ends: 40886 [2019-09-10 06:26:50,895 INFO L226 Difference]: Without dead ends: 40886 [2019-09-10 06:26:50,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=269, Invalid=723, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:26:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40886 states. [2019-09-10 06:26:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40886 to 16415. [2019-09-10 06:26:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16415 states. [2019-09-10 06:26:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16415 states to 16415 states and 24680 transitions. [2019-09-10 06:26:51,963 INFO L78 Accepts]: Start accepts. Automaton has 16415 states and 24680 transitions. Word has length 314 [2019-09-10 06:26:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:51,963 INFO L475 AbstractCegarLoop]: Abstraction has 16415 states and 24680 transitions. [2019-09-10 06:26:51,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:26:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 16415 states and 24680 transitions. [2019-09-10 06:26:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:26:51,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:51,980 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] [2019-09-10 06:26:51,981 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:51,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1286224969, now seen corresponding path program 1 times [2019-09-10 06:26:51,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:51,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:51,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:51,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:51,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:52,636 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 06:26:52,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:52,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:52,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:52,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:52,639 INFO L87 Difference]: Start difference. First operand 16415 states and 24680 transitions. Second operand 4 states. [2019-09-10 06:26:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:52,879 INFO L93 Difference]: Finished difference Result 31950 states and 47643 transitions. [2019-09-10 06:26:52,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:52,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:26:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:52,922 INFO L225 Difference]: With dead ends: 31950 [2019-09-10 06:26:52,922 INFO L226 Difference]: Without dead ends: 31950 [2019-09-10 06:26:52,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:26:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31950 states. [2019-09-10 06:26:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31950 to 31814. [2019-09-10 06:26:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31814 states. [2019-09-10 06:26:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31814 states to 31814 states and 47457 transitions. [2019-09-10 06:26:53,329 INFO L78 Accepts]: Start accepts. Automaton has 31814 states and 47457 transitions. Word has length 314 [2019-09-10 06:26:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:53,330 INFO L475 AbstractCegarLoop]: Abstraction has 31814 states and 47457 transitions. [2019-09-10 06:26:53,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 31814 states and 47457 transitions. [2019-09-10 06:26:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:26:53,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:53,363 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] [2019-09-10 06:26:53,363 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 586568706, now seen corresponding path program 1 times [2019-09-10 06:26:53,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:53,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:53,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:53,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:53,613 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 06:26:53,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:53,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:53,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:53,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:53,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:53,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:53,616 INFO L87 Difference]: Start difference. First operand 31814 states and 47457 transitions. Second operand 3 states. [2019-09-10 06:26:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:53,901 INFO L93 Difference]: Finished difference Result 61919 states and 91577 transitions. [2019-09-10 06:26:53,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:53,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 06:26:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:54,809 INFO L225 Difference]: With dead ends: 61919 [2019-09-10 06:26:54,809 INFO L226 Difference]: Without dead ends: 61919 [2019-09-10 06:26:54,810 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 06:26:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61919 states. [2019-09-10 06:26:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61919 to 61787. [2019-09-10 06:26:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61787 states. [2019-09-10 06:26:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61787 states to 61787 states and 91399 transitions. [2019-09-10 06:26:55,438 INFO L78 Accepts]: Start accepts. Automaton has 61787 states and 91399 transitions. Word has length 316 [2019-09-10 06:26:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:55,439 INFO L475 AbstractCegarLoop]: Abstraction has 61787 states and 91399 transitions. [2019-09-10 06:26:55,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 61787 states and 91399 transitions. [2019-09-10 06:26:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:26:55,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:55,499 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] [2019-09-10 06:26:55,500 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:55,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1854737059, now seen corresponding path program 1 times [2019-09-10 06:26:55,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:55,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:55,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:55,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:55,747 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 06:26:55,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:55,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:26:55,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:55,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:26:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:26:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:26:55,749 INFO L87 Difference]: Start difference. First operand 61787 states and 91399 transitions. Second operand 3 states. [2019-09-10 06:26:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:56,079 INFO L93 Difference]: Finished difference Result 120898 states and 177448 transitions. [2019-09-10 06:26:56,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:26:56,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 06:26:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:56,215 INFO L225 Difference]: With dead ends: 120898 [2019-09-10 06:26:56,215 INFO L226 Difference]: Without dead ends: 120898 [2019-09-10 06:26:56,216 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 06:26:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120898 states. [2019-09-10 06:26:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120898 to 120770. [2019-09-10 06:26:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120770 states. [2019-09-10 06:26:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120770 states to 120770 states and 177278 transitions. [2019-09-10 06:26:58,666 INFO L78 Accepts]: Start accepts. Automaton has 120770 states and 177278 transitions. Word has length 318 [2019-09-10 06:26:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:58,667 INFO L475 AbstractCegarLoop]: Abstraction has 120770 states and 177278 transitions. [2019-09-10 06:26:58,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 120770 states and 177278 transitions. [2019-09-10 06:26:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:26:58,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:58,755 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] [2019-09-10 06:26:58,755 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1508526010, now seen corresponding path program 1 times [2019-09-10 06:26:58,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:58,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:58,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:58,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:58,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:59,545 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 06:26:59,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:59,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:59,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:59,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:59,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:59,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:59,549 INFO L87 Difference]: Start difference. First operand 120770 states and 177278 transitions. Second operand 4 states. [2019-09-10 06:27:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:00,153 INFO L93 Difference]: Finished difference Result 205917 states and 301106 transitions. [2019-09-10 06:27:00,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:00,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 06:27:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:00,379 INFO L225 Difference]: With dead ends: 205917 [2019-09-10 06:27:00,379 INFO L226 Difference]: Without dead ends: 205917 [2019-09-10 06:27:00,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:27:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205917 states. [2019-09-10 06:27:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205917 to 117903. [2019-09-10 06:27:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117903 states. [2019-09-10 06:27:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117903 states to 117903 states and 173023 transitions. [2019-09-10 06:27:04,440 INFO L78 Accepts]: Start accepts. Automaton has 117903 states and 173023 transitions. Word has length 318 [2019-09-10 06:27:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:04,441 INFO L475 AbstractCegarLoop]: Abstraction has 117903 states and 173023 transitions. [2019-09-10 06:27:04,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 117903 states and 173023 transitions. [2019-09-10 06:27:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 06:27:04,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:04,522 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] [2019-09-10 06:27:04,523 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:04,523 INFO L82 PathProgramCache]: Analyzing trace with hash -168370870, now seen corresponding path program 1 times [2019-09-10 06:27:04,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:04,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:04,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:04,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:04,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 06:27:04,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:04,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:04,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:04,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:04,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:04,663 INFO L87 Difference]: Start difference. First operand 117903 states and 173023 transitions. Second operand 3 states. [2019-09-10 06:27:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:05,127 INFO L93 Difference]: Finished difference Result 207810 states and 304222 transitions. [2019-09-10 06:27:05,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:05,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-10 06:27:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:05,355 INFO L225 Difference]: With dead ends: 207810 [2019-09-10 06:27:05,355 INFO L226 Difference]: Without dead ends: 207810 [2019-09-10 06:27:05,356 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 06:27:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207810 states. [2019-09-10 06:27:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207810 to 118384. [2019-09-10 06:27:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118384 states. [2019-09-10 06:27:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118384 states to 118384 states and 173621 transitions. [2019-09-10 06:27:07,532 INFO L78 Accepts]: Start accepts. Automaton has 118384 states and 173621 transitions. Word has length 321 [2019-09-10 06:27:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:07,532 INFO L475 AbstractCegarLoop]: Abstraction has 118384 states and 173621 transitions. [2019-09-10 06:27:07,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 118384 states and 173621 transitions. [2019-09-10 06:27:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:27:07,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:07,611 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] [2019-09-10 06:27:07,611 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:07,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:07,612 INFO L82 PathProgramCache]: Analyzing trace with hash 436074777, now seen corresponding path program 1 times [2019-09-10 06:27:07,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:07,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:07,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:07,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:07,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:27:10,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:10,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:10,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:10,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:10,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:10,491 INFO L87 Difference]: Start difference. First operand 118384 states and 173621 transitions. Second operand 4 states. [2019-09-10 06:27:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:10,720 INFO L93 Difference]: Finished difference Result 110108 states and 161640 transitions. [2019-09-10 06:27:10,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:10,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 06:27:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:10,806 INFO L225 Difference]: With dead ends: 110108 [2019-09-10 06:27:10,806 INFO L226 Difference]: Without dead ends: 105940 [2019-09-10 06:27:10,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:27:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105940 states. [2019-09-10 06:27:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105940 to 105613. [2019-09-10 06:27:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105613 states. [2019-09-10 06:27:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105613 states to 105613 states and 154775 transitions. [2019-09-10 06:27:11,684 INFO L78 Accepts]: Start accepts. Automaton has 105613 states and 154775 transitions. Word has length 322 [2019-09-10 06:27:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:11,684 INFO L475 AbstractCegarLoop]: Abstraction has 105613 states and 154775 transitions. [2019-09-10 06:27:11,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 105613 states and 154775 transitions. [2019-09-10 06:27:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:27:11,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:11,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:27:11,754 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:11,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:11,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1412998321, now seen corresponding path program 1 times [2019-09-10 06:27:11,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:11,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:11,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:11,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:11,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:27:11,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:11,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:11,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:11,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:11,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:11,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:11,904 INFO L87 Difference]: Start difference. First operand 105613 states and 154775 transitions. Second operand 3 states. [2019-09-10 06:27:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:13,495 INFO L93 Difference]: Finished difference Result 185346 states and 270251 transitions. [2019-09-10 06:27:13,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:13,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 06:27:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:13,633 INFO L225 Difference]: With dead ends: 185346 [2019-09-10 06:27:13,633 INFO L226 Difference]: Without dead ends: 185346 [2019-09-10 06:27:13,633 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 06:27:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185346 states. [2019-09-10 06:27:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185346 to 185164. [2019-09-10 06:27:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185164 states. [2019-09-10 06:27:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185164 states to 185164 states and 270001 transitions. [2019-09-10 06:27:15,957 INFO L78 Accepts]: Start accepts. Automaton has 185164 states and 270001 transitions. Word has length 326 [2019-09-10 06:27:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:15,957 INFO L475 AbstractCegarLoop]: Abstraction has 185164 states and 270001 transitions. [2019-09-10 06:27:15,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 185164 states and 270001 transitions. [2019-09-10 06:27:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:27:16,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:16,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:16,078 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 682019360, now seen corresponding path program 1 times [2019-09-10 06:27:16,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:16,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:16,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:16,509 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 06:27:16,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:16,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:27:16,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:16,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:27:16,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:27:16,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:27:16,511 INFO L87 Difference]: Start difference. First operand 185164 states and 270001 transitions. Second operand 8 states. [2019-09-10 06:27:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:17,581 INFO L93 Difference]: Finished difference Result 315176 states and 453890 transitions. [2019-09-10 06:27:17,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:17,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 326 [2019-09-10 06:27:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:18,043 INFO L225 Difference]: With dead ends: 315176 [2019-09-10 06:27:18,043 INFO L226 Difference]: Without dead ends: 315176 [2019-09-10 06:27:18,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:27:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315176 states. [2019-09-10 06:27:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315176 to 315174. [2019-09-10 06:27:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315174 states. [2019-09-10 06:27:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315174 states to 315174 states and 453889 transitions. [2019-09-10 06:27:25,718 INFO L78 Accepts]: Start accepts. Automaton has 315174 states and 453889 transitions. Word has length 326 [2019-09-10 06:27:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:25,718 INFO L475 AbstractCegarLoop]: Abstraction has 315174 states and 453889 transitions. [2019-09-10 06:27:25,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:27:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 315174 states and 453889 transitions. [2019-09-10 06:27:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:27:25,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:25,941 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:25,941 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash -725135157, now seen corresponding path program 1 times [2019-09-10 06:27:25,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:25,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:25,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:25,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:25,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:26,532 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 06:27:26,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:26,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:26,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:26,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:26,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:26,535 INFO L87 Difference]: Start difference. First operand 315174 states and 453889 transitions. Second operand 4 states. [2019-09-10 06:27:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:27,870 INFO L93 Difference]: Finished difference Result 584012 states and 834175 transitions. [2019-09-10 06:27:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:27,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 06:27:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:34,799 INFO L225 Difference]: With dead ends: 584012 [2019-09-10 06:27:34,799 INFO L226 Difference]: Without dead ends: 584012 [2019-09-10 06:27:34,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:27:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584012 states. [2019-09-10 06:27:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584012 to 583912. [2019-09-10 06:27:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583912 states. [2019-09-10 06:27:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583912 states to 583912 states and 834051 transitions. [2019-09-10 06:27:41,294 INFO L78 Accepts]: Start accepts. Automaton has 583912 states and 834051 transitions. Word has length 326 [2019-09-10 06:27:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:41,294 INFO L475 AbstractCegarLoop]: Abstraction has 583912 states and 834051 transitions. [2019-09-10 06:27:41,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 583912 states and 834051 transitions. [2019-09-10 06:27:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 06:27:41,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:41,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:27:41,715 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash 937142803, now seen corresponding path program 1 times [2019-09-10 06:27:41,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:41,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:43,183 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 06:27:43,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:43,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:43,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:43,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:43,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:43,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:43,185 INFO L87 Difference]: Start difference. First operand 583912 states and 834051 transitions. Second operand 3 states. [2019-09-10 06:27:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:54,557 INFO L93 Difference]: Finished difference Result 1141781 states and 1615278 transitions. [2019-09-10 06:27:54,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:54,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 06:27:54,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:55,689 INFO L225 Difference]: With dead ends: 1141781 [2019-09-10 06:27:55,690 INFO L226 Difference]: Without dead ends: 1141781 [2019-09-10 06:27:55,690 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 06:27:56,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141781 states. [2019-09-10 06:28:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141781 to 1141445. [2019-09-10 06:28:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141445 states. [2019-09-10 06:28:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141445 states to 1141445 states and 1614871 transitions. [2019-09-10 06:28:26,818 INFO L78 Accepts]: Start accepts. Automaton has 1141445 states and 1614871 transitions. Word has length 328 [2019-09-10 06:28:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:26,818 INFO L475 AbstractCegarLoop]: Abstraction has 1141445 states and 1614871 transitions. [2019-09-10 06:28:26,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:28:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1141445 states and 1614871 transitions. [2019-09-10 06:28:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 06:28:39,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:39,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:28:39,093 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:39,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1051888174, now seen corresponding path program 1 times [2019-09-10 06:28:39,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:39,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:39,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:39,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:39,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:28:39,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:39,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:28:39,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:39,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:28:39,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:28:39,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:28:39,381 INFO L87 Difference]: Start difference. First operand 1141445 states and 1614871 transitions. Second operand 3 states. [2019-09-10 06:28:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:58,456 INFO L93 Difference]: Finished difference Result 2102011 states and 2939179 transitions. [2019-09-10 06:28:58,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:58,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 06:28:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:01,065 INFO L225 Difference]: With dead ends: 2102011 [2019-09-10 06:29:01,065 INFO L226 Difference]: Without dead ends: 2102011 [2019-09-10 06:29:01,066 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 06:29:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102011 states.