java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:22:19,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:22:19,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:22:19,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:22:19,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:22:19,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:22:19,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:22:19,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:22:19,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:22:19,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:22:19,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:22:19,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:22:19,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:22:19,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:22:19,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:22:19,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:22:19,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:22:19,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:22:19,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:22:19,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:22:19,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:22:19,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:22:19,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:22:19,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:22:19,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:22:19,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:22:19,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:22:19,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:22:19,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:22:19,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:22:19,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:22:19,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:22:19,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:22:19,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:22:19,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:22:19,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:22:19,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:22:19,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:22:19,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:22:19,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:22:19,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:22:19,459 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:22:19,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:22:19,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:22:19,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:22:19,501 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:22:19,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:22:19,502 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:22:19,505 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:22:19,506 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:22:19,506 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:22:19,506 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:22:19,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:22:19,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:22:19,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:22:19,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:22:19,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:22:19,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:22:19,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:22:19,511 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:22:19,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:22:19,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:22:19,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:22:19,512 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:22:19,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:22:19,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:22:19,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:22:19,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:22:19,513 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:22:19,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:22:19,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:22:19,514 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:22:19,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:22:19,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:22:19,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:22:19,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:22:19,566 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:22:19,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:22:19,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055277898/01779d80b0934744ab8a924467e5d338/FLAGc9a1afee6 [2019-09-10 06:22:20,218 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:22:20,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:22:20,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055277898/01779d80b0934744ab8a924467e5d338/FLAGc9a1afee6 [2019-09-10 06:22:20,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055277898/01779d80b0934744ab8a924467e5d338 [2019-09-10 06:22:20,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:22:20,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:22:20,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:22:20,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:22:20,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:22:20,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:22:20" (1/1) ... [2019-09-10 06:22:20,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e66ab54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:20, skipping insertion in model container [2019-09-10 06:22:20,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:22:20" (1/1) ... [2019-09-10 06:22:20,559 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:22:20,636 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:22:21,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:22:21,283 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:22:21,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:22:21,507 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:22:21,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21 WrapperNode [2019-09-10 06:22:21,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:22:21,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:22:21,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:22:21,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:22:21,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21" (1/1) ... [2019-09-10 06:22:21,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21" (1/1) ... [2019-09-10 06:22:21,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21" (1/1) ... [2019-09-10 06:22:21,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21" (1/1) ... [2019-09-10 06:22:21,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21" (1/1) ... [2019-09-10 06:22:21,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21" (1/1) ... [2019-09-10 06:22:21,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21" (1/1) ... [2019-09-10 06:22:21,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:22:21,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:22:21,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:22:21,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:22:21,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:22:21,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:22:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:22:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:22:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:22:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:22:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:22:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:22:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:22:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:22:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:22:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:22:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:22:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:22:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:22:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:22:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:22:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:22:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:22:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:22:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:22:23,166 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:22:23,167 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:22:23,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:22:23 BoogieIcfgContainer [2019-09-10 06:22:23,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:22:23,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:22:23,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:22:23,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:22:23,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:22:20" (1/3) ... [2019-09-10 06:22:23,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a0afa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:22:23, skipping insertion in model container [2019-09-10 06:22:23,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:22:21" (2/3) ... [2019-09-10 06:22:23,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a0afa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:22:23, skipping insertion in model container [2019-09-10 06:22:23,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:22:23" (3/3) ... [2019-09-10 06:22:23,180 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:22:23,190 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:22:23,199 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:22:23,216 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:22:23,243 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:22:23,243 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:22:23,243 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:22:23,243 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:22:23,244 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:22:23,244 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:22:23,244 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:22:23,244 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:22:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2019-09-10 06:22:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:22:23,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:23,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:23,325 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:23,331 INFO L82 PathProgramCache]: Analyzing trace with hash 175889663, now seen corresponding path program 1 times [2019-09-10 06:22:23,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:23,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:23,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:23,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:23,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:23,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:23,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:23,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:23,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:23,971 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2019-09-10 06:22:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:24,130 INFO L93 Difference]: Finished difference Result 458 states and 789 transitions. [2019-09-10 06:22:24,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:24,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 06:22:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:24,153 INFO L225 Difference]: With dead ends: 458 [2019-09-10 06:22:24,153 INFO L226 Difference]: Without dead ends: 450 [2019-09-10 06:22:24,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-10 06:22:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2019-09-10 06:22:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-10 06:22:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 738 transitions. [2019-09-10 06:22:24,237 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 738 transitions. Word has length 114 [2019-09-10 06:22:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:24,238 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 738 transitions. [2019-09-10 06:22:24,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 738 transitions. [2019-09-10 06:22:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:22:24,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:24,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:24,243 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1851484959, now seen corresponding path program 1 times [2019-09-10 06:22:24,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:24,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:24,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:24,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:24,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:24,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:24,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:24,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:24,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:24,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:24,537 INFO L87 Difference]: Start difference. First operand 447 states and 738 transitions. Second operand 3 states. [2019-09-10 06:22:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:24,591 INFO L93 Difference]: Finished difference Result 683 states and 1125 transitions. [2019-09-10 06:22:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:24,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 06:22:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:24,600 INFO L225 Difference]: With dead ends: 683 [2019-09-10 06:22:24,600 INFO L226 Difference]: Without dead ends: 683 [2019-09-10 06:22:24,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-10 06:22:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 679. [2019-09-10 06:22:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-10 06:22:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1122 transitions. [2019-09-10 06:22:24,659 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1122 transitions. Word has length 117 [2019-09-10 06:22:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:24,660 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 1122 transitions. [2019-09-10 06:22:24,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1122 transitions. [2019-09-10 06:22:24,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:22:24,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:24,668 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:24,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash 278942115, now seen corresponding path program 1 times [2019-09-10 06:22:24,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:24,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:24,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:24,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:24,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:24,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:24,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:24,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:24,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:24,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:24,861 INFO L87 Difference]: Start difference. First operand 679 states and 1122 transitions. Second operand 3 states. [2019-09-10 06:22:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:24,913 INFO L93 Difference]: Finished difference Result 1129 states and 1855 transitions. [2019-09-10 06:22:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:24,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 06:22:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:24,924 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 06:22:24,924 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 06:22:24,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 06:22:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1123. [2019-09-10 06:22:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-09-10 06:22:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1850 transitions. [2019-09-10 06:22:24,958 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1850 transitions. Word has length 120 [2019-09-10 06:22:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:24,959 INFO L475 AbstractCegarLoop]: Abstraction has 1123 states and 1850 transitions. [2019-09-10 06:22:24,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1850 transitions. [2019-09-10 06:22:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 06:22:24,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:24,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:24,963 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1985226691, now seen corresponding path program 1 times [2019-09-10 06:22:24,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:24,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:24,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:24,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:24,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:25,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:25,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:25,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:25,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:25,143 INFO L87 Difference]: Start difference. First operand 1123 states and 1850 transitions. Second operand 3 states. [2019-09-10 06:22:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:25,206 INFO L93 Difference]: Finished difference Result 1981 states and 3235 transitions. [2019-09-10 06:22:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:25,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 06:22:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:25,222 INFO L225 Difference]: With dead ends: 1981 [2019-09-10 06:22:25,222 INFO L226 Difference]: Without dead ends: 1981 [2019-09-10 06:22:25,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-10 06:22:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-09-10 06:22:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-09-10 06:22:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 3226 transitions. [2019-09-10 06:22:25,287 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 3226 transitions. Word has length 123 [2019-09-10 06:22:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:25,287 INFO L475 AbstractCegarLoop]: Abstraction has 1971 states and 3226 transitions. [2019-09-10 06:22:25,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 3226 transitions. [2019-09-10 06:22:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 06:22:25,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:25,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:25,291 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash 664168007, now seen corresponding path program 1 times [2019-09-10 06:22:25,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:25,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:25,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:25,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:25,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:25,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:25,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:22:25,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:25,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:22:25,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:22:25,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:22:25,496 INFO L87 Difference]: Start difference. First operand 1971 states and 3226 transitions. Second operand 6 states. [2019-09-10 06:22:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:25,963 INFO L93 Difference]: Finished difference Result 8449 states and 13925 transitions. [2019-09-10 06:22:25,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:22:25,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-10 06:22:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:26,008 INFO L225 Difference]: With dead ends: 8449 [2019-09-10 06:22:26,009 INFO L226 Difference]: Without dead ends: 8449 [2019-09-10 06:22:26,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:22:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-09-10 06:22:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 3629. [2019-09-10 06:22:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-09-10 06:22:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5941 transitions. [2019-09-10 06:22:26,171 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5941 transitions. Word has length 126 [2019-09-10 06:22:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:26,171 INFO L475 AbstractCegarLoop]: Abstraction has 3629 states and 5941 transitions. [2019-09-10 06:22:26,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:22:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5941 transitions. [2019-09-10 06:22:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 06:22:26,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:26,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:26,177 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash -951796549, now seen corresponding path program 1 times [2019-09-10 06:22:26,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:26,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:26,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:26,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:26,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:26,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:26,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:26,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:26,514 INFO L87 Difference]: Start difference. First operand 3629 states and 5941 transitions. Second operand 4 states. [2019-09-10 06:22:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:26,665 INFO L93 Difference]: Finished difference Result 7275 states and 11987 transitions. [2019-09-10 06:22:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:26,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-10 06:22:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:26,701 INFO L225 Difference]: With dead ends: 7275 [2019-09-10 06:22:26,701 INFO L226 Difference]: Without dead ends: 7275 [2019-09-10 06:22:26,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2019-09-10 06:22:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 5384. [2019-09-10 06:22:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-09-10 06:22:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 8835 transitions. [2019-09-10 06:22:26,906 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 8835 transitions. Word has length 127 [2019-09-10 06:22:26,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:26,909 INFO L475 AbstractCegarLoop]: Abstraction has 5384 states and 8835 transitions. [2019-09-10 06:22:26,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 8835 transitions. [2019-09-10 06:22:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:22:26,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:26,922 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:26,922 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:26,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:26,929 INFO L82 PathProgramCache]: Analyzing trace with hash 497467790, now seen corresponding path program 1 times [2019-09-10 06:22:26,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:26,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:26,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:26,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:26,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:27,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:27,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:27,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:27,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:27,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:27,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:27,051 INFO L87 Difference]: Start difference. First operand 5384 states and 8835 transitions. Second operand 4 states. [2019-09-10 06:22:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:27,207 INFO L93 Difference]: Finished difference Result 10590 states and 17419 transitions. [2019-09-10 06:22:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:27,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 06:22:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:27,252 INFO L225 Difference]: With dead ends: 10590 [2019-09-10 06:22:27,253 INFO L226 Difference]: Without dead ends: 10590 [2019-09-10 06:22:27,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2019-09-10 06:22:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 7963. [2019-09-10 06:22:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7963 states. [2019-09-10 06:22:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 13060 transitions. [2019-09-10 06:22:27,531 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 13060 transitions. Word has length 128 [2019-09-10 06:22:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:27,531 INFO L475 AbstractCegarLoop]: Abstraction has 7963 states and 13060 transitions. [2019-09-10 06:22:27,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 13060 transitions. [2019-09-10 06:22:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:22:27,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:27,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:27,542 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1437707567, now seen corresponding path program 1 times [2019-09-10 06:22:27,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:27,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:27,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:27,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:27,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:27,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:27,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:27,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:27,893 INFO L87 Difference]: Start difference. First operand 7963 states and 13060 transitions. Second operand 3 states. [2019-09-10 06:22:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:27,996 INFO L93 Difference]: Finished difference Result 12121 states and 19845 transitions. [2019-09-10 06:22:27,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:27,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:22:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:28,025 INFO L225 Difference]: With dead ends: 12121 [2019-09-10 06:22:28,025 INFO L226 Difference]: Without dead ends: 12121 [2019-09-10 06:22:28,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-09-10 06:22:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 12119. [2019-09-10 06:22:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12119 states. [2019-09-10 06:22:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12119 states to 12119 states and 19844 transitions. [2019-09-10 06:22:28,236 INFO L78 Accepts]: Start accepts. Automaton has 12119 states and 19844 transitions. Word has length 129 [2019-09-10 06:22:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:28,236 INFO L475 AbstractCegarLoop]: Abstraction has 12119 states and 19844 transitions. [2019-09-10 06:22:28,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 12119 states and 19844 transitions. [2019-09-10 06:22:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:22:28,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:28,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:28,241 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash -686882823, now seen corresponding path program 1 times [2019-09-10 06:22:28,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:28,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:28,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:28,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:28,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:28,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:28,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:28,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:28,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:28,351 INFO L87 Difference]: Start difference. First operand 12119 states and 19844 transitions. Second operand 3 states. [2019-09-10 06:22:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:28,449 INFO L93 Difference]: Finished difference Result 17029 states and 27841 transitions. [2019-09-10 06:22:28,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:28,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:22:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:28,494 INFO L225 Difference]: With dead ends: 17029 [2019-09-10 06:22:28,494 INFO L226 Difference]: Without dead ends: 17029 [2019-09-10 06:22:28,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17029 states. [2019-09-10 06:22:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17029 to 17027. [2019-09-10 06:22:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17027 states. [2019-09-10 06:22:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17027 states to 17027 states and 27840 transitions. [2019-09-10 06:22:28,881 INFO L78 Accepts]: Start accepts. Automaton has 17027 states and 27840 transitions. Word has length 129 [2019-09-10 06:22:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:28,882 INFO L475 AbstractCegarLoop]: Abstraction has 17027 states and 27840 transitions. [2019-09-10 06:22:28,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 17027 states and 27840 transitions. [2019-09-10 06:22:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:22:28,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:28,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:28,886 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1815419934, now seen corresponding path program 1 times [2019-09-10 06:22:28,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:28,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:28,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:28,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:29,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:29,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:29,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:29,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:29,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:29,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:29,003 INFO L87 Difference]: Start difference. First operand 17027 states and 27840 transitions. Second operand 4 states. [2019-09-10 06:22:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:29,199 INFO L93 Difference]: Finished difference Result 37659 states and 61652 transitions. [2019-09-10 06:22:29,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:29,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 06:22:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:29,879 INFO L225 Difference]: With dead ends: 37659 [2019-09-10 06:22:29,880 INFO L226 Difference]: Without dead ends: 37659 [2019-09-10 06:22:29,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37659 states. [2019-09-10 06:22:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37659 to 27287. [2019-09-10 06:22:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27287 states. [2019-09-10 06:22:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27287 states to 27287 states and 44556 transitions. [2019-09-10 06:22:30,378 INFO L78 Accepts]: Start accepts. Automaton has 27287 states and 44556 transitions. Word has length 129 [2019-09-10 06:22:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:30,378 INFO L475 AbstractCegarLoop]: Abstraction has 27287 states and 44556 transitions. [2019-09-10 06:22:30,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 27287 states and 44556 transitions. [2019-09-10 06:22:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:22:30,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:30,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:30,381 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash -332561375, now seen corresponding path program 1 times [2019-09-10 06:22:30,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:30,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:30,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:30,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:30,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:30,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:30,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:30,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:30,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:30,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:30,480 INFO L87 Difference]: Start difference. First operand 27287 states and 44556 transitions. Second operand 3 states. [2019-09-10 06:22:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:30,694 INFO L93 Difference]: Finished difference Result 38191 states and 62255 transitions. [2019-09-10 06:22:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:30,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:22:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:30,782 INFO L225 Difference]: With dead ends: 38191 [2019-09-10 06:22:30,783 INFO L226 Difference]: Without dead ends: 38191 [2019-09-10 06:22:30,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38191 states. [2019-09-10 06:22:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38191 to 38189. [2019-09-10 06:22:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38189 states. [2019-09-10 06:22:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38189 states to 38189 states and 62254 transitions. [2019-09-10 06:22:32,147 INFO L78 Accepts]: Start accepts. Automaton has 38189 states and 62254 transitions. Word has length 129 [2019-09-10 06:22:32,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:32,147 INFO L475 AbstractCegarLoop]: Abstraction has 38189 states and 62254 transitions. [2019-09-10 06:22:32,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 38189 states and 62254 transitions. [2019-09-10 06:22:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:22:32,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:32,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:32,150 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:32,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1449135215, now seen corresponding path program 1 times [2019-09-10 06:22:32,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:32,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:32,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:32,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:32,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:32,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:32,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:32,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:32,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:32,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:32,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:32,249 INFO L87 Difference]: Start difference. First operand 38189 states and 62254 transitions. Second operand 3 states. [2019-09-10 06:22:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:32,458 INFO L93 Difference]: Finished difference Result 56815 states and 92723 transitions. [2019-09-10 06:22:32,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:32,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:22:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:32,624 INFO L225 Difference]: With dead ends: 56815 [2019-09-10 06:22:32,625 INFO L226 Difference]: Without dead ends: 56815 [2019-09-10 06:22:32,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56815 states. [2019-09-10 06:22:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56815 to 56813. [2019-09-10 06:22:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56813 states. [2019-09-10 06:22:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56813 states to 56813 states and 92722 transitions. [2019-09-10 06:22:33,511 INFO L78 Accepts]: Start accepts. Automaton has 56813 states and 92722 transitions. Word has length 129 [2019-09-10 06:22:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:33,512 INFO L475 AbstractCegarLoop]: Abstraction has 56813 states and 92722 transitions. [2019-09-10 06:22:33,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 56813 states and 92722 transitions. [2019-09-10 06:22:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 06:22:33,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:33,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:33,516 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash -495937323, now seen corresponding path program 1 times [2019-09-10 06:22:33,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:33,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:33,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:33,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:33,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:33,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:33,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:33,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:33,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:33,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:33,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:33,679 INFO L87 Difference]: Start difference. First operand 56813 states and 92722 transitions. Second operand 4 states. [2019-09-10 06:22:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:34,252 INFO L93 Difference]: Finished difference Result 125501 states and 204991 transitions. [2019-09-10 06:22:34,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:34,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 06:22:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:34,895 INFO L225 Difference]: With dead ends: 125501 [2019-09-10 06:22:34,895 INFO L226 Difference]: Without dead ends: 125501 [2019-09-10 06:22:34,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125501 states. [2019-09-10 06:22:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125501 to 90932. [2019-09-10 06:22:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-10 06:22:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 148075 transitions. [2019-09-10 06:22:37,753 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 148075 transitions. Word has length 130 [2019-09-10 06:22:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:37,753 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 148075 transitions. [2019-09-10 06:22:37,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 148075 transitions. [2019-09-10 06:22:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 06:22:37,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:37,756 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:37,756 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1344026747, now seen corresponding path program 1 times [2019-09-10 06:22:37,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:37,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:37,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:38,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:38,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:22:38,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:38,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:22:38,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:22:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:22:38,074 INFO L87 Difference]: Start difference. First operand 90932 states and 148075 transitions. Second operand 6 states. [2019-09-10 06:22:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:38,892 INFO L93 Difference]: Finished difference Result 90934 states and 147451 transitions. [2019-09-10 06:22:38,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:22:38,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 06:22:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:39,018 INFO L225 Difference]: With dead ends: 90934 [2019-09-10 06:22:39,018 INFO L226 Difference]: Without dead ends: 90934 [2019-09-10 06:22:39,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:22:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90934 states. [2019-09-10 06:22:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90934 to 90932. [2019-09-10 06:22:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-10 06:22:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 147450 transitions. [2019-09-10 06:22:41,670 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 147450 transitions. Word has length 132 [2019-09-10 06:22:41,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:41,671 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 147450 transitions. [2019-09-10 06:22:41,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:22:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 147450 transitions. [2019-09-10 06:22:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 06:22:41,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:41,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:41,673 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:41,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:41,674 INFO L82 PathProgramCache]: Analyzing trace with hash 29972819, now seen corresponding path program 1 times [2019-09-10 06:22:41,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:41,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:41,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:41,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:41,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:41,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:41,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:22:41,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:41,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:22:41,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:22:41,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:22:41,946 INFO L87 Difference]: Start difference. First operand 90932 states and 147450 transitions. Second operand 6 states. [2019-09-10 06:22:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:42,555 INFO L93 Difference]: Finished difference Result 205462 states and 332581 transitions. [2019-09-10 06:22:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:22:42,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-10 06:22:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:43,309 INFO L225 Difference]: With dead ends: 205462 [2019-09-10 06:22:43,309 INFO L226 Difference]: Without dead ends: 205462 [2019-09-10 06:22:43,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:22:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205462 states. [2019-09-10 06:22:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205462 to 205458. [2019-09-10 06:22:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205458 states. [2019-09-10 06:22:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205458 states to 205458 states and 332579 transitions. [2019-09-10 06:22:47,472 INFO L78 Accepts]: Start accepts. Automaton has 205458 states and 332579 transitions. Word has length 135 [2019-09-10 06:22:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:47,473 INFO L475 AbstractCegarLoop]: Abstraction has 205458 states and 332579 transitions. [2019-09-10 06:22:47,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:22:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 205458 states and 332579 transitions. [2019-09-10 06:22:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 06:22:47,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:47,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:47,475 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash 927248290, now seen corresponding path program 1 times [2019-09-10 06:22:47,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:47,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:47,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:47,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:47,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:47,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:47,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:22:47,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:47,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:22:47,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:22:47,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:47,626 INFO L87 Difference]: Start difference. First operand 205458 states and 332579 transitions. Second operand 5 states. [2019-09-10 06:22:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:52,255 INFO L93 Difference]: Finished difference Result 394478 states and 634162 transitions. [2019-09-10 06:22:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:22:52,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-10 06:22:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:52,834 INFO L225 Difference]: With dead ends: 394478 [2019-09-10 06:22:52,834 INFO L226 Difference]: Without dead ends: 394478 [2019-09-10 06:22:52,834 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 06:22:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394478 states. [2019-09-10 06:22:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394478 to 210114. [2019-09-10 06:22:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210114 states. [2019-09-10 06:22:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210114 states to 210114 states and 337208 transitions. [2019-09-10 06:22:55,820 INFO L78 Accepts]: Start accepts. Automaton has 210114 states and 337208 transitions. Word has length 136 [2019-09-10 06:22:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:55,820 INFO L475 AbstractCegarLoop]: Abstraction has 210114 states and 337208 transitions. [2019-09-10 06:22:55,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:22:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 210114 states and 337208 transitions. [2019-09-10 06:22:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:22:55,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:55,828 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:22:55,829 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash 179427060, now seen corresponding path program 1 times [2019-09-10 06:22:55,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:55,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:55,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:22:56,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:56,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:22:56,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:56,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:22:56,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:22:56,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:22:56,028 INFO L87 Difference]: Start difference. First operand 210114 states and 337208 transitions. Second operand 6 states. [2019-09-10 06:22:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:57,944 INFO L93 Difference]: Finished difference Result 373577 states and 599998 transitions. [2019-09-10 06:22:57,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:22:57,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:22:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:58,496 INFO L225 Difference]: With dead ends: 373577 [2019-09-10 06:22:58,497 INFO L226 Difference]: Without dead ends: 373577 [2019-09-10 06:22:58,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:22:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373577 states. [2019-09-10 06:23:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373577 to 291115. [2019-09-10 06:23:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291115 states. [2019-09-10 06:23:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291115 states to 291115 states and 466642 transitions. [2019-09-10 06:23:06,594 INFO L78 Accepts]: Start accepts. Automaton has 291115 states and 466642 transitions. Word has length 167 [2019-09-10 06:23:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:06,595 INFO L475 AbstractCegarLoop]: Abstraction has 291115 states and 466642 transitions. [2019-09-10 06:23:06,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:23:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 291115 states and 466642 transitions. [2019-09-10 06:23:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:23:06,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:06,603 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:06,603 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:06,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:06,604 INFO L82 PathProgramCache]: Analyzing trace with hash 930251804, now seen corresponding path program 1 times [2019-09-10 06:23:06,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:06,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:06,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:06,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:06,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:23:06,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:06,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:23:06,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:06,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:23:06,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:23:06,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:23:06,794 INFO L87 Difference]: Start difference. First operand 291115 states and 466642 transitions. Second operand 6 states. [2019-09-10 06:23:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:07,963 INFO L93 Difference]: Finished difference Result 413673 states and 664622 transitions. [2019-09-10 06:23:07,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:23:07,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:23:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:08,602 INFO L225 Difference]: With dead ends: 413673 [2019-09-10 06:23:08,602 INFO L226 Difference]: Without dead ends: 413673 [2019-09-10 06:23:08,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:23:08,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413673 states. [2019-09-10 06:23:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413673 to 368773. [2019-09-10 06:23:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368773 states. [2019-09-10 06:23:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368773 states to 368773 states and 591198 transitions. [2019-09-10 06:23:19,362 INFO L78 Accepts]: Start accepts. Automaton has 368773 states and 591198 transitions. Word has length 167 [2019-09-10 06:23:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:19,363 INFO L475 AbstractCegarLoop]: Abstraction has 368773 states and 591198 transitions. [2019-09-10 06:23:19,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:23:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 368773 states and 591198 transitions. [2019-09-10 06:23:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:23:19,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:19,370 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:19,370 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:19,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:19,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1284573252, now seen corresponding path program 1 times [2019-09-10 06:23:19,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:19,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:19,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:19,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 06:23:20,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:20,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:23:20,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:20,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:23:20,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:23:20,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:23:20,588 INFO L87 Difference]: Start difference. First operand 368773 states and 591198 transitions. Second operand 6 states. [2019-09-10 06:23:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:21,830 INFO L93 Difference]: Finished difference Result 438685 states and 704878 transitions. [2019-09-10 06:23:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:23:21,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:23:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:22,530 INFO L225 Difference]: With dead ends: 438685 [2019-09-10 06:23:22,530 INFO L226 Difference]: Without dead ends: 438685 [2019-09-10 06:23:22,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:23:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438685 states. [2019-09-10 06:23:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438685 to 414701. [2019-09-10 06:23:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414701 states. [2019-09-10 06:23:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414701 states to 414701 states and 665314 transitions. [2019-09-10 06:23:33,318 INFO L78 Accepts]: Start accepts. Automaton has 414701 states and 665314 transitions. Word has length 167 [2019-09-10 06:23:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:33,319 INFO L475 AbstractCegarLoop]: Abstraction has 414701 states and 665314 transitions. [2019-09-10 06:23:33,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:23:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 414701 states and 665314 transitions. [2019-09-10 06:23:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:23:33,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:33,324 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:33,324 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:33,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1228697454, now seen corresponding path program 1 times [2019-09-10 06:23:33,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:33,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:33,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:33,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:33,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:23:33,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:33,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:33,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:33,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:33,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:33,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:33,433 INFO L87 Difference]: Start difference. First operand 414701 states and 665314 transitions. Second operand 3 states. [2019-09-10 06:23:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:36,558 INFO L93 Difference]: Finished difference Result 680383 states and 1093049 transitions. [2019-09-10 06:23:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:36,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 06:23:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:37,702 INFO L225 Difference]: With dead ends: 680383 [2019-09-10 06:23:37,702 INFO L226 Difference]: Without dead ends: 680383 [2019-09-10 06:23:37,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:38,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680383 states. [2019-09-10 06:23:52,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680383 to 679382. [2019-09-10 06:23:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679382 states. [2019-09-10 06:23:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679382 states to 679382 states and 1092049 transitions. [2019-09-10 06:23:53,701 INFO L78 Accepts]: Start accepts. Automaton has 679382 states and 1092049 transitions. Word has length 167 [2019-09-10 06:23:53,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:53,701 INFO L475 AbstractCegarLoop]: Abstraction has 679382 states and 1092049 transitions. [2019-09-10 06:23:53,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 679382 states and 1092049 transitions. [2019-09-10 06:23:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:23:53,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:53,708 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:53,708 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:53,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash 593692898, now seen corresponding path program 1 times [2019-09-10 06:23:53,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:53,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:53,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:53,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:53,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:53,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:53,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:53,848 INFO L87 Difference]: Start difference. First operand 679382 states and 1092049 transitions. Second operand 3 states. [2019-09-10 06:24:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:05,364 INFO L93 Difference]: Finished difference Result 1335147 states and 2138025 transitions. [2019-09-10 06:24:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:05,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 06:24:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:07,443 INFO L225 Difference]: With dead ends: 1335147 [2019-09-10 06:24:07,443 INFO L226 Difference]: Without dead ends: 1335147 [2019-09-10 06:24:07,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335147 states. [2019-09-10 06:24:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335147 to 1335145. [2019-09-10 06:24:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335145 states. [2019-09-10 06:25:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335145 states to 1335145 states and 2138024 transitions. [2019-09-10 06:25:02,175 INFO L78 Accepts]: Start accepts. Automaton has 1335145 states and 2138024 transitions. Word has length 168 [2019-09-10 06:25:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:02,175 INFO L475 AbstractCegarLoop]: Abstraction has 1335145 states and 2138024 transitions. [2019-09-10 06:25:02,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1335145 states and 2138024 transitions. [2019-09-10 06:25:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:25:02,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:02,183 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:02,184 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:02,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash -152965972, now seen corresponding path program 1 times [2019-09-10 06:25:02,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:02,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:02,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:02,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:02,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:02,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:02,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:02,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:02,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:02,296 INFO L87 Difference]: Start difference. First operand 1335145 states and 2138024 transitions. Second operand 3 states. [2019-09-10 06:25:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:31,085 INFO L93 Difference]: Finished difference Result 2623087 states and 4183953 transitions. [2019-09-10 06:25:31,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:31,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 06:25:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:36,586 INFO L225 Difference]: With dead ends: 2623087 [2019-09-10 06:25:36,586 INFO L226 Difference]: Without dead ends: 2623087 [2019-09-10 06:25:36,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623087 states.