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/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 05:00:35,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 05:00:35,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 05:00:35,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 05:00:35,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 05:00:35,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 05:00:35,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 05:00:35,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 05:00:35,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 05:00:35,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 05:00:35,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 05:00:35,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 05:00:35,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 05:00:35,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 05:00:35,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 05:00:35,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 05:00:35,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 05:00:35,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 05:00:35,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 05:00:35,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 05:00:35,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 05:00:35,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 05:00:35,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 05:00:35,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 05:00:35,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 05:00:35,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 05:00:35,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 05:00:35,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 05:00:35,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 05:00:35,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 05:00:35,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 05:00:35,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 05:00:35,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 05:00:35,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 05:00:35,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 05:00:35,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 05:00:35,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 05:00:35,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 05:00:35,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 05:00:35,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 05:00:35,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 05:00:35,325 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 05:00:35,339 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 05:00:35,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 05:00:35,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 05:00:35,340 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 05:00:35,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 05:00:35,341 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 05:00:35,341 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 05:00:35,341 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 05:00:35,342 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 05:00:35,342 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 05:00:35,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 05:00:35,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 05:00:35,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 05:00:35,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 05:00:35,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 05:00:35,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 05:00:35,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 05:00:35,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 05:00:35,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 05:00:35,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 05:00:35,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 05:00:35,345 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 05:00:35,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 05:00:35,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 05:00:35,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 05:00:35,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 05:00:35,346 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 05:00:35,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 05:00:35,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 05:00:35,346 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 05:00:35,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 05:00:35,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 05:00:35,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 05:00:35,393 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 05:00:35,394 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 05:00:35,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c [2019-09-10 05:00:35,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9d3b3bc4/95d394aad2674158a18f3a36e62e46b1/FLAG5645c84d5 [2019-09-10 05:00:36,031 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 05:00:36,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c [2019-09-10 05:00:36,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9d3b3bc4/95d394aad2674158a18f3a36e62e46b1/FLAG5645c84d5 [2019-09-10 05:00:36,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9d3b3bc4/95d394aad2674158a18f3a36e62e46b1 [2019-09-10 05:00:36,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 05:00:36,247 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 05:00:36,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 05:00:36,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 05:00:36,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 05:00:36,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:00:36" (1/1) ... [2019-09-10 05:00:36,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5367fa7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:36, skipping insertion in model container [2019-09-10 05:00:36,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:00:36" (1/1) ... [2019-09-10 05:00:36,266 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 05:00:36,352 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 05:00:36,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:00:36,976 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 05:00:37,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:00:37,250 INFO L192 MainTranslator]: Completed translation [2019-09-10 05:00:37,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37 WrapperNode [2019-09-10 05:00:37,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 05:00:37,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 05:00:37,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 05:00:37,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 05:00:37,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37" (1/1) ... [2019-09-10 05:00:37,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37" (1/1) ... [2019-09-10 05:00:37,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37" (1/1) ... [2019-09-10 05:00:37,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37" (1/1) ... [2019-09-10 05:00:37,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37" (1/1) ... [2019-09-10 05:00:37,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37" (1/1) ... [2019-09-10 05:00:37,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37" (1/1) ... [2019-09-10 05:00:37,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 05:00:37,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 05:00:37,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 05:00:37,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 05:00:37,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37" (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 05:00:37,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 05:00:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 05:00:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 05:00:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 05:00:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 05:00:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 05:00:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 05:00:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 05:00:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 05:00:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 05:00:37,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 05:00:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 05:00:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 05:00:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 05:00:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 05:00:37,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 05:00:37,584 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 05:00:37,584 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 05:00:37,584 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 05:00:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 05:00:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 05:00:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 05:00:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 05:00:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 05:00:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 05:00:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 05:00:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 05:00:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 05:00:40,194 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 05:00:40,195 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 05:00:40,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:00:40 BoogieIcfgContainer [2019-09-10 05:00:40,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 05:00:40,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 05:00:40,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 05:00:40,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 05:00:40,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 05:00:36" (1/3) ... [2019-09-10 05:00:40,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3c9e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:00:40, skipping insertion in model container [2019-09-10 05:00:40,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:00:37" (2/3) ... [2019-09-10 05:00:40,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3c9e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:00:40, skipping insertion in model container [2019-09-10 05:00:40,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:00:40" (3/3) ... [2019-09-10 05:00:40,205 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c [2019-09-10 05:00:40,216 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 05:00:40,225 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 05:00:40,241 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 05:00:40,270 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 05:00:40,270 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 05:00:40,270 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 05:00:40,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 05:00:40,271 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 05:00:40,271 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 05:00:40,271 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 05:00:40,271 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 05:00:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states. [2019-09-10 05:00:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 05:00:40,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:40,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:40,353 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1475452421, now seen corresponding path program 1 times [2019-09-10 05:00:40,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:40,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:40,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:40,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:40,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:41,199 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 05:00:41,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:41,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:00:41,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:41,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:00:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:00:41,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:00:41,229 INFO L87 Difference]: Start difference. First operand 747 states. Second operand 5 states. [2019-09-10 05:00:41,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:41,552 INFO L93 Difference]: Finished difference Result 751 states and 1349 transitions. [2019-09-10 05:00:41,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 05:00:41,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-09-10 05:00:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:41,581 INFO L225 Difference]: With dead ends: 751 [2019-09-10 05:00:41,581 INFO L226 Difference]: Without dead ends: 742 [2019-09-10 05:00:41,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-10 05:00:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2019-09-10 05:00:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-09-10 05:00:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1296 transitions. [2019-09-10 05:00:41,698 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1296 transitions. Word has length 181 [2019-09-10 05:00:41,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:41,702 INFO L475 AbstractCegarLoop]: Abstraction has 742 states and 1296 transitions. [2019-09-10 05:00:41,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:00:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1296 transitions. [2019-09-10 05:00:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 05:00:41,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:41,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:41,713 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1386697677, now seen corresponding path program 1 times [2019-09-10 05:00:41,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:41,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:41,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:42,141 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 05:00:42,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:42,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:00:42,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:42,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:00:42,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:00:42,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:00:42,145 INFO L87 Difference]: Start difference. First operand 742 states and 1296 transitions. Second operand 5 states. [2019-09-10 05:00:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:45,201 INFO L93 Difference]: Finished difference Result 945 states and 1621 transitions. [2019-09-10 05:00:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 05:00:45,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-09-10 05:00:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:45,212 INFO L225 Difference]: With dead ends: 945 [2019-09-10 05:00:45,212 INFO L226 Difference]: Without dead ends: 945 [2019-09-10 05:00:45,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-10 05:00:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 933. [2019-09-10 05:00:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-10 05:00:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1606 transitions. [2019-09-10 05:00:45,286 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1606 transitions. Word has length 225 [2019-09-10 05:00:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:45,289 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1606 transitions. [2019-09-10 05:00:45,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:00:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1606 transitions. [2019-09-10 05:00:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 05:00:45,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:45,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:45,295 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1222733989, now seen corresponding path program 1 times [2019-09-10 05:00:45,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:45,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:45,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:45,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:45,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:45,492 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 05:00:45,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:45,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:00:45,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:45,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:00:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:00:45,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:00:45,495 INFO L87 Difference]: Start difference. First operand 933 states and 1606 transitions. Second operand 5 states. [2019-09-10 05:00:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:48,381 INFO L93 Difference]: Finished difference Result 1315 states and 2221 transitions. [2019-09-10 05:00:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:00:48,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-09-10 05:00:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:48,389 INFO L225 Difference]: With dead ends: 1315 [2019-09-10 05:00:48,389 INFO L226 Difference]: Without dead ends: 1315 [2019-09-10 05:00:48,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:00:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-09-10 05:00:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1307. [2019-09-10 05:00:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2019-09-10 05:00:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 2214 transitions. [2019-09-10 05:00:48,447 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 2214 transitions. Word has length 229 [2019-09-10 05:00:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:48,448 INFO L475 AbstractCegarLoop]: Abstraction has 1307 states and 2214 transitions. [2019-09-10 05:00:48,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:00:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2214 transitions. [2019-09-10 05:00:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 05:00:48,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:48,453 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] [2019-09-10 05:00:48,454 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -336596621, now seen corresponding path program 1 times [2019-09-10 05:00:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:48,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:48,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:48,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:48,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:48,763 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 05:00:48,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:48,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:00:48,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:48,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:00:48,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:00:48,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:00:48,767 INFO L87 Difference]: Start difference. First operand 1307 states and 2214 transitions. Second operand 5 states. [2019-09-10 05:00:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:51,678 INFO L93 Difference]: Finished difference Result 2049 states and 3403 transitions. [2019-09-10 05:00:51,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:00:51,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-09-10 05:00:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:51,691 INFO L225 Difference]: With dead ends: 2049 [2019-09-10 05:00:51,691 INFO L226 Difference]: Without dead ends: 2049 [2019-09-10 05:00:51,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:00:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2019-09-10 05:00:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2035. [2019-09-10 05:00:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-09-10 05:00:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3390 transitions. [2019-09-10 05:00:51,833 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3390 transitions. Word has length 233 [2019-09-10 05:00:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:51,834 INFO L475 AbstractCegarLoop]: Abstraction has 2035 states and 3390 transitions. [2019-09-10 05:00:51,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:00:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3390 transitions. [2019-09-10 05:00:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 05:00:51,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:51,841 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] [2019-09-10 05:00:51,842 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:51,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1906468507, now seen corresponding path program 1 times [2019-09-10 05:00:51,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:51,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:51,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:51,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:52,050 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 05:00:52,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:52,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:00:52,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:52,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:00:52,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:00:52,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:00:52,053 INFO L87 Difference]: Start difference. First operand 2035 states and 3390 transitions. Second operand 5 states. [2019-09-10 05:00:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:54,895 INFO L93 Difference]: Finished difference Result 3477 states and 5687 transitions. [2019-09-10 05:00:54,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:00:54,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 05:00:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:54,920 INFO L225 Difference]: With dead ends: 3477 [2019-09-10 05:00:54,920 INFO L226 Difference]: Without dead ends: 3477 [2019-09-10 05:00:54,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:00:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2019-09-10 05:00:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3451. [2019-09-10 05:00:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3451 states. [2019-09-10 05:00:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5662 transitions. [2019-09-10 05:00:55,039 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5662 transitions. Word has length 237 [2019-09-10 05:00:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:55,040 INFO L475 AbstractCegarLoop]: Abstraction has 3451 states and 5662 transitions. [2019-09-10 05:00:55,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:00:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5662 transitions. [2019-09-10 05:00:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 05:00:55,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:55,049 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] [2019-09-10 05:00:55,049 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:55,049 INFO L82 PathProgramCache]: Analyzing trace with hash 350717107, now seen corresponding path program 1 times [2019-09-10 05:00:55,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:55,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:55,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:55,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:55,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:55,237 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 05:00:55,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:55,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:00:55,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:55,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:00:55,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:00:55,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:00:55,240 INFO L87 Difference]: Start difference. First operand 3451 states and 5662 transitions. Second operand 5 states. [2019-09-10 05:00:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:58,060 INFO L93 Difference]: Finished difference Result 6253 states and 10095 transitions. [2019-09-10 05:00:58,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:00:58,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 241 [2019-09-10 05:00:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:58,102 INFO L225 Difference]: With dead ends: 6253 [2019-09-10 05:00:58,103 INFO L226 Difference]: Without dead ends: 6253 [2019-09-10 05:00:58,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:00:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6253 states. [2019-09-10 05:00:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6253 to 6203. [2019-09-10 05:00:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2019-09-10 05:00:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 10046 transitions. [2019-09-10 05:00:58,494 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 10046 transitions. Word has length 241 [2019-09-10 05:00:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:58,503 INFO L475 AbstractCegarLoop]: Abstraction has 6203 states and 10046 transitions. [2019-09-10 05:00:58,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:00:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 10046 transitions. [2019-09-10 05:00:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 05:00:58,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:58,513 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] [2019-09-10 05:00:58,514 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:58,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1025695397, now seen corresponding path program 1 times [2019-09-10 05:00:58,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:58,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:58,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:58,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:00:59,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:59,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:00:59,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:59,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:00:59,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:00:59,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:00:59,040 INFO L87 Difference]: Start difference. First operand 6203 states and 10046 transitions. Second operand 13 states. [2019-09-10 05:01:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:14,644 INFO L93 Difference]: Finished difference Result 41290 states and 67220 transitions. [2019-09-10 05:01:14,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 05:01:14,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 245 [2019-09-10 05:01:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:14,870 INFO L225 Difference]: With dead ends: 41290 [2019-09-10 05:01:14,870 INFO L226 Difference]: Without dead ends: 41290 [2019-09-10 05:01:14,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 05:01:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41290 states. [2019-09-10 05:01:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41290 to 37674. [2019-09-10 05:01:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37674 states. [2019-09-10 05:01:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37674 states to 37674 states and 61368 transitions. [2019-09-10 05:01:16,651 INFO L78 Accepts]: Start accepts. Automaton has 37674 states and 61368 transitions. Word has length 245 [2019-09-10 05:01:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:16,652 INFO L475 AbstractCegarLoop]: Abstraction has 37674 states and 61368 transitions. [2019-09-10 05:01:16,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 05:01:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 37674 states and 61368 transitions. [2019-09-10 05:01:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 05:01:16,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:16,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:16,674 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:16,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:16,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1549290629, now seen corresponding path program 1 times [2019-09-10 05:01:16,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:16,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:16,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:16,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:16,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:16,990 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 05:01:16,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:16,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:01:16,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:16,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:01:16,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:01:16,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:01:16,992 INFO L87 Difference]: Start difference. First operand 37674 states and 61368 transitions. Second operand 6 states. [2019-09-10 05:01:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:21,357 INFO L93 Difference]: Finished difference Result 58875 states and 95880 transitions. [2019-09-10 05:01:21,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 05:01:21,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-09-10 05:01:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:21,572 INFO L225 Difference]: With dead ends: 58875 [2019-09-10 05:01:21,572 INFO L226 Difference]: Without dead ends: 58875 [2019-09-10 05:01:21,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:01:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58875 states. [2019-09-10 05:01:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58875 to 55703. [2019-09-10 05:01:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55703 states. [2019-09-10 05:01:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55703 states to 55703 states and 90823 transitions. [2019-09-10 05:01:22,975 INFO L78 Accepts]: Start accepts. Automaton has 55703 states and 90823 transitions. Word has length 246 [2019-09-10 05:01:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:22,976 INFO L475 AbstractCegarLoop]: Abstraction has 55703 states and 90823 transitions. [2019-09-10 05:01:22,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:01:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 55703 states and 90823 transitions. [2019-09-10 05:01:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 05:01:23,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:23,003 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] [2019-09-10 05:01:23,003 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash -414166637, now seen corresponding path program 1 times [2019-09-10 05:01:23,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:23,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:23,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:23,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:23,309 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 05:01:23,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:23,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:01:23,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:23,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:01:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:01:23,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:01:23,311 INFO L87 Difference]: Start difference. First operand 55703 states and 90823 transitions. Second operand 6 states. [2019-09-10 05:01:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:27,349 INFO L93 Difference]: Finished difference Result 58552 states and 95842 transitions. [2019-09-10 05:01:27,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:01:27,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 247 [2019-09-10 05:01:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:27,571 INFO L225 Difference]: With dead ends: 58552 [2019-09-10 05:01:27,571 INFO L226 Difference]: Without dead ends: 58552 [2019-09-10 05:01:27,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:01:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58552 states. [2019-09-10 05:01:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58552 to 55801. [2019-09-10 05:01:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55801 states. [2019-09-10 05:01:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55801 states to 55801 states and 90787 transitions. [2019-09-10 05:01:29,014 INFO L78 Accepts]: Start accepts. Automaton has 55801 states and 90787 transitions. Word has length 247 [2019-09-10 05:01:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:29,015 INFO L475 AbstractCegarLoop]: Abstraction has 55801 states and 90787 transitions. [2019-09-10 05:01:29,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:01:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 55801 states and 90787 transitions. [2019-09-10 05:01:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 05:01:29,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:29,031 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] [2019-09-10 05:01:29,031 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1123406781, now seen corresponding path program 1 times [2019-09-10 05:01:29,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:29,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:29,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 05:01:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:01:29,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:29,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:01:29,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:01:29,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:01:29,421 INFO L87 Difference]: Start difference. First operand 55801 states and 90787 transitions. Second operand 13 states. [2019-09-10 05:01:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:48,921 INFO L93 Difference]: Finished difference Result 113722 states and 185120 transitions. [2019-09-10 05:01:48,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 05:01:48,922 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 247 [2019-09-10 05:01:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:49,275 INFO L225 Difference]: With dead ends: 113722 [2019-09-10 05:01:49,276 INFO L226 Difference]: Without dead ends: 113722 [2019-09-10 05:01:49,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1055, Invalid=4495, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 05:01:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113722 states. [2019-09-10 05:01:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113722 to 109992. [2019-09-10 05:01:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109992 states. [2019-09-10 05:01:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109992 states to 109992 states and 179302 transitions. [2019-09-10 05:01:51,719 INFO L78 Accepts]: Start accepts. Automaton has 109992 states and 179302 transitions. Word has length 247 [2019-09-10 05:01:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:51,720 INFO L475 AbstractCegarLoop]: Abstraction has 109992 states and 179302 transitions. [2019-09-10 05:01:51,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 05:01:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 109992 states and 179302 transitions. [2019-09-10 05:01:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 05:01:51,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:51,738 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] [2019-09-10 05:01:51,739 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:51,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:51,739 INFO L82 PathProgramCache]: Analyzing trace with hash -743652973, now seen corresponding path program 1 times [2019-09-10 05:01:51,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:51,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:51,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:51,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:51,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:52,193 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 05:01:52,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:52,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:01:52,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:52,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:01:52,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:01:52,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:01:52,195 INFO L87 Difference]: Start difference. First operand 109992 states and 179302 transitions. Second operand 13 states. [2019-09-10 05:02:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:02:10,603 INFO L93 Difference]: Finished difference Result 133905 states and 218170 transitions. [2019-09-10 05:02:10,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 05:02:10,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 247 [2019-09-10 05:02:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:02:11,009 INFO L225 Difference]: With dead ends: 133905 [2019-09-10 05:02:11,009 INFO L226 Difference]: Without dead ends: 133905 [2019-09-10 05:02:11,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 05:02:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133905 states. [2019-09-10 05:02:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133905 to 123085. [2019-09-10 05:02:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123085 states. [2019-09-10 05:02:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123085 states to 123085 states and 200630 transitions. [2019-09-10 05:02:13,019 INFO L78 Accepts]: Start accepts. Automaton has 123085 states and 200630 transitions. Word has length 247 [2019-09-10 05:02:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:02:13,020 INFO L475 AbstractCegarLoop]: Abstraction has 123085 states and 200630 transitions. [2019-09-10 05:02:13,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 05:02:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 123085 states and 200630 transitions. [2019-09-10 05:02:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 05:02:13,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:02:13,037 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] [2019-09-10 05:02:13,037 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:02:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:02:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2025471165, now seen corresponding path program 1 times [2019-09-10 05:02:13,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:02:13,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:13,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:02:13,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:13,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:02:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:02:13,960 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 05:02:13,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:02:13,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:02:13,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:02:13,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:02:13,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:02:13,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:02:13,965 INFO L87 Difference]: Start difference. First operand 123085 states and 200630 transitions. Second operand 13 states. [2019-09-10 05:02:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:02:32,365 INFO L93 Difference]: Finished difference Result 162177 states and 264636 transitions. [2019-09-10 05:02:32,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 05:02:32,366 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 247 [2019-09-10 05:02:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:02:32,864 INFO L225 Difference]: With dead ends: 162177 [2019-09-10 05:02:32,865 INFO L226 Difference]: Without dead ends: 162177 [2019-09-10 05:02:32,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 05:02:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162177 states. [2019-09-10 05:02:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162177 to 144457. [2019-09-10 05:02:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144457 states. [2019-09-10 05:02:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144457 states to 144457 states and 235772 transitions. [2019-09-10 05:02:37,351 INFO L78 Accepts]: Start accepts. Automaton has 144457 states and 235772 transitions. Word has length 247 [2019-09-10 05:02:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:02:37,351 INFO L475 AbstractCegarLoop]: Abstraction has 144457 states and 235772 transitions. [2019-09-10 05:02:37,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 05:02:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 144457 states and 235772 transitions. [2019-09-10 05:02:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 05:02:37,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:02:37,369 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] [2019-09-10 05:02:37,370 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:02:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:02:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1188181075, now seen corresponding path program 1 times [2019-09-10 05:02:37,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:02:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:37,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:02:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:37,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:02:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:02:37,754 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 05:02:37,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:02:37,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:02:37,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:02:37,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:02:37,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:02:37,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:02:37,756 INFO L87 Difference]: Start difference. First operand 144457 states and 235772 transitions. Second operand 13 states. [2019-09-10 05:02:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:02:56,444 INFO L93 Difference]: Finished difference Result 224017 states and 366250 transitions. [2019-09-10 05:02:56,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 05:02:56,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 247 [2019-09-10 05:02:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:02:57,031 INFO L225 Difference]: With dead ends: 224017 [2019-09-10 05:02:57,031 INFO L226 Difference]: Without dead ends: 224017 [2019-09-10 05:02:57,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1027, Invalid=4375, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 05:02:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224017 states. [2019-09-10 05:02:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224017 to 202649. [2019-09-10 05:02:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202649 states. [2019-09-10 05:02:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202649 states to 202649 states and 331810 transitions. [2019-09-10 05:02:59,858 INFO L78 Accepts]: Start accepts. Automaton has 202649 states and 331810 transitions. Word has length 247 [2019-09-10 05:02:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:02:59,859 INFO L475 AbstractCegarLoop]: Abstraction has 202649 states and 331810 transitions. [2019-09-10 05:02:59,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 05:02:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 202649 states and 331810 transitions. [2019-09-10 05:02:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 05:02:59,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:02:59,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:59,869 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:02:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:02:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash -282206126, now seen corresponding path program 1 times [2019-09-10 05:02:59,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:02:59,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:59,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:02:59,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:59,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:02:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:00,092 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 05:03:00,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:00,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:03:00,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:00,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:03:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:03:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:03:00,094 INFO L87 Difference]: Start difference. First operand 202649 states and 331810 transitions. Second operand 6 states. [2019-09-10 05:03:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:08,887 INFO L93 Difference]: Finished difference Result 267142 states and 435800 transitions. [2019-09-10 05:03:08,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 05:03:08,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 247 [2019-09-10 05:03:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:09,633 INFO L225 Difference]: With dead ends: 267142 [2019-09-10 05:03:09,633 INFO L226 Difference]: Without dead ends: 267142 [2019-09-10 05:03:09,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-10 05:03:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267142 states. [2019-09-10 05:03:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267142 to 265371. [2019-09-10 05:03:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265371 states. [2019-09-10 05:03:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265371 states to 265371 states and 434031 transitions. [2019-09-10 05:03:13,386 INFO L78 Accepts]: Start accepts. Automaton has 265371 states and 434031 transitions. Word has length 247 [2019-09-10 05:03:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:13,387 INFO L475 AbstractCegarLoop]: Abstraction has 265371 states and 434031 transitions. [2019-09-10 05:03:13,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:03:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 265371 states and 434031 transitions. [2019-09-10 05:03:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 05:03:13,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:13,403 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] [2019-09-10 05:03:13,404 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1275715620, now seen corresponding path program 1 times [2019-09-10 05:03:13,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:13,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:13,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:13,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:13,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:13,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 05:03:13,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:13,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:03:13,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:13,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:03:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:03:13,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:03:13,615 INFO L87 Difference]: Start difference. First operand 265371 states and 434031 transitions. Second operand 6 states. [2019-09-10 05:03:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:20,969 INFO L93 Difference]: Finished difference Result 525574 states and 857525 transitions. [2019-09-10 05:03:20,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:03:20,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-10 05:03:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:22,295 INFO L225 Difference]: With dead ends: 525574 [2019-09-10 05:03:22,295 INFO L226 Difference]: Without dead ends: 525574 [2019-09-10 05:03:22,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:03:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525574 states. [2019-09-10 05:03:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525574 to 523080. [2019-09-10 05:03:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523080 states. [2019-09-10 05:03:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523080 states to 523080 states and 854069 transitions. [2019-09-10 05:03:43,101 INFO L78 Accepts]: Start accepts. Automaton has 523080 states and 854069 transitions. Word has length 248 [2019-09-10 05:03:43,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:43,101 INFO L475 AbstractCegarLoop]: Abstraction has 523080 states and 854069 transitions. [2019-09-10 05:03:43,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:03:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 523080 states and 854069 transitions. [2019-09-10 05:03:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 05:03:43,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:43,118 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] [2019-09-10 05:03:43,118 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1722151748, now seen corresponding path program 1 times [2019-09-10 05:03:43,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:43,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:43,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:43,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:43,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:43,397 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 05:03:43,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:43,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 05:03:43,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:43,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 05:03:43,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 05:03:43,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:03:43,402 INFO L87 Difference]: Start difference. First operand 523080 states and 854069 transitions. Second operand 7 states. [2019-09-10 05:03:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:54,589 INFO L93 Difference]: Finished difference Result 677992 states and 1108022 transitions. [2019-09-10 05:03:54,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 05:03:54,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 249 [2019-09-10 05:03:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:57,445 INFO L225 Difference]: With dead ends: 677992 [2019-09-10 05:03:57,445 INFO L226 Difference]: Without dead ends: 677992 [2019-09-10 05:03:57,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-10 05:03:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677992 states. [2019-09-10 05:04:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677992 to 677208. [2019-09-10 05:04:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677208 states. [2019-09-10 05:04:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677208 states to 677208 states and 1106463 transitions. [2019-09-10 05:04:16,404 INFO L78 Accepts]: Start accepts. Automaton has 677208 states and 1106463 transitions. Word has length 249 [2019-09-10 05:04:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:04:16,404 INFO L475 AbstractCegarLoop]: Abstraction has 677208 states and 1106463 transitions. [2019-09-10 05:04:16,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 05:04:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 677208 states and 1106463 transitions. [2019-09-10 05:04:16,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 05:04:16,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:04:16,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:04:16,419 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:04:16,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:04:16,419 INFO L82 PathProgramCache]: Analyzing trace with hash -155012485, now seen corresponding path program 1 times [2019-09-10 05:04:16,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:04:16,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:16,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:04:16,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:16,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:04:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:04:16,775 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 05:04:16,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:04:16,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:04:16,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:04:16,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:04:16,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:04:16,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:04:16,779 INFO L87 Difference]: Start difference. First operand 677208 states and 1106463 transitions. Second operand 6 states. [2019-09-10 05:04:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:04:32,091 INFO L93 Difference]: Finished difference Result 727622 states and 1224562 transitions. [2019-09-10 05:04:32,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:04:32,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 05:04:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:04:35,846 INFO L225 Difference]: With dead ends: 727622 [2019-09-10 05:04:35,846 INFO L226 Difference]: Without dead ends: 727622 [2019-09-10 05:04:35,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 05:04:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727622 states. [2019-09-10 05:04:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727622 to 683808. [2019-09-10 05:04:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683808 states. [2019-09-10 05:04:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683808 states to 683808 states and 1116663 transitions. [2019-09-10 05:04:57,262 INFO L78 Accepts]: Start accepts. Automaton has 683808 states and 1116663 transitions. Word has length 249 [2019-09-10 05:04:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:04:57,262 INFO L475 AbstractCegarLoop]: Abstraction has 683808 states and 1116663 transitions. [2019-09-10 05:04:57,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:04:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 683808 states and 1116663 transitions. [2019-09-10 05:04:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 05:04:57,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:04:57,270 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] [2019-09-10 05:04:57,271 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:04:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:04:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1565641349, now seen corresponding path program 1 times [2019-09-10 05:04:57,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:04:57,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:57,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:04:57,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:57,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:04:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:04:57,616 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 05:04:57,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:04:57,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:04:57,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:04:57,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:04:57,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:04:57,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:04:57,618 INFO L87 Difference]: Start difference. First operand 683808 states and 1116663 transitions. Second operand 6 states. [2019-09-10 05:05:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:12,521 INFO L93 Difference]: Finished difference Result 733406 states and 1231796 transitions. [2019-09-10 05:05:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:05:12,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 05:05:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:15,870 INFO L225 Difference]: With dead ends: 733406 [2019-09-10 05:05:15,870 INFO L226 Difference]: Without dead ends: 733406 [2019-09-10 05:05:15,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 05:05:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733406 states. [2019-09-10 05:05:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733406 to 689132. [2019-09-10 05:05:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689132 states. [2019-09-10 05:05:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689132 states to 689132 states and 1124891 transitions. [2019-09-10 05:05:46,079 INFO L78 Accepts]: Start accepts. Automaton has 689132 states and 1124891 transitions. Word has length 249 [2019-09-10 05:05:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:46,079 INFO L475 AbstractCegarLoop]: Abstraction has 689132 states and 1124891 transitions. [2019-09-10 05:05:46,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:05:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 689132 states and 1124891 transitions. [2019-09-10 05:05:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 05:05:46,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:46,083 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] [2019-09-10 05:05:46,084 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:46,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:46,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1818624965, now seen corresponding path program 1 times [2019-09-10 05:05:46,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:46,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:46,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:46,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:46,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:46,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 05:05:46,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:46,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:46,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:46,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:46,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:46,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:46,426 INFO L87 Difference]: Start difference. First operand 689132 states and 1124891 transitions. Second operand 6 states. [2019-09-10 05:05:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:55,298 INFO L93 Difference]: Finished difference Result 752746 states and 1260042 transitions. [2019-09-10 05:05:55,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:05:55,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 05:05:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:58,275 INFO L225 Difference]: With dead ends: 752746 [2019-09-10 05:05:58,275 INFO L226 Difference]: Without dead ends: 752746 [2019-09-10 05:05:58,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 05:05:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752746 states. [2019-09-10 05:06:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752746 to 700704. [2019-09-10 05:06:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700704 states. [2019-09-10 05:06:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700704 states to 700704 states and 1143827 transitions. [2019-09-10 05:06:21,336 INFO L78 Accepts]: Start accepts. Automaton has 700704 states and 1143827 transitions. Word has length 249 [2019-09-10 05:06:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:06:21,337 INFO L475 AbstractCegarLoop]: Abstraction has 700704 states and 1143827 transitions. [2019-09-10 05:06:21,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:06:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 700704 states and 1143827 transitions. [2019-09-10 05:06:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 05:06:21,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:06:21,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:06:21,341 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:06:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:06:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2061423799, now seen corresponding path program 1 times [2019-09-10 05:06:21,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:06:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:06:21,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:06:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:06:21,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:06:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:06:21,538 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 05:06:21,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:06:21,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:06:21,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:06:21,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:06:21,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:06:21,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:06:21,540 INFO L87 Difference]: Start difference. First operand 700704 states and 1143827 transitions. Second operand 6 states. [2019-09-10 05:06:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:06:42,406 INFO L93 Difference]: Finished difference Result 1390558 states and 2269577 transitions. [2019-09-10 05:06:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:06:42,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 05:06:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:06:47,466 INFO L225 Difference]: With dead ends: 1390558 [2019-09-10 05:06:47,466 INFO L226 Difference]: Without dead ends: 1390558 [2019-09-10 05:06:47,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:06:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390558 states. [2019-09-10 05:07:31,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390558 to 1387802. [2019-09-10 05:07:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1387802 states.