java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:47:12,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:47:12,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:47:12,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:47:12,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:47:12,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:47:12,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:47:12,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:47:12,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:47:12,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:47:12,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:47:12,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:47:12,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:47:12,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:47:12,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:47:12,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:47:12,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:47:12,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:47:12,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:47:12,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:47:12,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:47:12,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:47:12,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:47:12,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:47:12,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:47:12,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:47:12,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:47:12,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:47:12,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:47:12,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:47:12,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:47:12,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:47:12,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:47:12,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:47:12,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:47:12,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:47:12,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:47:12,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:47:12,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:47:12,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:47:12,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:47:12,443 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 04:47:12,470 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:47:12,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:47:12,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:47:12,471 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:47:12,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:47:12,473 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:47:12,473 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:47:12,473 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:47:12,473 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:47:12,474 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:47:12,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:47:12,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:47:12,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:47:12,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:47:12,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:47:12,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:47:12,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:47:12,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:47:12,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:47:12,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:47:12,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:47:12,478 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:47:12,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:47:12,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:47:12,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:47:12,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:47:12,479 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:47:12,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:47:12,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:47:12,480 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:47:12,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:47:12,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:47:12,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:47:12,560 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:47:12,561 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:47:12,562 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2019-09-10 04:47:12,622 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b4c9530/e2a59711ac744d93a1275d0364c0efcd/FLAGa59e5f3f3 [2019-09-10 04:47:13,160 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:47:13,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2019-09-10 04:47:13,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b4c9530/e2a59711ac744d93a1275d0364c0efcd/FLAGa59e5f3f3 [2019-09-10 04:47:13,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b4c9530/e2a59711ac744d93a1275d0364c0efcd [2019-09-10 04:47:13,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:47:13,459 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:47:13,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:47:13,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:47:13,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:47:13,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:47:13" (1/1) ... [2019-09-10 04:47:13,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f90b705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13, skipping insertion in model container [2019-09-10 04:47:13,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:47:13" (1/1) ... [2019-09-10 04:47:13,474 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:47:13,539 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:47:13,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:47:13,894 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:47:13,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:47:13,998 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:47:13,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13 WrapperNode [2019-09-10 04:47:13,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:47:14,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:47:14,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:47:14,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:47:14,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13" (1/1) ... [2019-09-10 04:47:14,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13" (1/1) ... [2019-09-10 04:47:14,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13" (1/1) ... [2019-09-10 04:47:14,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13" (1/1) ... [2019-09-10 04:47:14,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13" (1/1) ... [2019-09-10 04:47:14,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13" (1/1) ... [2019-09-10 04:47:14,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13" (1/1) ... [2019-09-10 04:47:14,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:47:14,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:47:14,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:47:14,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:47:14,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13" (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 04:47:14,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:47:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:47:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:47:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:47:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:47:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:47:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:47:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:47:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-10 04:47:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure node8 [2019-09-10 04:47:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:47:14,128 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:47:14,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:47:14,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:47:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:47:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:47:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:47:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:47:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:47:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:47:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:47:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:47:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:47:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:47:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:47:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:47:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:47:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 04:47:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-10 04:47:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:47:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:47:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:47:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:47:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:47:15,016 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:47:15,016 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:47:15,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:47:15 BoogieIcfgContainer [2019-09-10 04:47:15,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:47:15,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:47:15,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:47:15,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:47:15,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:47:13" (1/3) ... [2019-09-10 04:47:15,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b57c248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:47:15, skipping insertion in model container [2019-09-10 04:47:15,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:47:13" (2/3) ... [2019-09-10 04:47:15,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b57c248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:47:15, skipping insertion in model container [2019-09-10 04:47:15,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:47:15" (3/3) ... [2019-09-10 04:47:15,027 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2019-09-10 04:47:15,037 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:47:15,046 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:47:15,063 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:47:15,092 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:47:15,092 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:47:15,093 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:47:15,093 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:47:15,093 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:47:15,093 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:47:15,093 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:47:15,094 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:47:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2019-09-10 04:47:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 04:47:15,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:15,146 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] [2019-09-10 04:47:15,148 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2081954151, now seen corresponding path program 1 times [2019-09-10 04:47:15,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:15,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:15,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:15,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:15,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:15,717 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 04:47:15,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:15,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:15,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:15,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:15,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:15,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:15,744 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 5 states. [2019-09-10 04:47:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:15,931 INFO L93 Difference]: Finished difference Result 191 states and 296 transitions. [2019-09-10 04:47:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:47:15,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 04:47:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:15,947 INFO L225 Difference]: With dead ends: 191 [2019-09-10 04:47:15,947 INFO L226 Difference]: Without dead ends: 182 [2019-09-10 04:47:15,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:47:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-10 04:47:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-09-10 04:47:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-10 04:47:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2019-09-10 04:47:16,004 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 82 [2019-09-10 04:47:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:16,004 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2019-09-10 04:47:16,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2019-09-10 04:47:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 04:47:16,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:16,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:16,012 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:16,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash 449560489, now seen corresponding path program 1 times [2019-09-10 04:47:16,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:16,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:16,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:16,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:16,770 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 04:47:16,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:16,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 04:47:16,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:16,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 04:47:16,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 04:47:16,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-10 04:47:16,774 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 19 states. [2019-09-10 04:47:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:34,970 INFO L93 Difference]: Finished difference Result 2502 states and 3896 transitions. [2019-09-10 04:47:34,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-10 04:47:34,973 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 142 [2019-09-10 04:47:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:35,005 INFO L225 Difference]: With dead ends: 2502 [2019-09-10 04:47:35,005 INFO L226 Difference]: Without dead ends: 2502 [2019-09-10 04:47:35,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4736 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2532, Invalid=9240, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 04:47:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-09-10 04:47:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1290. [2019-09-10 04:47:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-09-10 04:47:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1844 transitions. [2019-09-10 04:47:35,239 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1844 transitions. Word has length 142 [2019-09-10 04:47:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:35,242 INFO L475 AbstractCegarLoop]: Abstraction has 1290 states and 1844 transitions. [2019-09-10 04:47:35,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 04:47:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1844 transitions. [2019-09-10 04:47:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:35,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:35,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:35,263 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:35,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1108463303, now seen corresponding path program 1 times [2019-09-10 04:47:35,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:35,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:35,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:35,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:35,399 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 04:47:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:35,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:47:35,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:35,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:47:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:47:35,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:47:35,402 INFO L87 Difference]: Start difference. First operand 1290 states and 1844 transitions. Second operand 3 states. [2019-09-10 04:47:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:35,450 INFO L93 Difference]: Finished difference Result 2439 states and 3496 transitions. [2019-09-10 04:47:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:47:35,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 04:47:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:35,465 INFO L225 Difference]: With dead ends: 2439 [2019-09-10 04:47:35,465 INFO L226 Difference]: Without dead ends: 2439 [2019-09-10 04:47:35,466 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 04:47:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2019-09-10 04:47:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2437. [2019-09-10 04:47:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-09-10 04:47:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3495 transitions. [2019-09-10 04:47:35,552 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3495 transitions. Word has length 144 [2019-09-10 04:47:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:35,553 INFO L475 AbstractCegarLoop]: Abstraction has 2437 states and 3495 transitions. [2019-09-10 04:47:35,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:47:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3495 transitions. [2019-09-10 04:47:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:35,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:35,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:35,558 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1898801537, now seen corresponding path program 1 times [2019-09-10 04:47:35,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:35,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:35,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:35,854 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 04:47:35,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:35,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:35,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:35,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:35,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:35,856 INFO L87 Difference]: Start difference. First operand 2437 states and 3495 transitions. Second operand 5 states. [2019-09-10 04:47:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:36,667 INFO L93 Difference]: Finished difference Result 3734 states and 5312 transitions. [2019-09-10 04:47:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:36,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:36,688 INFO L225 Difference]: With dead ends: 3734 [2019-09-10 04:47:36,688 INFO L226 Difference]: Without dead ends: 3734 [2019-09-10 04:47:36,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:47:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2019-09-10 04:47:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3732. [2019-09-10 04:47:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-09-10 04:47:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 5311 transitions. [2019-09-10 04:47:36,858 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 5311 transitions. Word has length 144 [2019-09-10 04:47:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:36,858 INFO L475 AbstractCegarLoop]: Abstraction has 3732 states and 5311 transitions. [2019-09-10 04:47:36,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 5311 transitions. [2019-09-10 04:47:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:36,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:36,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:36,862 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1740328011, now seen corresponding path program 1 times [2019-09-10 04:47:36,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:36,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:36,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:36,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:36,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:47:37,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:37,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:37,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:37,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:37,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:37,023 INFO L87 Difference]: Start difference. First operand 3732 states and 5311 transitions. Second operand 5 states. [2019-09-10 04:47:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:37,724 INFO L93 Difference]: Finished difference Result 7184 states and 10183 transitions. [2019-09-10 04:47:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:37,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:37,765 INFO L225 Difference]: With dead ends: 7184 [2019-09-10 04:47:37,765 INFO L226 Difference]: Without dead ends: 7184 [2019-09-10 04:47:37,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:47:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7184 states. [2019-09-10 04:47:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7184 to 7182. [2019-09-10 04:47:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7182 states. [2019-09-10 04:47:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7182 states to 7182 states and 10182 transitions. [2019-09-10 04:47:38,000 INFO L78 Accepts]: Start accepts. Automaton has 7182 states and 10182 transitions. Word has length 144 [2019-09-10 04:47:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:38,001 INFO L475 AbstractCegarLoop]: Abstraction has 7182 states and 10182 transitions. [2019-09-10 04:47:38,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 7182 states and 10182 transitions. [2019-09-10 04:47:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:38,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:38,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:38,004 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:38,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1184196415, now seen corresponding path program 1 times [2019-09-10 04:47:38,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:38,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:38,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:38,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:38,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:38,159 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 04:47:38,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:38,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:38,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:38,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:38,161 INFO L87 Difference]: Start difference. First operand 7182 states and 10182 transitions. Second operand 5 states. [2019-09-10 04:47:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:38,959 INFO L93 Difference]: Finished difference Result 13877 states and 19565 transitions. [2019-09-10 04:47:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:38,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:39,032 INFO L225 Difference]: With dead ends: 13877 [2019-09-10 04:47:39,032 INFO L226 Difference]: Without dead ends: 13877 [2019-09-10 04:47:39,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:47:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-09-10 04:47:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 13875. [2019-09-10 04:47:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13875 states. [2019-09-10 04:47:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13875 states to 13875 states and 19564 transitions. [2019-09-10 04:47:39,423 INFO L78 Accepts]: Start accepts. Automaton has 13875 states and 19564 transitions. Word has length 144 [2019-09-10 04:47:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:39,423 INFO L475 AbstractCegarLoop]: Abstraction has 13875 states and 19564 transitions. [2019-09-10 04:47:39,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 13875 states and 19564 transitions. [2019-09-10 04:47:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:39,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:39,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:39,427 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1463691277, now seen corresponding path program 1 times [2019-09-10 04:47:39,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:39,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:39,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:39,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:39,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:39,585 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 04:47:39,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:39,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:39,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:39,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:39,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:39,587 INFO L87 Difference]: Start difference. First operand 13875 states and 19564 transitions. Second operand 5 states. [2019-09-10 04:47:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:40,418 INFO L93 Difference]: Finished difference Result 26813 states and 37591 transitions. [2019-09-10 04:47:40,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:40,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:40,529 INFO L225 Difference]: With dead ends: 26813 [2019-09-10 04:47:40,529 INFO L226 Difference]: Without dead ends: 26813 [2019-09-10 04:47:40,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:47:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26813 states. [2019-09-10 04:47:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26813 to 26811. [2019-09-10 04:47:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26811 states. [2019-09-10 04:47:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26811 states to 26811 states and 37590 transitions. [2019-09-10 04:47:41,659 INFO L78 Accepts]: Start accepts. Automaton has 26811 states and 37590 transitions. Word has length 144 [2019-09-10 04:47:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:41,660 INFO L475 AbstractCegarLoop]: Abstraction has 26811 states and 37590 transitions. [2019-09-10 04:47:41,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 26811 states and 37590 transitions. [2019-09-10 04:47:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:41,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:41,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:41,663 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:41,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:41,663 INFO L82 PathProgramCache]: Analyzing trace with hash 112515843, now seen corresponding path program 1 times [2019-09-10 04:47:41,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:41,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:41,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:41,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:41,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:41,814 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 04:47:41,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:41,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:41,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:41,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:41,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:41,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:41,816 INFO L87 Difference]: Start difference. First operand 26811 states and 37590 transitions. Second operand 5 states. [2019-09-10 04:47:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:42,632 INFO L93 Difference]: Finished difference Result 51893 states and 72251 transitions. [2019-09-10 04:47:42,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:42,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:42,984 INFO L225 Difference]: With dead ends: 51893 [2019-09-10 04:47:42,984 INFO L226 Difference]: Without dead ends: 51893 [2019-09-10 04:47:42,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:47:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51893 states. [2019-09-10 04:47:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51893 to 51891. [2019-09-10 04:47:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51891 states. [2019-09-10 04:47:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51891 states to 51891 states and 72250 transitions. [2019-09-10 04:47:43,942 INFO L78 Accepts]: Start accepts. Automaton has 51891 states and 72250 transitions. Word has length 144 [2019-09-10 04:47:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:43,942 INFO L475 AbstractCegarLoop]: Abstraction has 51891 states and 72250 transitions. [2019-09-10 04:47:43,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51891 states and 72250 transitions. [2019-09-10 04:47:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:43,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:43,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:43,945 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1074138931, now seen corresponding path program 1 times [2019-09-10 04:47:43,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:43,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:43,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:43,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:43,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:45,109 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 04:47:45,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:45,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:45,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:45,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:45,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:45,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:45,111 INFO L87 Difference]: Start difference. First operand 51891 states and 72250 transitions. Second operand 5 states. [2019-09-10 04:47:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:46,142 INFO L93 Difference]: Finished difference Result 100253 states and 138619 transitions. [2019-09-10 04:47:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:46,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:46,438 INFO L225 Difference]: With dead ends: 100253 [2019-09-10 04:47:46,438 INFO L226 Difference]: Without dead ends: 100253 [2019-09-10 04:47:46,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:47:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100253 states. [2019-09-10 04:47:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100253 to 100251. [2019-09-10 04:47:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100251 states. [2019-09-10 04:47:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100251 states to 100251 states and 138618 transitions. [2019-09-10 04:47:48,450 INFO L78 Accepts]: Start accepts. Automaton has 100251 states and 138618 transitions. Word has length 144 [2019-09-10 04:47:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:48,451 INFO L475 AbstractCegarLoop]: Abstraction has 100251 states and 138618 transitions. [2019-09-10 04:47:48,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 100251 states and 138618 transitions. [2019-09-10 04:47:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:48,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:48,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:48,453 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash 173369923, now seen corresponding path program 1 times [2019-09-10 04:47:48,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:48,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:48,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:48,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:48,605 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 04:47:48,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:48,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:48,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:48,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:48,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:48,607 INFO L87 Difference]: Start difference. First operand 100251 states and 138618 transitions. Second operand 5 states. [2019-09-10 04:47:51,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:51,811 INFO L93 Difference]: Finished difference Result 193229 states and 265355 transitions. [2019-09-10 04:47:51,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:51,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:47:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:52,319 INFO L225 Difference]: With dead ends: 193229 [2019-09-10 04:47:52,319 INFO L226 Difference]: Without dead ends: 193229 [2019-09-10 04:47:52,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:47:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193229 states. [2019-09-10 04:47:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193229 to 193227. [2019-09-10 04:47:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193227 states. [2019-09-10 04:47:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193227 states to 193227 states and 265354 transitions. [2019-09-10 04:47:59,309 INFO L78 Accepts]: Start accepts. Automaton has 193227 states and 265354 transitions. Word has length 144 [2019-09-10 04:47:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:59,309 INFO L475 AbstractCegarLoop]: Abstraction has 193227 states and 265354 transitions. [2019-09-10 04:47:59,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 193227 states and 265354 transitions. [2019-09-10 04:47:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:47:59,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:59,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:47:59,311 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:59,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1464858227, now seen corresponding path program 1 times [2019-09-10 04:47:59,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:59,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:59,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:59,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:59,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:47:59,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:59,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:59,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:59,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:59,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:59,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:59,452 INFO L87 Difference]: Start difference. First operand 193227 states and 265354 transitions. Second operand 5 states. [2019-09-10 04:48:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:00,882 INFO L93 Difference]: Finished difference Result 371981 states and 507019 transitions. [2019-09-10 04:48:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:48:00,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 04:48:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:05,957 INFO L225 Difference]: With dead ends: 371981 [2019-09-10 04:48:05,958 INFO L226 Difference]: Without dead ends: 371981 [2019-09-10 04:48:05,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:48:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371981 states. [2019-09-10 04:48:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371981 to 371979. [2019-09-10 04:48:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371979 states. [2019-09-10 04:48:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371979 states to 371979 states and 507018 transitions. [2019-09-10 04:48:12,512 INFO L78 Accepts]: Start accepts. Automaton has 371979 states and 507018 transitions. Word has length 144 [2019-09-10 04:48:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:12,513 INFO L475 AbstractCegarLoop]: Abstraction has 371979 states and 507018 transitions. [2019-09-10 04:48:12,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:48:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 371979 states and 507018 transitions. [2019-09-10 04:48:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 04:48:12,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:48:12,515 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:12,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash -269112957, now seen corresponding path program 1 times [2019-09-10 04:48:12,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:12,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:12,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:12,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:12,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:13,104 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 04:48:13,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:48:13,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 04:48:13,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:13,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 04:48:13,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 04:48:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-09-10 04:48:13,107 INFO L87 Difference]: Start difference. First operand 371979 states and 507018 transitions. Second operand 19 states. [2019-09-10 04:48:20,275 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 04:48:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:42,621 INFO L93 Difference]: Finished difference Result 868843 states and 1343962 transitions. [2019-09-10 04:48:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-10 04:48:42,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2019-09-10 04:48:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:45,107 INFO L225 Difference]: With dead ends: 868843 [2019-09-10 04:48:45,108 INFO L226 Difference]: Without dead ends: 868843 [2019-09-10 04:48:45,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4858 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2626, Invalid=9364, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 04:48:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868843 states. [2019-09-10 04:49:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868843 to 493259. [2019-09-10 04:49:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493259 states. [2019-09-10 04:49:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493259 states to 493259 states and 672842 transitions. [2019-09-10 04:49:18,496 INFO L78 Accepts]: Start accepts. Automaton has 493259 states and 672842 transitions. Word has length 144 [2019-09-10 04:49:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:49:18,496 INFO L475 AbstractCegarLoop]: Abstraction has 493259 states and 672842 transitions. [2019-09-10 04:49:18,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 04:49:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 493259 states and 672842 transitions. [2019-09-10 04:49:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:49:18,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:49:18,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:49:18,498 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:49:18,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:49:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1791595168, now seen corresponding path program 1 times [2019-09-10 04:49:18,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:49:18,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:49:18,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:49:18,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:49:18,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:49:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:49:18,611 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 04:49:18,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:49:18,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:49:18,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:49:18,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:49:18,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:49:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:49:18,614 INFO L87 Difference]: Start difference. First operand 493259 states and 672842 transitions. Second operand 5 states. [2019-09-10 04:49:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:49:27,995 INFO L93 Difference]: Finished difference Result 931539 states and 1276497 transitions. [2019-09-10 04:49:27,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:49:27,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-10 04:49:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:49:36,976 INFO L225 Difference]: With dead ends: 931539 [2019-09-10 04:49:36,976 INFO L226 Difference]: Without dead ends: 931539 [2019-09-10 04:49:36,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:49:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931539 states. [2019-09-10 04:49:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931539 to 706351. [2019-09-10 04:49:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706351 states. [2019-09-10 04:50:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706351 states to 706351 states and 966159 transitions. [2019-09-10 04:50:01,801 INFO L78 Accepts]: Start accepts. Automaton has 706351 states and 966159 transitions. Word has length 145 [2019-09-10 04:50:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:50:01,801 INFO L475 AbstractCegarLoop]: Abstraction has 706351 states and 966159 transitions. [2019-09-10 04:50:01,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:50:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 706351 states and 966159 transitions. [2019-09-10 04:50:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:50:01,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:50:01,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:50:01,804 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:50:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:50:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash -855947167, now seen corresponding path program 1 times [2019-09-10 04:50:01,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:50:01,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:50:01,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:50:01,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:50:01,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:50:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:50:01,957 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 04:50:01,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:50:01,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:50:01,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:50:01,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:50:01,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:50:01,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:50:01,959 INFO L87 Difference]: Start difference. First operand 706351 states and 966159 transitions. Second operand 8 states. [2019-09-10 04:50:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:50:18,175 INFO L93 Difference]: Finished difference Result 833337 states and 1191489 transitions. [2019-09-10 04:50:18,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:50:18,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2019-09-10 04:50:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:50:20,730 INFO L225 Difference]: With dead ends: 833337 [2019-09-10 04:50:20,730 INFO L226 Difference]: Without dead ends: 833337 [2019-09-10 04:50:20,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:50:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833337 states. [2019-09-10 04:50:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833337 to 755887. [2019-09-10 04:50:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755887 states. [2019-09-10 04:50:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755887 states to 755887 states and 1016239 transitions. [2019-09-10 04:50:52,802 INFO L78 Accepts]: Start accepts. Automaton has 755887 states and 1016239 transitions. Word has length 145 [2019-09-10 04:50:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:50:52,802 INFO L475 AbstractCegarLoop]: Abstraction has 755887 states and 1016239 transitions. [2019-09-10 04:50:52,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:50:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 755887 states and 1016239 transitions. [2019-09-10 04:50:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 04:50:52,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:50:52,953 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, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-09-10 04:50:52,953 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:50:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:50:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1972050562, now seen corresponding path program 1 times [2019-09-10 04:50:52,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:50:52,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:50:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:50:52,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:50:52,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:50:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:50:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:50:53,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:50:53,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:50:53,465 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2019-09-10 04:50:53,467 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [367], [368], [369], [371], [380], [389], [391], [393], [399], [402], [407], [410], [414], [427], [429], [430], [431], [434], [450], [452], [454], [457], [461], [463], [464], [467], [483], [485], [487], [490], [494], [496], [497], [500], [516], [518], [520], [523], [527], [529], [530], [533], [549], [551], [553], [556], [560], [562], [563], [564], [565], [568], [584], [586], [588], [593], [595], [597], [598], [601], [604], [609], [612], [619], [621], [624], [628], [630], [631], [634], [636], [639], [641], [642], [645], [661], [663], [665], [668], [672], [674], [675], [678], [694], [696], [698], [701], [705], [707], [711], [712], [713], [714], [715], [716], [717], [718], [719], [720], [721], [722], [723], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735] [2019-09-10 04:50:53,515 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:50:53,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:50:53,712 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:51:08,613 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:51:08,616 INFO L272 AbstractInterpreter]: Visited 174 different actions 3211 times. Merged at 28 different actions 727 times. Widened at 1 different actions 4 times. Performed 47680 root evaluator evaluations with a maximum evaluation depth of 8. Performed 47680 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 184 fixpoints after 11 different actions. Largest state had 174 variables. [2019-09-10 04:51:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:51:08,621 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:51:09,363 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 78.14% of their original sizes. [2019-09-10 04:51:09,364 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:51:23,340 INFO L420 sIntCurrentIteration]: We unified 217 AI predicates to 217 [2019-09-10 04:51:23,341 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:51:23,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:51:23,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [111] imperfect sequences [23] total 132 [2019-09-10 04:51:23,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:51:23,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-10 04:51:23,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-10 04:51:23,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1028, Invalid=11182, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 04:51:23,348 INFO L87 Difference]: Start difference. First operand 755887 states and 1016239 transitions. Second operand 111 states. [2019-09-10 04:57:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:57:31,668 INFO L93 Difference]: Finished difference Result 836257 states and 1190582 transitions. [2019-09-10 04:57:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 489 states. [2019-09-10 04:57:31,668 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 218 [2019-09-10 04:57:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:57:35,280 INFO L225 Difference]: With dead ends: 836257 [2019-09-10 04:57:35,281 INFO L226 Difference]: Without dead ends: 836257 [2019-09-10 04:57:35,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 551 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115955 ImplicationChecksByTransitivity, 89.9s TimeCoverageRelationStatistics Valid=20782, Invalid=284474, Unknown=0, NotChecked=0, Total=305256 [2019-09-10 04:57:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836257 states. [2019-09-10 04:58:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836257 to 738120. [2019-09-10 04:58:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738120 states. [2019-09-10 04:58:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738120 states to 738120 states and 988925 transitions. [2019-09-10 04:58:16,663 INFO L78 Accepts]: Start accepts. Automaton has 738120 states and 988925 transitions. Word has length 218 [2019-09-10 04:58:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:16,664 INFO L475 AbstractCegarLoop]: Abstraction has 738120 states and 988925 transitions. [2019-09-10 04:58:16,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-10 04:58:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 738120 states and 988925 transitions. [2019-09-10 04:58:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 04:58:16,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:16,887 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, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:16,888 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1538799116, now seen corresponding path program 1 times [2019-09-10 04:58:16,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:16,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:16,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:58:17,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:58:17,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:58:17,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2019-09-10 04:58:17,685 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [367], [368], [369], [371], [380], [389], [391], [393], [399], [402], [407], [410], [414], [427], [429], [430], [431], [434], [450], [452], [454], [457], [461], [463], [464], [467], [483], [485], [487], [490], [494], [496], [497], [500], [516], [518], [520], [523], [527], [529], [530], [533], [549], [551], [553], [556], [560], [562], [563], [564], [565], [568], [584], [586], [588], [591], [595], [597], [598], [601], [617], [619], [621], [624], [628], [630], [631], [634], [636], [639], [641], [642], [645], [661], [663], [665], [668], [672], [674], [675], [678], [681], [686], [689], [696], [698], [701], [705], [707], [711], [712], [713], [714], [715], [716], [717], [718], [719], [720], [721], [722], [723], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735] [2019-09-10 04:58:17,693 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:58:17,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:58:17,722 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:58:22,821 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:58:22,822 INFO L272 AbstractInterpreter]: Visited 175 different actions 3885 times. Merged at 30 different actions 936 times. Widened at 1 different actions 4 times. Performed 57188 root evaluator evaluations with a maximum evaluation depth of 8. Performed 57188 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 258 fixpoints after 11 different actions. Largest state had 174 variables. [2019-09-10 04:58:22,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:22,822 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:58:23,271 INFO L227 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 78.11% of their original sizes. [2019-09-10 04:58:23,273 INFO L418 sIntCurrentIteration]: Unifying AI predicates