java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:24:12,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:24:12,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:24:12,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:24:12,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:24:12,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:24:12,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:24:12,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:24:12,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:24:12,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:24:12,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:24:12,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:24:12,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:24:12,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:24:12,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:24:12,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:24:12,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:24:12,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:24:12,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:24:12,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:24:12,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:24:12,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:24:12,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:24:12,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:24:12,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:24:12,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:24:12,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:24:12,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:24:12,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:24:12,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:24:12,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:24:12,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:24:12,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:24:12,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:24:12,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:24:12,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:24:12,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:24:12,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:24:12,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:24:12,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:24:12,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:24:12,385 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 07:24:12,410 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:24:12,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:24:12,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:24:12,412 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:24:12,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:24:12,413 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:24:12,413 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:24:12,413 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:24:12,413 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:24:12,413 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:24:12,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:24:12,416 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:24:12,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:24:12,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:24:12,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:24:12,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:24:12,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:24:12,417 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:24:12,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:24:12,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:24:12,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:24:12,418 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:24:12,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:24:12,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:24:12,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:24:12,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:24:12,419 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:24:12,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:24:12,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:24:12,419 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:24:12,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:24:12,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:24:12,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:24:12,466 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:24:12,467 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:24:12,467 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:24:12,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82223af1e/f33b9c2697214e4a8f4616fab1020e25/FLAG3f5a6eb96 [2019-09-10 07:24:13,060 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:24:13,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:24:13,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82223af1e/f33b9c2697214e4a8f4616fab1020e25/FLAG3f5a6eb96 [2019-09-10 07:24:13,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82223af1e/f33b9c2697214e4a8f4616fab1020e25 [2019-09-10 07:24:13,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:24:13,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:24:13,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:24:13,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:24:13,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:24:13,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:24:13" (1/1) ... [2019-09-10 07:24:13,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0e01b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:13, skipping insertion in model container [2019-09-10 07:24:13,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:24:13" (1/1) ... [2019-09-10 07:24:13,411 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:24:13,484 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:24:13,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:24:13,979 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:24:14,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:24:14,133 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:24:14,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14 WrapperNode [2019-09-10 07:24:14,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:24:14,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:24:14,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:24:14,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:24:14,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14" (1/1) ... [2019-09-10 07:24:14,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14" (1/1) ... [2019-09-10 07:24:14,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14" (1/1) ... [2019-09-10 07:24:14,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14" (1/1) ... [2019-09-10 07:24:14,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14" (1/1) ... [2019-09-10 07:24:14,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14" (1/1) ... [2019-09-10 07:24:14,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14" (1/1) ... [2019-09-10 07:24:14,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:24:14,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:24:14,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:24:14,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:24:14,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14" (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 07:24:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:24:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:24:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:24:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:24:14,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:24:14,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:24:14,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:24:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:24:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:24:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:24:14,318 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:24:14,319 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:24:14,319 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:24:14,320 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:24:14,320 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:24:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:24:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:24:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:24:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:24:14,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:24:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:24:14,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:24:15,501 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:24:15,501 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:24:15,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:24:15 BoogieIcfgContainer [2019-09-10 07:24:15,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:24:15,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:24:15,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:24:15,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:24:15,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:24:13" (1/3) ... [2019-09-10 07:24:15,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2f2a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:24:15, skipping insertion in model container [2019-09-10 07:24:15,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:24:14" (2/3) ... [2019-09-10 07:24:15,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2f2a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:24:15, skipping insertion in model container [2019-09-10 07:24:15,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:24:15" (3/3) ... [2019-09-10 07:24:15,517 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 07:24:15,527 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:24:15,549 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:24:15,568 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:24:15,603 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:24:15,603 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:24:15,603 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:24:15,603 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:24:15,604 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:24:15,604 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:24:15,604 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:24:15,604 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:24:15,643 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-10 07:24:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:24:15,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:15,668 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] [2019-09-10 07:24:15,670 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash 491419825, now seen corresponding path program 1 times [2019-09-10 07:24:15,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:15,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:15,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:15,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:16,214 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 07:24:16,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:16,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:24:16,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:16,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:24:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:24:16,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:16,248 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-09-10 07:24:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:16,435 INFO L93 Difference]: Finished difference Result 393 states and 652 transitions. [2019-09-10 07:24:16,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:16,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:24:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:16,468 INFO L225 Difference]: With dead ends: 393 [2019-09-10 07:24:16,469 INFO L226 Difference]: Without dead ends: 385 [2019-09-10 07:24:16,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:24:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-10 07:24:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-09-10 07:24:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-10 07:24:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 573 transitions. [2019-09-10 07:24:16,544 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 573 transitions. Word has length 99 [2019-09-10 07:24:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:16,545 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 573 transitions. [2019-09-10 07:24:16,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:24:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 573 transitions. [2019-09-10 07:24:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:24:16,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:16,551 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] [2019-09-10 07:24:16,552 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:16,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971141, now seen corresponding path program 1 times [2019-09-10 07:24:16,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:16,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:16,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:16,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:16,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:17,077 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 07:24:17,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:17,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:24:17,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:17,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:24:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:24:17,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:24:17,082 INFO L87 Difference]: Start difference. First operand 383 states and 573 transitions. Second operand 8 states. [2019-09-10 07:24:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:17,598 INFO L93 Difference]: Finished difference Result 1614 states and 2492 transitions. [2019-09-10 07:24:17,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:24:17,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-09-10 07:24:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:17,609 INFO L225 Difference]: With dead ends: 1614 [2019-09-10 07:24:17,609 INFO L226 Difference]: Without dead ends: 1614 [2019-09-10 07:24:17,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:24:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2019-09-10 07:24:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1604. [2019-09-10 07:24:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-09-10 07:24:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2487 transitions. [2019-09-10 07:24:17,689 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2487 transitions. Word has length 100 [2019-09-10 07:24:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:17,691 INFO L475 AbstractCegarLoop]: Abstraction has 1604 states and 2487 transitions. [2019-09-10 07:24:17,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:24:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2487 transitions. [2019-09-10 07:24:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:24:17,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:17,703 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] [2019-09-10 07:24:17,704 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash 808827414, now seen corresponding path program 1 times [2019-09-10 07:24:17,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:17,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:17,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:17,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:17,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:17,909 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 07:24:17,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:17,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:24:17,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:17,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:24:17,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:24:17,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:24:17,915 INFO L87 Difference]: Start difference. First operand 1604 states and 2487 transitions. Second operand 6 states. [2019-09-10 07:24:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:18,439 INFO L93 Difference]: Finished difference Result 4026 states and 6314 transitions. [2019-09-10 07:24:18,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:24:18,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-09-10 07:24:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:18,462 INFO L225 Difference]: With dead ends: 4026 [2019-09-10 07:24:18,463 INFO L226 Difference]: Without dead ends: 4026 [2019-09-10 07:24:18,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:24:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-09-10 07:24:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 4022. [2019-09-10 07:24:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2019-09-10 07:24:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 6312 transitions. [2019-09-10 07:24:18,578 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 6312 transitions. Word has length 101 [2019-09-10 07:24:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:18,580 INFO L475 AbstractCegarLoop]: Abstraction has 4022 states and 6312 transitions. [2019-09-10 07:24:18,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:24:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 6312 transitions. [2019-09-10 07:24:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:24:18,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:18,585 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] [2019-09-10 07:24:18,585 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1012476340, now seen corresponding path program 1 times [2019-09-10 07:24:18,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:18,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:18,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:18,734 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 07:24:18,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:18,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:24:18,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:18,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:24:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:24:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:24:18,738 INFO L87 Difference]: Start difference. First operand 4022 states and 6312 transitions. Second operand 5 states. [2019-09-10 07:24:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:19,198 INFO L93 Difference]: Finished difference Result 7342 states and 11516 transitions. [2019-09-10 07:24:19,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:24:19,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 07:24:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:19,238 INFO L225 Difference]: With dead ends: 7342 [2019-09-10 07:24:19,239 INFO L226 Difference]: Without dead ends: 7342 [2019-09-10 07:24:19,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:24:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7342 states. [2019-09-10 07:24:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7342 to 7340. [2019-09-10 07:24:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7340 states. [2019-09-10 07:24:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7340 states to 7340 states and 11515 transitions. [2019-09-10 07:24:19,430 INFO L78 Accepts]: Start accepts. Automaton has 7340 states and 11515 transitions. Word has length 101 [2019-09-10 07:24:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:19,431 INFO L475 AbstractCegarLoop]: Abstraction has 7340 states and 11515 transitions. [2019-09-10 07:24:19,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:24:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 7340 states and 11515 transitions. [2019-09-10 07:24:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:24:19,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:19,438 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] [2019-09-10 07:24:19,438 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:19,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1424572541, now seen corresponding path program 1 times [2019-09-10 07:24:19,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:19,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:19,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:19,572 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 07:24:19,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:19,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:24:19,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:19,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:24:19,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:24:19,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:24:19,574 INFO L87 Difference]: Start difference. First operand 7340 states and 11515 transitions. Second operand 5 states. [2019-09-10 07:24:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:19,985 INFO L93 Difference]: Finished difference Result 13716 states and 21476 transitions. [2019-09-10 07:24:19,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:24:19,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 07:24:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:20,054 INFO L225 Difference]: With dead ends: 13716 [2019-09-10 07:24:20,054 INFO L226 Difference]: Without dead ends: 13716 [2019-09-10 07:24:20,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:24:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13716 states. [2019-09-10 07:24:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13716 to 13714. [2019-09-10 07:24:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13714 states. [2019-09-10 07:24:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13714 states to 13714 states and 21475 transitions. [2019-09-10 07:24:20,402 INFO L78 Accepts]: Start accepts. Automaton has 13714 states and 21475 transitions. Word has length 101 [2019-09-10 07:24:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:20,402 INFO L475 AbstractCegarLoop]: Abstraction has 13714 states and 21475 transitions. [2019-09-10 07:24:20,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:24:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13714 states and 21475 transitions. [2019-09-10 07:24:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:24:20,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:20,411 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] [2019-09-10 07:24:20,411 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1720838482, now seen corresponding path program 1 times [2019-09-10 07:24:20,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:20,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:20,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:20,529 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 07:24:20,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:20,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:24:20,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:20,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:24:20,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:24:20,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:24:20,531 INFO L87 Difference]: Start difference. First operand 13714 states and 21475 transitions. Second operand 5 states. [2019-09-10 07:24:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:20,998 INFO L93 Difference]: Finished difference Result 26372 states and 41250 transitions. [2019-09-10 07:24:20,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:24:20,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 07:24:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:21,051 INFO L225 Difference]: With dead ends: 26372 [2019-09-10 07:24:21,052 INFO L226 Difference]: Without dead ends: 26372 [2019-09-10 07:24:21,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:24:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26372 states. [2019-09-10 07:24:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26372 to 26370. [2019-09-10 07:24:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26370 states. [2019-09-10 07:24:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26370 states to 26370 states and 41249 transitions. [2019-09-10 07:24:21,481 INFO L78 Accepts]: Start accepts. Automaton has 26370 states and 41249 transitions. Word has length 101 [2019-09-10 07:24:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:21,482 INFO L475 AbstractCegarLoop]: Abstraction has 26370 states and 41249 transitions. [2019-09-10 07:24:21,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:24:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 26370 states and 41249 transitions. [2019-09-10 07:24:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:24:21,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:21,490 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] [2019-09-10 07:24:21,490 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash 391178213, now seen corresponding path program 1 times [2019-09-10 07:24:21,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:21,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:21,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:21,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:21,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:22,215 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 07:24:22,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:22,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:24:22,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:22,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:24:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:24:22,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:24:22,217 INFO L87 Difference]: Start difference. First operand 26370 states and 41249 transitions. Second operand 5 states. [2019-09-10 07:24:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:22,684 INFO L93 Difference]: Finished difference Result 52136 states and 81198 transitions. [2019-09-10 07:24:22,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:24:22,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 07:24:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:22,775 INFO L225 Difference]: With dead ends: 52136 [2019-09-10 07:24:22,776 INFO L226 Difference]: Without dead ends: 52136 [2019-09-10 07:24:22,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:24:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52136 states. [2019-09-10 07:24:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52136 to 52134. [2019-09-10 07:24:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52134 states. [2019-09-10 07:24:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52134 states to 52134 states and 81197 transitions. [2019-09-10 07:24:23,620 INFO L78 Accepts]: Start accepts. Automaton has 52134 states and 81197 transitions. Word has length 101 [2019-09-10 07:24:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:23,620 INFO L475 AbstractCegarLoop]: Abstraction has 52134 states and 81197 transitions. [2019-09-10 07:24:23,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:24:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 52134 states and 81197 transitions. [2019-09-10 07:24:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:24:23,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:23,632 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] [2019-09-10 07:24:23,633 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1961452157, now seen corresponding path program 1 times [2019-09-10 07:24:23,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:23,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:23,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:23,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:23,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:24:23,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:23,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:24:23,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:23,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:24:23,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:24:23,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:24:23,744 INFO L87 Difference]: Start difference. First operand 52134 states and 81197 transitions. Second operand 5 states. [2019-09-10 07:24:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:24,545 INFO L93 Difference]: Finished difference Result 96252 states and 149427 transitions. [2019-09-10 07:24:24,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:24:24,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:24:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:24,749 INFO L225 Difference]: With dead ends: 96252 [2019-09-10 07:24:24,749 INFO L226 Difference]: Without dead ends: 96252 [2019-09-10 07:24:24,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:24:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96252 states. [2019-09-10 07:24:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96252 to 96250. [2019-09-10 07:24:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96250 states. [2019-09-10 07:24:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96250 states to 96250 states and 149426 transitions. [2019-09-10 07:24:26,932 INFO L78 Accepts]: Start accepts. Automaton has 96250 states and 149426 transitions. Word has length 102 [2019-09-10 07:24:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:26,933 INFO L475 AbstractCegarLoop]: Abstraction has 96250 states and 149426 transitions. [2019-09-10 07:24:26,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:24:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 96250 states and 149426 transitions. [2019-09-10 07:24:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:24:26,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:26,955 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] [2019-09-10 07:24:26,956 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:26,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash 88707930, now seen corresponding path program 1 times [2019-09-10 07:24:26,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:26,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:26,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:26,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:26,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:27,076 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 07:24:27,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:27,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:24:27,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:27,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:24:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:24:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:24:27,078 INFO L87 Difference]: Start difference. First operand 96250 states and 149426 transitions. Second operand 5 states. [2019-09-10 07:24:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:27,983 INFO L93 Difference]: Finished difference Result 183738 states and 283378 transitions. [2019-09-10 07:24:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:24:27,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:24:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:28,473 INFO L225 Difference]: With dead ends: 183738 [2019-09-10 07:24:28,473 INFO L226 Difference]: Without dead ends: 183738 [2019-09-10 07:24:28,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:24:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183738 states. [2019-09-10 07:24:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183738 to 97306. [2019-09-10 07:24:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97306 states. [2019-09-10 07:24:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97306 states to 97306 states and 150482 transitions. [2019-09-10 07:24:32,400 INFO L78 Accepts]: Start accepts. Automaton has 97306 states and 150482 transitions. Word has length 102 [2019-09-10 07:24:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:32,400 INFO L475 AbstractCegarLoop]: Abstraction has 97306 states and 150482 transitions. [2019-09-10 07:24:32,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:24:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 97306 states and 150482 transitions. [2019-09-10 07:24:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:24:32,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:32,431 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] [2019-09-10 07:24:32,431 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:32,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:32,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1218901961, now seen corresponding path program 1 times [2019-09-10 07:24:32,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:32,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:32,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:32,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 07:24:32,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:32,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:24:32,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:32,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:24:32,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:24:32,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:24:32,756 INFO L87 Difference]: Start difference. First operand 97306 states and 150482 transitions. Second operand 10 states. [2019-09-10 07:24:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:38,858 INFO L93 Difference]: Finished difference Result 617208 states and 953598 transitions. [2019-09-10 07:24:38,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 07:24:38,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-10 07:24:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:40,197 INFO L225 Difference]: With dead ends: 617208 [2019-09-10 07:24:40,197 INFO L226 Difference]: Without dead ends: 617208 [2019-09-10 07:24:40,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=377, Invalid=1183, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:24:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617208 states. [2019-09-10 07:24:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617208 to 97623. [2019-09-10 07:24:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97623 states. [2019-09-10 07:24:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97623 states to 97623 states and 150883 transitions. [2019-09-10 07:24:47,793 INFO L78 Accepts]: Start accepts. Automaton has 97623 states and 150883 transitions. Word has length 103 [2019-09-10 07:24:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:47,793 INFO L475 AbstractCegarLoop]: Abstraction has 97623 states and 150883 transitions. [2019-09-10 07:24:47,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:24:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 97623 states and 150883 transitions. [2019-09-10 07:24:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:24:47,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:47,811 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] [2019-09-10 07:24:47,811 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:47,812 INFO L82 PathProgramCache]: Analyzing trace with hash -21207177, now seen corresponding path program 1 times [2019-09-10 07:24:47,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:47,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:47,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:48,021 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 07:24:48,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:48,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:24:48,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:48,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:24:48,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:24:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:24:48,023 INFO L87 Difference]: Start difference. First operand 97623 states and 150883 transitions. Second operand 10 states. [2019-09-10 07:24:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:50,541 INFO L93 Difference]: Finished difference Result 332543 states and 509580 transitions. [2019-09-10 07:24:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:24:50,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-10 07:24:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:51,700 INFO L225 Difference]: With dead ends: 332543 [2019-09-10 07:24:51,700 INFO L226 Difference]: Without dead ends: 332543 [2019-09-10 07:24:51,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:24:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332543 states. [2019-09-10 07:24:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332543 to 98637. [2019-09-10 07:24:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98637 states. [2019-09-10 07:24:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98637 states to 98637 states and 152285 transitions. [2019-09-10 07:24:56,698 INFO L78 Accepts]: Start accepts. Automaton has 98637 states and 152285 transitions. Word has length 103 [2019-09-10 07:24:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:24:56,699 INFO L475 AbstractCegarLoop]: Abstraction has 98637 states and 152285 transitions. [2019-09-10 07:24:56,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:24:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 98637 states and 152285 transitions. [2019-09-10 07:24:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:24:56,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:24:56,714 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] [2019-09-10 07:24:56,714 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:24:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:24:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1333688087, now seen corresponding path program 1 times [2019-09-10 07:24:56,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:24:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:56,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:24:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:24:56,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:24:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:24:56,939 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 07:24:56,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:24:56,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:24:56,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:56,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:24:56,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:24:56,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:24:56,942 INFO L87 Difference]: Start difference. First operand 98637 states and 152285 transitions. Second operand 10 states. [2019-09-10 07:25:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:02,524 INFO L93 Difference]: Finished difference Result 501035 states and 766792 transitions. [2019-09-10 07:25:02,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:25:02,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-10 07:25:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:03,322 INFO L225 Difference]: With dead ends: 501035 [2019-09-10 07:25:03,322 INFO L226 Difference]: Without dead ends: 501035 [2019-09-10 07:25:03,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:25:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501035 states. [2019-09-10 07:25:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501035 to 100397. [2019-09-10 07:25:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100397 states. [2019-09-10 07:25:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100397 states to 100397 states and 154815 transitions. [2019-09-10 07:25:10,969 INFO L78 Accepts]: Start accepts. Automaton has 100397 states and 154815 transitions. Word has length 103 [2019-09-10 07:25:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:10,970 INFO L475 AbstractCegarLoop]: Abstraction has 100397 states and 154815 transitions. [2019-09-10 07:25:10,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:25:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 100397 states and 154815 transitions. [2019-09-10 07:25:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:25:10,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:10,986 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] [2019-09-10 07:25:10,986 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1161771337, now seen corresponding path program 1 times [2019-09-10 07:25:10,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:10,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:10,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:11,205 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 07:25:11,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:11,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:25:11,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:11,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:25:11,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:25:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:25:11,207 INFO L87 Difference]: Start difference. First operand 100397 states and 154815 transitions. Second operand 10 states. [2019-09-10 07:25:15,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:15,473 INFO L93 Difference]: Finished difference Result 507702 states and 780629 transitions. [2019-09-10 07:25:15,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:25:15,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-10 07:25:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:16,103 INFO L225 Difference]: With dead ends: 507702 [2019-09-10 07:25:16,103 INFO L226 Difference]: Without dead ends: 507702 [2019-09-10 07:25:16,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:25:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507702 states. [2019-09-10 07:25:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507702 to 100397. [2019-09-10 07:25:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100397 states. [2019-09-10 07:25:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100397 states to 100397 states and 154807 transitions. [2019-09-10 07:25:19,473 INFO L78 Accepts]: Start accepts. Automaton has 100397 states and 154807 transitions. Word has length 103 [2019-09-10 07:25:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:19,473 INFO L475 AbstractCegarLoop]: Abstraction has 100397 states and 154807 transitions. [2019-09-10 07:25:19,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:25:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 100397 states and 154807 transitions. [2019-09-10 07:25:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:25:19,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:19,488 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] [2019-09-10 07:25:19,488 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash -652044329, now seen corresponding path program 1 times [2019-09-10 07:25:19,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:19,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:19,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:19,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:19,749 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 07:25:19,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:19,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:25:19,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:19,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:25:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:25:19,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:25:19,752 INFO L87 Difference]: Start difference. First operand 100397 states and 154807 transitions. Second operand 10 states. [2019-09-10 07:25:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:25,137 INFO L93 Difference]: Finished difference Result 658473 states and 1008855 transitions. [2019-09-10 07:25:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:25:25,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-10 07:25:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:26,073 INFO L225 Difference]: With dead ends: 658473 [2019-09-10 07:25:26,073 INFO L226 Difference]: Without dead ends: 658473 [2019-09-10 07:25:26,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:25:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658473 states. [2019-09-10 07:25:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658473 to 102059. [2019-09-10 07:25:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102059 states. [2019-09-10 07:25:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102059 states to 102059 states and 156998 transitions. [2019-09-10 07:25:36,338 INFO L78 Accepts]: Start accepts. Automaton has 102059 states and 156998 transitions. Word has length 103 [2019-09-10 07:25:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:36,339 INFO L475 AbstractCegarLoop]: Abstraction has 102059 states and 156998 transitions. [2019-09-10 07:25:36,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:25:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 102059 states and 156998 transitions. [2019-09-10 07:25:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:25:36,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:36,352 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] [2019-09-10 07:25:36,352 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2046428493, now seen corresponding path program 1 times [2019-09-10 07:25:36,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:36,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:36,558 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 07:25:36,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:25:36,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:36,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:25:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:25:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:25:36,560 INFO L87 Difference]: Start difference. First operand 102059 states and 156998 transitions. Second operand 10 states. [2019-09-10 07:25:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:41,486 INFO L93 Difference]: Finished difference Result 547778 states and 841205 transitions. [2019-09-10 07:25:41,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:25:41,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 07:25:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:42,223 INFO L225 Difference]: With dead ends: 547778 [2019-09-10 07:25:42,224 INFO L226 Difference]: Without dead ends: 547778 [2019-09-10 07:25:42,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:25:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547778 states. [2019-09-10 07:25:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547778 to 102851. [2019-09-10 07:25:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102851 states. [2019-09-10 07:25:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102851 states to 102851 states and 157919 transitions. [2019-09-10 07:25:50,195 INFO L78 Accepts]: Start accepts. Automaton has 102851 states and 157919 transitions. Word has length 104 [2019-09-10 07:25:50,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:50,195 INFO L475 AbstractCegarLoop]: Abstraction has 102851 states and 157919 transitions. [2019-09-10 07:25:50,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:25:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 102851 states and 157919 transitions. [2019-09-10 07:25:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:25:50,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:50,210 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] [2019-09-10 07:25:50,210 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:50,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:50,211 INFO L82 PathProgramCache]: Analyzing trace with hash -721392155, now seen corresponding path program 1 times [2019-09-10 07:25:50,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:50,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:50,326 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 07:25:50,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:50,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:25:50,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:50,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:25:50,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:25:50,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:25:50,328 INFO L87 Difference]: Start difference. First operand 102851 states and 157919 transitions. Second operand 4 states. [2019-09-10 07:25:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:50,798 INFO L93 Difference]: Finished difference Result 188517 states and 287488 transitions. [2019-09-10 07:25:50,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:50,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 07:25:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:51,015 INFO L225 Difference]: With dead ends: 188517 [2019-09-10 07:25:51,016 INFO L226 Difference]: Without dead ends: 188517 [2019-09-10 07:25:51,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188517 states. [2019-09-10 07:25:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188517 to 187491. [2019-09-10 07:25:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187491 states. [2019-09-10 07:25:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187491 states to 187491 states and 286463 transitions. [2019-09-10 07:25:53,324 INFO L78 Accepts]: Start accepts. Automaton has 187491 states and 286463 transitions. Word has length 104 [2019-09-10 07:25:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:53,324 INFO L475 AbstractCegarLoop]: Abstraction has 187491 states and 286463 transitions. [2019-09-10 07:25:53,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:25:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 187491 states and 286463 transitions. [2019-09-10 07:25:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:25:53,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:53,340 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] [2019-09-10 07:25:53,341 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1723337855, now seen corresponding path program 1 times [2019-09-10 07:25:53,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:53,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:53,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:53,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:53,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:53,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:53,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:53,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:53,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:53,404 INFO L87 Difference]: Start difference. First operand 187491 states and 286463 transitions. Second operand 3 states. [2019-09-10 07:25:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:54,015 INFO L93 Difference]: Finished difference Result 245141 states and 370100 transitions. [2019-09-10 07:25:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:54,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:25:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:54,312 INFO L225 Difference]: With dead ends: 245141 [2019-09-10 07:25:54,312 INFO L226 Difference]: Without dead ends: 245141 [2019-09-10 07:25:54,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245141 states. [2019-09-10 07:25:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245141 to 243523. [2019-09-10 07:25:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243523 states. [2019-09-10 07:26:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243523 states to 243523 states and 368483 transitions. [2019-09-10 07:26:03,801 INFO L78 Accepts]: Start accepts. Automaton has 243523 states and 368483 transitions. Word has length 104 [2019-09-10 07:26:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:03,801 INFO L475 AbstractCegarLoop]: Abstraction has 243523 states and 368483 transitions. [2019-09-10 07:26:03,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 243523 states and 368483 transitions. [2019-09-10 07:26:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:26:03,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:03,819 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] [2019-09-10 07:26:03,819 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:03,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -302600063, now seen corresponding path program 1 times [2019-09-10 07:26:03,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:03,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:03,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:03,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:03,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:03,876 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 07:26:03,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:03,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:03,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:03,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:03,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:03,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:03,878 INFO L87 Difference]: Start difference. First operand 243523 states and 368483 transitions. Second operand 3 states. [2019-09-10 07:26:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:04,495 INFO L93 Difference]: Finished difference Result 286051 states and 426600 transitions. [2019-09-10 07:26:04,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:04,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:26:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:04,834 INFO L225 Difference]: With dead ends: 286051 [2019-09-10 07:26:04,835 INFO L226 Difference]: Without dead ends: 286051 [2019-09-10 07:26:04,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286051 states. [2019-09-10 07:26:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286051 to 283633. [2019-09-10 07:26:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283633 states. [2019-09-10 07:26:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283633 states to 283633 states and 424183 transitions. [2019-09-10 07:26:08,397 INFO L78 Accepts]: Start accepts. Automaton has 283633 states and 424183 transitions. Word has length 104 [2019-09-10 07:26:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:08,397 INFO L475 AbstractCegarLoop]: Abstraction has 283633 states and 424183 transitions. [2019-09-10 07:26:08,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 283633 states and 424183 transitions. [2019-09-10 07:26:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:26:08,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:08,412 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] [2019-09-10 07:26:08,412 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:08,413 INFO L82 PathProgramCache]: Analyzing trace with hash 689926226, now seen corresponding path program 1 times [2019-09-10 07:26:08,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:08,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:08,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:08,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:08,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:08,481 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 07:26:08,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:08,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:08,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:08,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:08,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:08,483 INFO L87 Difference]: Start difference. First operand 283633 states and 424183 transitions. Second operand 3 states. [2019-09-10 07:26:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:09,153 INFO L93 Difference]: Finished difference Result 292263 states and 430028 transitions. [2019-09-10 07:26:09,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:09,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:26:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:14,049 INFO L225 Difference]: With dead ends: 292263 [2019-09-10 07:26:14,050 INFO L226 Difference]: Without dead ends: 290839 [2019-09-10 07:26:14,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290839 states. [2019-09-10 07:26:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290839 to 267261. [2019-09-10 07:26:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267261 states. [2019-09-10 07:26:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267261 states to 267261 states and 394451 transitions. [2019-09-10 07:26:16,992 INFO L78 Accepts]: Start accepts. Automaton has 267261 states and 394451 transitions. Word has length 104 [2019-09-10 07:26:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:16,992 INFO L475 AbstractCegarLoop]: Abstraction has 267261 states and 394451 transitions. [2019-09-10 07:26:16,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 267261 states and 394451 transitions. [2019-09-10 07:26:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:26:17,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:17,007 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] [2019-09-10 07:26:17,007 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash 428064961, now seen corresponding path program 1 times [2019-09-10 07:26:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:17,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:17,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:17,080 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 07:26:17,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:17,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:17,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:17,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:17,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:17,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:17,082 INFO L87 Difference]: Start difference. First operand 267261 states and 394451 transitions. Second operand 3 states. [2019-09-10 07:26:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:17,988 INFO L93 Difference]: Finished difference Result 376350 states and 550193 transitions. [2019-09-10 07:26:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:17,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:26:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:18,471 INFO L225 Difference]: With dead ends: 376350 [2019-09-10 07:26:18,471 INFO L226 Difference]: Without dead ends: 376350 [2019-09-10 07:26:18,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376350 states. [2019-09-10 07:26:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376350 to 261485. [2019-09-10 07:26:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261485 states. [2019-09-10 07:26:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261485 states to 261485 states and 382524 transitions. [2019-09-10 07:26:26,653 INFO L78 Accepts]: Start accepts. Automaton has 261485 states and 382524 transitions. Word has length 104 [2019-09-10 07:26:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:26,653 INFO L475 AbstractCegarLoop]: Abstraction has 261485 states and 382524 transitions. [2019-09-10 07:26:26,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 261485 states and 382524 transitions. [2019-09-10 07:26:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:26:26,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:26,667 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] [2019-09-10 07:26:26,667 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:26,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:26,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1336244573, now seen corresponding path program 1 times [2019-09-10 07:26:26,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:26,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:26,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:26,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:26,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:26,722 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 07:26:26,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:26,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:26,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:26,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:26,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:26,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:26,725 INFO L87 Difference]: Start difference. First operand 261485 states and 382524 transitions. Second operand 3 states. [2019-09-10 07:26:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:27,686 INFO L93 Difference]: Finished difference Result 295011 states and 423499 transitions. [2019-09-10 07:26:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:27,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:26:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:28,243 INFO L225 Difference]: With dead ends: 295011 [2019-09-10 07:26:28,244 INFO L226 Difference]: Without dead ends: 295011 [2019-09-10 07:26:28,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295011 states. [2019-09-10 07:26:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295011 to 292873. [2019-09-10 07:26:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292873 states. [2019-09-10 07:26:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292873 states to 292873 states and 421362 transitions. [2019-09-10 07:26:37,219 INFO L78 Accepts]: Start accepts. Automaton has 292873 states and 421362 transitions. Word has length 104 [2019-09-10 07:26:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:37,220 INFO L475 AbstractCegarLoop]: Abstraction has 292873 states and 421362 transitions. [2019-09-10 07:26:37,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 292873 states and 421362 transitions. [2019-09-10 07:26:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:26:37,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:37,231 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] [2019-09-10 07:26:37,231 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2072871981, now seen corresponding path program 1 times [2019-09-10 07:26:37,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:37,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:37,286 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 07:26:37,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:37,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:37,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:37,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:37,288 INFO L87 Difference]: Start difference. First operand 292873 states and 421362 transitions. Second operand 3 states. [2019-09-10 07:26:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:38,158 INFO L93 Difference]: Finished difference Result 415482 states and 588540 transitions. [2019-09-10 07:26:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:38,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:26:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:38,730 INFO L225 Difference]: With dead ends: 415482 [2019-09-10 07:26:38,731 INFO L226 Difference]: Without dead ends: 415482 [2019-09-10 07:26:38,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415482 states. [2019-09-10 07:26:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415482 to 412744. [2019-09-10 07:26:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412744 states. [2019-09-10 07:26:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412744 states to 412744 states and 585803 transitions. [2019-09-10 07:26:48,985 INFO L78 Accepts]: Start accepts. Automaton has 412744 states and 585803 transitions. Word has length 105 [2019-09-10 07:26:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:48,985 INFO L475 AbstractCegarLoop]: Abstraction has 412744 states and 585803 transitions. [2019-09-10 07:26:48,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 412744 states and 585803 transitions. [2019-09-10 07:26:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:26:48,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:48,996 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] [2019-09-10 07:26:48,996 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash 331168643, now seen corresponding path program 1 times [2019-09-10 07:26:48,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:48,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:48,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:49,107 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 07:26:49,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:49,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:26:49,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:49,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:26:49,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:26:49,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:26:49,109 INFO L87 Difference]: Start difference. First operand 412744 states and 585803 transitions. Second operand 7 states. [2019-09-10 07:26:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:53,773 INFO L93 Difference]: Finished difference Result 1089628 states and 1541838 transitions. [2019-09-10 07:26:53,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:26:53,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:26:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:55,391 INFO L225 Difference]: With dead ends: 1089628 [2019-09-10 07:26:55,391 INFO L226 Difference]: Without dead ends: 1089628 [2019-09-10 07:26:55,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:27:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089628 states. [2019-09-10 07:27:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089628 to 412792. [2019-09-10 07:27:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412792 states. [2019-09-10 07:27:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412792 states to 412792 states and 585867 transitions. [2019-09-10 07:27:13,998 INFO L78 Accepts]: Start accepts. Automaton has 412792 states and 585867 transitions. Word has length 105 [2019-09-10 07:27:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:13,999 INFO L475 AbstractCegarLoop]: Abstraction has 412792 states and 585867 transitions. [2019-09-10 07:27:13,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:27:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 412792 states and 585867 transitions. [2019-09-10 07:27:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:27:14,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:14,009 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] [2019-09-10 07:27:14,009 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:14,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1492453681, now seen corresponding path program 1 times [2019-09-10 07:27:14,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:14,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:14,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:14,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:14,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:14,112 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 07:27:14,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:14,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:27:14,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:14,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:27:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:27:14,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:27:14,120 INFO L87 Difference]: Start difference. First operand 412792 states and 585867 transitions. Second operand 7 states. [2019-09-10 07:27:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:28,343 INFO L93 Difference]: Finished difference Result 1869125 states and 2629552 transitions. [2019-09-10 07:27:28,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:27:28,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:27:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:31,093 INFO L225 Difference]: With dead ends: 1869125 [2019-09-10 07:27:31,094 INFO L226 Difference]: Without dead ends: 1869125 [2019-09-10 07:27:31,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:27:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869125 states. [2019-09-10 07:27:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869125 to 413808. [2019-09-10 07:27:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413808 states. [2019-09-10 07:27:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413808 states to 413808 states and 587127 transitions. [2019-09-10 07:27:54,234 INFO L78 Accepts]: Start accepts. Automaton has 413808 states and 587127 transitions. Word has length 105 [2019-09-10 07:27:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:54,234 INFO L475 AbstractCegarLoop]: Abstraction has 413808 states and 587127 transitions. [2019-09-10 07:27:54,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:27:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 413808 states and 587127 transitions. [2019-09-10 07:27:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:27:54,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:54,245 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] [2019-09-10 07:27:54,245 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 677685592, now seen corresponding path program 1 times [2019-09-10 07:27:54,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:54,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:54,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:54,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:54,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:54,348 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 07:27:54,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:54,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:27:54,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:54,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:27:54,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:27:54,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:27:54,349 INFO L87 Difference]: Start difference. First operand 413808 states and 587127 transitions. Second operand 7 states. [2019-09-10 07:28:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:02,158 INFO L93 Difference]: Finished difference Result 1676107 states and 2353206 transitions. [2019-09-10 07:28:02,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:28:02,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:28:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:16,899 INFO L225 Difference]: With dead ends: 1676107 [2019-09-10 07:28:16,900 INFO L226 Difference]: Without dead ends: 1676107 [2019-09-10 07:28:16,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:28:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676107 states. [2019-09-10 07:28:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676107 to 415318. [2019-09-10 07:28:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415318 states. [2019-09-10 07:28:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415318 states to 415318 states and 588985 transitions. [2019-09-10 07:28:27,942 INFO L78 Accepts]: Start accepts. Automaton has 415318 states and 588985 transitions. Word has length 105 [2019-09-10 07:28:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:27,942 INFO L475 AbstractCegarLoop]: Abstraction has 415318 states and 588985 transitions. [2019-09-10 07:28:27,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:28:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 415318 states and 588985 transitions. [2019-09-10 07:28:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:28:27,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:27,954 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] [2019-09-10 07:28:27,954 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash 368179984, now seen corresponding path program 1 times [2019-09-10 07:28:27,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:27,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:27,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:28,048 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 07:28:28,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:28,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:28:28,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:28,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:28:28,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:28:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:28:28,050 INFO L87 Difference]: Start difference. First operand 415318 states and 588985 transitions. Second operand 7 states. [2019-09-10 07:28:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:28:39,832 INFO L93 Difference]: Finished difference Result 1269037 states and 1783230 transitions. [2019-09-10 07:28:39,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:28:39,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:28:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:28:41,479 INFO L225 Difference]: With dead ends: 1269037 [2019-09-10 07:28:41,479 INFO L226 Difference]: Without dead ends: 1269037 [2019-09-10 07:28:41,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:28:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269037 states. [2019-09-10 07:28:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269037 to 510203. [2019-09-10 07:28:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510203 states. [2019-09-10 07:28:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510203 states to 510203 states and 722596 transitions. [2019-09-10 07:28:51,188 INFO L78 Accepts]: Start accepts. Automaton has 510203 states and 722596 transitions. Word has length 105 [2019-09-10 07:28:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:28:51,188 INFO L475 AbstractCegarLoop]: Abstraction has 510203 states and 722596 transitions. [2019-09-10 07:28:51,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:28:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 510203 states and 722596 transitions. [2019-09-10 07:28:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:28:51,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:28:51,202 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] [2019-09-10 07:28:51,202 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:28:51,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:28:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1005182287, now seen corresponding path program 1 times [2019-09-10 07:28:51,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:28:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:28:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:28:51,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:28:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:28:51,282 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 07:28:51,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:28:51,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:28:51,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:51,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:28:51,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:28:51,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:28:51,284 INFO L87 Difference]: Start difference. First operand 510203 states and 722596 transitions. Second operand 7 states. [2019-09-10 07:29:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:06,163 INFO L93 Difference]: Finished difference Result 2216184 states and 3116284 transitions. [2019-09-10 07:29:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:29:06,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:29:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:10,743 INFO L225 Difference]: With dead ends: 2216184 [2019-09-10 07:29:10,743 INFO L226 Difference]: Without dead ends: 2216184 [2019-09-10 07:29:10,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:29:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216184 states. [2019-09-10 07:29:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216184 to 511095. [2019-09-10 07:29:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511095 states. [2019-09-10 07:29:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511095 states to 511095 states and 723682 transitions. [2019-09-10 07:29:37,193 INFO L78 Accepts]: Start accepts. Automaton has 511095 states and 723682 transitions. Word has length 105 [2019-09-10 07:29:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:37,194 INFO L475 AbstractCegarLoop]: Abstraction has 511095 states and 723682 transitions. [2019-09-10 07:29:37,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:29:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 511095 states and 723682 transitions. [2019-09-10 07:29:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:29:37,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:37,209 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] [2019-09-10 07:29:37,209 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:37,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash 37259345, now seen corresponding path program 1 times [2019-09-10 07:29:37,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:37,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:37,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:37,314 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 07:29:37,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:37,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:29:37,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:37,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:29:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:29:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:29:37,316 INFO L87 Difference]: Start difference. First operand 511095 states and 723682 transitions. Second operand 7 states. [2019-09-10 07:29:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:45,522 INFO L93 Difference]: Finished difference Result 1585420 states and 2230444 transitions. [2019-09-10 07:29:45,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:29:45,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:29:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:00,431 INFO L225 Difference]: With dead ends: 1585420 [2019-09-10 07:30:00,432 INFO L226 Difference]: Without dead ends: 1585420 [2019-09-10 07:30:00,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:30:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585420 states. [2019-09-10 07:30:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585420 to 511385. [2019-09-10 07:30:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511385 states. [2019-09-10 07:30:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511385 states to 511385 states and 724030 transitions. [2019-09-10 07:30:12,333 INFO L78 Accepts]: Start accepts. Automaton has 511385 states and 724030 transitions. Word has length 106 [2019-09-10 07:30:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:12,333 INFO L475 AbstractCegarLoop]: Abstraction has 511385 states and 724030 transitions. [2019-09-10 07:30:12,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:30:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 511385 states and 724030 transitions. [2019-09-10 07:30:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:30:12,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:12,348 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] [2019-09-10 07:30:12,348 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:12,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1007835046, now seen corresponding path program 1 times [2019-09-10 07:30:12,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:12,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:12,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:12,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:12,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:12,514 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 07:30:12,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:30:12,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:30:12,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:30:12,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:30:12,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:30:12,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:30:12,516 INFO L87 Difference]: Start difference. First operand 511385 states and 724030 transitions. Second operand 8 states. [2019-09-10 07:30:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:27,399 INFO L93 Difference]: Finished difference Result 2308642 states and 3271902 transitions. [2019-09-10 07:30:27,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:30:27,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-10 07:30:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:32,227 INFO L225 Difference]: With dead ends: 2308642 [2019-09-10 07:30:32,227 INFO L226 Difference]: Without dead ends: 2308642 [2019-09-10 07:30:32,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:30:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308642 states. [2019-09-10 07:30:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308642 to 585822. [2019-09-10 07:30:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585822 states. [2019-09-10 07:30:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585822 states to 585822 states and 830390 transitions. [2019-09-10 07:30:48,607 INFO L78 Accepts]: Start accepts. Automaton has 585822 states and 830390 transitions. Word has length 107 [2019-09-10 07:30:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:30:48,607 INFO L475 AbstractCegarLoop]: Abstraction has 585822 states and 830390 transitions. [2019-09-10 07:30:48,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:30:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 585822 states and 830390 transitions. [2019-09-10 07:30:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:30:48,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:30:48,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:30:48,622 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:30:48,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:30:48,622 INFO L82 PathProgramCache]: Analyzing trace with hash -863358045, now seen corresponding path program 1 times [2019-09-10 07:30:48,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:30:48,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:48,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:30:48,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:30:48,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:30:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:30:48,749 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 07:30:48,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:30:48,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:30:48,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:30:48,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:30:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:30:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:30:48,751 INFO L87 Difference]: Start difference. First operand 585822 states and 830390 transitions. Second operand 8 states. [2019-09-10 07:31:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:02,178 INFO L93 Difference]: Finished difference Result 2389202 states and 3388400 transitions. [2019-09-10 07:31:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:31:02,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-10 07:31:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:08,196 INFO L225 Difference]: With dead ends: 2389202 [2019-09-10 07:31:08,197 INFO L226 Difference]: Without dead ends: 2389202 [2019-09-10 07:31:08,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:31:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389202 states. [2019-09-10 07:31:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389202 to 661624. [2019-09-10 07:31:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661624 states. [2019-09-10 07:31:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661624 states to 661624 states and 939095 transitions. [2019-09-10 07:31:39,814 INFO L78 Accepts]: Start accepts. Automaton has 661624 states and 939095 transitions. Word has length 107 [2019-09-10 07:31:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:39,815 INFO L475 AbstractCegarLoop]: Abstraction has 661624 states and 939095 transitions. [2019-09-10 07:31:39,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:31:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 661624 states and 939095 transitions. [2019-09-10 07:31:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:31:39,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:39,830 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] [2019-09-10 07:31:39,830 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1240939269, now seen corresponding path program 1 times [2019-09-10 07:31:39,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:39,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:39,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:39,975 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 07:31:39,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:31:39,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:31:39,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:31:39,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:31:39,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:31:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:31:39,977 INFO L87 Difference]: Start difference. First operand 661624 states and 939095 transitions. Second operand 8 states. [2019-09-10 07:31:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:57,211 INFO L93 Difference]: Finished difference Result 2487894 states and 3529672 transitions. [2019-09-10 07:31:57,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:31:57,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-10 07:31:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:32:02,212 INFO L225 Difference]: With dead ends: 2487894 [2019-09-10 07:32:02,212 INFO L226 Difference]: Without dead ends: 2487894 [2019-09-10 07:32:02,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:32:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487894 states. [2019-09-10 07:32:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487894 to 788904. [2019-09-10 07:32:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788904 states. [2019-09-10 07:32:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788904 states to 788904 states and 1118745 transitions. [2019-09-10 07:32:39,212 INFO L78 Accepts]: Start accepts. Automaton has 788904 states and 1118745 transitions. Word has length 107 [2019-09-10 07:32:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:32:39,212 INFO L475 AbstractCegarLoop]: Abstraction has 788904 states and 1118745 transitions. [2019-09-10 07:32:39,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:32:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 788904 states and 1118745 transitions. [2019-09-10 07:32:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:32:39,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:32:39,228 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] [2019-09-10 07:32:39,228 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:32:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 742883706, now seen corresponding path program 1 times [2019-09-10 07:32:39,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:32:39,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:39,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:39,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:39,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:32:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:39,394 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 07:32:39,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:32:39,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:32:39,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:32:39,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:32:39,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:32:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:32:39,397 INFO L87 Difference]: Start difference. First operand 788904 states and 1118745 transitions. Second operand 8 states. [2019-09-10 07:32:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:32:50,758 INFO L93 Difference]: Finished difference Result 2501199 states and 3545583 transitions. [2019-09-10 07:32:50,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:32:50,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-10 07:32:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:32:56,937 INFO L225 Difference]: With dead ends: 2501199 [2019-09-10 07:32:56,937 INFO L226 Difference]: Without dead ends: 2501199 [2019-09-10 07:32:56,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:33:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501199 states. [2019-09-10 07:33:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501199 to 881419. [2019-09-10 07:33:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881419 states. [2019-09-10 07:33:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881419 states to 881419 states and 1250677 transitions. [2019-09-10 07:33:34,385 INFO L78 Accepts]: Start accepts. Automaton has 881419 states and 1250677 transitions. Word has length 107 [2019-09-10 07:33:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:33:34,386 INFO L475 AbstractCegarLoop]: Abstraction has 881419 states and 1250677 transitions. [2019-09-10 07:33:34,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:33:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 881419 states and 1250677 transitions. [2019-09-10 07:33:34,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:33:34,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:33:34,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:33:34,400 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:33:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:33:34,401 INFO L82 PathProgramCache]: Analyzing trace with hash -53376860, now seen corresponding path program 1 times [2019-09-10 07:33:34,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:33:34,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:33:34,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:33:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:33:34,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:33:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:33:34,562 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 07:33:34,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:33:34,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:33:34,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:33:34,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:33:34,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:33:34,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:33:34,564 INFO L87 Difference]: Start difference. First operand 881419 states and 1250677 transitions. Second operand 8 states. [2019-09-10 07:33:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:33:54,593 INFO L93 Difference]: Finished difference Result 2599354 states and 3685114 transitions. [2019-09-10 07:33:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:33:54,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2019-09-10 07:33:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted.