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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:35,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:35,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:35,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:35,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:35,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:35,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:35,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:35,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:35,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:35,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:35,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:35,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:35,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:35,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:35,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:35,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:35,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:35,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:35,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:35,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:35,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:35,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:35,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:35,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:35,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:35,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:35,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:35,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:35,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:35,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:35,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:35,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:35,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:35,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:35,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:35,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:35,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:35,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:35,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:35,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:35,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:28:35,530 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:35,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:35,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:35,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:35,532 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:35,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:35,532 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:35,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:35,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:35,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:35,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:35,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:35,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:35,534 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:35,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:35,534 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:35,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:35,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:35,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:35,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:35,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:35,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:35,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:35,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:35,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:35,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:35,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:35,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:35,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:28:35,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:35,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:35,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:35,857 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:35,858 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:35,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-10-15 01:28:35,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eac4ed3c/4b66b2d2c3c4489d85540cd006ba337f/FLAG3d4f742c2 [2019-10-15 01:28:36,466 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:36,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-10-15 01:28:36,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eac4ed3c/4b66b2d2c3c4489d85540cd006ba337f/FLAG3d4f742c2 [2019-10-15 01:28:36,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eac4ed3c/4b66b2d2c3c4489d85540cd006ba337f [2019-10-15 01:28:36,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:36,809 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:36,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:36,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:36,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:36,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:36" (1/1) ... [2019-10-15 01:28:36,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175279dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:36, skipping insertion in model container [2019-10-15 01:28:36,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:36" (1/1) ... [2019-10-15 01:28:36,825 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:36,871 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:37,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:37,143 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:37,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:37,315 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:37,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37 WrapperNode [2019-10-15 01:28:37,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:37,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:37,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:37,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:37,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37" (1/1) ... [2019-10-15 01:28:37,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37" (1/1) ... [2019-10-15 01:28:37,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37" (1/1) ... [2019-10-15 01:28:37,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37" (1/1) ... [2019-10-15 01:28:37,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37" (1/1) ... [2019-10-15 01:28:37,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37" (1/1) ... [2019-10-15 01:28:37,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37" (1/1) ... [2019-10-15 01:28:37,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:37,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:37,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:37,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:37,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:37,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:28:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:28:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-15 01:28:37,421 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-15 01:28:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:28:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:28:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-15 01:28:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-15 01:28:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:37,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:37,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:37,425 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:37,425 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:28:37,425 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:28:37,425 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-15 01:28:37,426 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-15 01:28:37,426 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:37,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:37,426 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:28:37,426 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:28:37,426 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-15 01:28:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-15 01:28:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:38,098 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:38,098 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-15 01:28:38,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:38 BoogieIcfgContainer [2019-10-15 01:28:38,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:38,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:38,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:38,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:38,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:36" (1/3) ... [2019-10-15 01:28:38,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c17b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:38, skipping insertion in model container [2019-10-15 01:28:38,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:37" (2/3) ... [2019-10-15 01:28:38,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c17b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:38, skipping insertion in model container [2019-10-15 01:28:38,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:38" (3/3) ... [2019-10-15 01:28:38,119 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2019-10-15 01:28:38,131 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:38,154 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:38,166 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:38,205 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:38,206 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:38,206 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:38,206 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:38,206 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:38,207 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:38,207 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:38,207 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states. [2019-10-15 01:28:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:38,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:38,247 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:38,249 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:38,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:38,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1386466573, now seen corresponding path program 1 times [2019-10-15 01:28:38,265 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:38,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968591756] [2019-10-15 01:28:38,266 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,266 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:38,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968591756] [2019-10-15 01:28:38,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:38,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:38,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822758776] [2019-10-15 01:28:38,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:38,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:38,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:38,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:38,651 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 5 states. [2019-10-15 01:28:39,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:39,425 INFO L93 Difference]: Finished difference Result 424 states and 630 transitions. [2019-10-15 01:28:39,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:39,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:39,459 INFO L225 Difference]: With dead ends: 424 [2019-10-15 01:28:39,460 INFO L226 Difference]: Without dead ends: 229 [2019-10-15 01:28:39,472 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-15 01:28:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-15 01:28:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 195. [2019-10-15 01:28:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-15 01:28:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2019-10-15 01:28:39,569 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 105 [2019-10-15 01:28:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:39,570 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2019-10-15 01:28:39,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2019-10-15 01:28:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:39,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:39,576 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:39,576 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:39,578 INFO L82 PathProgramCache]: Analyzing trace with hash 180291377, now seen corresponding path program 1 times [2019-10-15 01:28:39,578 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:39,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975447604] [2019-10-15 01:28:39,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:39,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975447604] [2019-10-15 01:28:39,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:39,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:39,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60989594] [2019-10-15 01:28:39,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:39,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:39,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:39,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:39,784 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand 5 states. [2019-10-15 01:28:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:40,339 INFO L93 Difference]: Finished difference Result 403 states and 572 transitions. [2019-10-15 01:28:40,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:40,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:40,343 INFO L225 Difference]: With dead ends: 403 [2019-10-15 01:28:40,343 INFO L226 Difference]: Without dead ends: 229 [2019-10-15 01:28:40,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-15 01:28:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-15 01:28:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 195. [2019-10-15 01:28:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-15 01:28:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 267 transitions. [2019-10-15 01:28:40,370 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 267 transitions. Word has length 105 [2019-10-15 01:28:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:40,371 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 267 transitions. [2019-10-15 01:28:40,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 267 transitions. [2019-10-15 01:28:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:40,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:40,374 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:40,374 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:40,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:40,375 INFO L82 PathProgramCache]: Analyzing trace with hash -877546701, now seen corresponding path program 1 times [2019-10-15 01:28:40,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:40,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676786668] [2019-10-15 01:28:40,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:40,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676786668] [2019-10-15 01:28:40,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:40,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:40,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507365933] [2019-10-15 01:28:40,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:40,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:40,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:40,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:40,529 INFO L87 Difference]: Start difference. First operand 195 states and 267 transitions. Second operand 5 states. [2019-10-15 01:28:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:40,994 INFO L93 Difference]: Finished difference Result 401 states and 566 transitions. [2019-10-15 01:28:40,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:40,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:40,998 INFO L225 Difference]: With dead ends: 401 [2019-10-15 01:28:40,998 INFO L226 Difference]: Without dead ends: 227 [2019-10-15 01:28:40,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-15 01:28:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-15 01:28:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2019-10-15 01:28:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-15 01:28:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 266 transitions. [2019-10-15 01:28:41,023 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 266 transitions. Word has length 105 [2019-10-15 01:28:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,023 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 266 transitions. [2019-10-15 01:28:41,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 266 transitions. [2019-10-15 01:28:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:41,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:41,027 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2020049167, now seen corresponding path program 1 times [2019-10-15 01:28:41,028 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227104590] [2019-10-15 01:28:41,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:41,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-10-15 01:28:41,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227104590] [2019-10-15 01:28:41,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:41,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:41,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575836219] [2019-10-15 01:28:41,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:41,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:41,112 INFO L87 Difference]: Start difference. First operand 195 states and 266 transitions. Second operand 5 states. [2019-10-15 01:28:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,557 INFO L93 Difference]: Finished difference Result 419 states and 594 transitions. [2019-10-15 01:28:41,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:41,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,560 INFO L225 Difference]: With dead ends: 419 [2019-10-15 01:28:41,560 INFO L226 Difference]: Without dead ends: 245 [2019-10-15 01:28:41,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-15 01:28:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-15 01:28:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 195. [2019-10-15 01:28:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-15 01:28:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2019-10-15 01:28:41,585 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 105 [2019-10-15 01:28:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,585 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2019-10-15 01:28:41,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2019-10-15 01:28:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:41,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,588 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:41,588 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1181015505, now seen corresponding path program 1 times [2019-10-15 01:28:41,589 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462000382] [2019-10-15 01:28:41,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:41,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462000382] [2019-10-15 01:28:41,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:41,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:41,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455553497] [2019-10-15 01:28:41,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:41,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:41,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:41,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:41,694 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand 5 states. [2019-10-15 01:28:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:42,096 INFO L93 Difference]: Finished difference Result 413 states and 583 transitions. [2019-10-15 01:28:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:42,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:42,100 INFO L225 Difference]: With dead ends: 413 [2019-10-15 01:28:42,100 INFO L226 Difference]: Without dead ends: 239 [2019-10-15 01:28:42,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-15 01:28:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-15 01:28:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2019-10-15 01:28:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-15 01:28:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2019-10-15 01:28:42,122 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 105 [2019-10-15 01:28:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:42,123 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2019-10-15 01:28:42,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2019-10-15 01:28:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:42,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:42,125 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:42,126 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:42,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1153949903, now seen corresponding path program 1 times [2019-10-15 01:28:42,126 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:42,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767808620] [2019-10-15 01:28:42,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:42,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767808620] [2019-10-15 01:28:42,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:42,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:42,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20203846] [2019-10-15 01:28:42,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:42,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:42,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:42,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:42,238 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand 5 states. [2019-10-15 01:28:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:42,833 INFO L93 Difference]: Finished difference Result 415 states and 582 transitions. [2019-10-15 01:28:42,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:42,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:42,836 INFO L225 Difference]: With dead ends: 415 [2019-10-15 01:28:42,836 INFO L226 Difference]: Without dead ends: 241 [2019-10-15 01:28:42,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-15 01:28:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-15 01:28:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 195. [2019-10-15 01:28:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-15 01:28:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 263 transitions. [2019-10-15 01:28:42,857 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 263 transitions. Word has length 105 [2019-10-15 01:28:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:42,857 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 263 transitions. [2019-10-15 01:28:42,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 263 transitions. [2019-10-15 01:28:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:42,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:42,859 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:42,859 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:42,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1063680495, now seen corresponding path program 1 times [2019-10-15 01:28:42,860 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:42,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714732132] [2019-10-15 01:28:42,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:42,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714732132] [2019-10-15 01:28:42,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:42,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:42,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355318725] [2019-10-15 01:28:42,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:42,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:42,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:42,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:42,923 INFO L87 Difference]: Start difference. First operand 195 states and 263 transitions. Second operand 5 states. [2019-10-15 01:28:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,338 INFO L93 Difference]: Finished difference Result 413 states and 576 transitions. [2019-10-15 01:28:43,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:43,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,341 INFO L225 Difference]: With dead ends: 413 [2019-10-15 01:28:43,341 INFO L226 Difference]: Without dead ends: 239 [2019-10-15 01:28:43,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10-15 01:28:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-15 01:28:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2019-10-15 01:28:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-15 01:28:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 262 transitions. [2019-10-15 01:28:43,364 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 262 transitions. Word has length 105 [2019-10-15 01:28:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,364 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 262 transitions. [2019-10-15 01:28:43,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 262 transitions. [2019-10-15 01:28:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:43,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:43,367 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1497182351, now seen corresponding path program 1 times [2019-10-15 01:28:43,368 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778318902] [2019-10-15 01:28:43,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:43,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778318902] [2019-10-15 01:28:43,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:43,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:43,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493720883] [2019-10-15 01:28:43,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:43,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:43,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:43,465 INFO L87 Difference]: Start difference. First operand 195 states and 262 transitions. Second operand 6 states. [2019-10-15 01:28:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,510 INFO L93 Difference]: Finished difference Result 384 states and 534 transitions. [2019-10-15 01:28:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:43,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-15 01:28:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,513 INFO L225 Difference]: With dead ends: 384 [2019-10-15 01:28:43,513 INFO L226 Difference]: Without dead ends: 211 [2019-10-15 01:28:43,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-15 01:28:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 200. [2019-10-15 01:28:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-15 01:28:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 267 transitions. [2019-10-15 01:28:43,535 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 267 transitions. Word has length 105 [2019-10-15 01:28:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,536 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 267 transitions. [2019-10-15 01:28:43,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 267 transitions. [2019-10-15 01:28:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:43,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:43,538 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,539 INFO L82 PathProgramCache]: Analyzing trace with hash -817910097, now seen corresponding path program 1 times [2019-10-15 01:28:43,539 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620929964] [2019-10-15 01:28:43,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:43,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620929964] [2019-10-15 01:28:43,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:43,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:43,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413554281] [2019-10-15 01:28:43,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:43,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:43,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:43,605 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand 6 states. [2019-10-15 01:28:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,652 INFO L93 Difference]: Finished difference Result 391 states and 539 transitions. [2019-10-15 01:28:43,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:43,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-15 01:28:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,655 INFO L225 Difference]: With dead ends: 391 [2019-10-15 01:28:43,655 INFO L226 Difference]: Without dead ends: 213 [2019-10-15 01:28:43,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-15 01:28:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-10-15 01:28:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-15 01:28:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 272 transitions. [2019-10-15 01:28:43,672 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 272 transitions. Word has length 105 [2019-10-15 01:28:43,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,673 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 272 transitions. [2019-10-15 01:28:43,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 272 transitions. [2019-10-15 01:28:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:43,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,675 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:43,675 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,675 INFO L82 PathProgramCache]: Analyzing trace with hash -374009423, now seen corresponding path program 1 times [2019-10-15 01:28:43,675 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086492392] [2019-10-15 01:28:43,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:43,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086492392] [2019-10-15 01:28:43,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:43,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:43,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707151716] [2019-10-15 01:28:43,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:43,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:43,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:43,734 INFO L87 Difference]: Start difference. First operand 205 states and 272 transitions. Second operand 6 states. [2019-10-15 01:28:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,776 INFO L93 Difference]: Finished difference Result 398 states and 544 transitions. [2019-10-15 01:28:43,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:43,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-15 01:28:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,778 INFO L225 Difference]: With dead ends: 398 [2019-10-15 01:28:43,778 INFO L226 Difference]: Without dead ends: 215 [2019-10-15 01:28:43,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-15 01:28:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-10-15 01:28:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-15 01:28:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 277 transitions. [2019-10-15 01:28:43,797 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 277 transitions. Word has length 105 [2019-10-15 01:28:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,797 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 277 transitions. [2019-10-15 01:28:43,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 277 transitions. [2019-10-15 01:28:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:43,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,799 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:43,799 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1871570031, now seen corresponding path program 1 times [2019-10-15 01:28:43,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43293500] [2019-10-15 01:28:43,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:43,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43293500] [2019-10-15 01:28:43,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:43,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:43,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714513747] [2019-10-15 01:28:43,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:43,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:43,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:43,858 INFO L87 Difference]: Start difference. First operand 210 states and 277 transitions. Second operand 6 states. [2019-10-15 01:28:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,899 INFO L93 Difference]: Finished difference Result 405 states and 549 transitions. [2019-10-15 01:28:43,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:43,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-15 01:28:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,902 INFO L225 Difference]: With dead ends: 405 [2019-10-15 01:28:43,902 INFO L226 Difference]: Without dead ends: 217 [2019-10-15 01:28:43,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-15 01:28:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-10-15 01:28:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-15 01:28:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 282 transitions. [2019-10-15 01:28:43,920 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 282 transitions. Word has length 105 [2019-10-15 01:28:43,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,921 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 282 transitions. [2019-10-15 01:28:43,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2019-10-15 01:28:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:43,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,923 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:43,923 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1027564529, now seen corresponding path program 1 times [2019-10-15 01:28:43,924 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716950865] [2019-10-15 01:28:43,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:44,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716950865] [2019-10-15 01:28:44,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:44,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:44,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469645198] [2019-10-15 01:28:44,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:44,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:44,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:44,024 INFO L87 Difference]: Start difference. First operand 215 states and 282 transitions. Second operand 5 states. [2019-10-15 01:28:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:44,590 INFO L93 Difference]: Finished difference Result 495 states and 651 transitions. [2019-10-15 01:28:44,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:44,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:44,593 INFO L225 Difference]: With dead ends: 495 [2019-10-15 01:28:44,593 INFO L226 Difference]: Without dead ends: 303 [2019-10-15 01:28:44,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-10-15 01:28:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 278. [2019-10-15 01:28:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-15 01:28:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 355 transitions. [2019-10-15 01:28:44,616 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 355 transitions. Word has length 105 [2019-10-15 01:28:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:44,616 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 355 transitions. [2019-10-15 01:28:44,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 355 transitions. [2019-10-15 01:28:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:44,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:44,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:44,618 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:44,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:44,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1729164403, now seen corresponding path program 1 times [2019-10-15 01:28:44,619 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:44,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905090304] [2019-10-15 01:28:44,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:44,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905090304] [2019-10-15 01:28:44,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:44,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:44,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218770429] [2019-10-15 01:28:44,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:44,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:44,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:44,684 INFO L87 Difference]: Start difference. First operand 278 states and 355 transitions. Second operand 5 states. [2019-10-15 01:28:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,117 INFO L93 Difference]: Finished difference Result 533 states and 682 transitions. [2019-10-15 01:28:45,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:45,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,120 INFO L225 Difference]: With dead ends: 533 [2019-10-15 01:28:45,120 INFO L226 Difference]: Without dead ends: 278 [2019-10-15 01:28:45,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-15 01:28:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-15 01:28:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-15 01:28:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-15 01:28:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 353 transitions. [2019-10-15 01:28:45,147 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 353 transitions. Word has length 105 [2019-10-15 01:28:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,147 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 353 transitions. [2019-10-15 01:28:45,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 353 transitions. [2019-10-15 01:28:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:45,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,149 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:45,150 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1751796657, now seen corresponding path program 1 times [2019-10-15 01:28:45,150 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587475223] [2019-10-15 01:28:45,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:45,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587475223] [2019-10-15 01:28:45,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:45,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128512254] [2019-10-15 01:28:45,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:45,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:45,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:45,276 INFO L87 Difference]: Start difference. First operand 278 states and 353 transitions. Second operand 5 states. [2019-10-15 01:28:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,725 INFO L93 Difference]: Finished difference Result 533 states and 678 transitions. [2019-10-15 01:28:45,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:45,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,730 INFO L225 Difference]: With dead ends: 533 [2019-10-15 01:28:45,730 INFO L226 Difference]: Without dead ends: 278 [2019-10-15 01:28:45,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-15 01:28:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-15 01:28:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-15 01:28:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 351 transitions. [2019-10-15 01:28:45,767 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 351 transitions. Word has length 105 [2019-10-15 01:28:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,769 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 351 transitions. [2019-10-15 01:28:45,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 351 transitions. [2019-10-15 01:28:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:45,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,772 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:45,772 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1156967245, now seen corresponding path program 1 times [2019-10-15 01:28:45,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331919526] [2019-10-15 01:28:45,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:45,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331919526] [2019-10-15 01:28:45,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:45,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918191531] [2019-10-15 01:28:45,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:45,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:45,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:45,862 INFO L87 Difference]: Start difference. First operand 278 states and 351 transitions. Second operand 5 states. [2019-10-15 01:28:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,367 INFO L93 Difference]: Finished difference Result 634 states and 811 transitions. [2019-10-15 01:28:46,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:46,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,372 INFO L225 Difference]: With dead ends: 634 [2019-10-15 01:28:46,372 INFO L226 Difference]: Without dead ends: 379 [2019-10-15 01:28:46,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:46,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-10-15 01:28:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 361. [2019-10-15 01:28:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-15 01:28:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 454 transitions. [2019-10-15 01:28:46,418 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 454 transitions. Word has length 105 [2019-10-15 01:28:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,419 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 454 transitions. [2019-10-15 01:28:46,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 454 transitions. [2019-10-15 01:28:46,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:46,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,422 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:46,422 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1666440335, now seen corresponding path program 1 times [2019-10-15 01:28:46,423 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582589184] [2019-10-15 01:28:46,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:46,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582589184] [2019-10-15 01:28:46,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:46,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719200489] [2019-10-15 01:28:46,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:46,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:46,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:46,525 INFO L87 Difference]: Start difference. First operand 361 states and 454 transitions. Second operand 5 states. [2019-10-15 01:28:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,120 INFO L93 Difference]: Finished difference Result 842 states and 1104 transitions. [2019-10-15 01:28:47,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:47,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,124 INFO L225 Difference]: With dead ends: 842 [2019-10-15 01:28:47,125 INFO L226 Difference]: Without dead ends: 504 [2019-10-15 01:28:47,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-10-15 01:28:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 412. [2019-10-15 01:28:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-10-15 01:28:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 510 transitions. [2019-10-15 01:28:47,166 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 510 transitions. Word has length 105 [2019-10-15 01:28:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,167 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 510 transitions. [2019-10-15 01:28:47,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 510 transitions. [2019-10-15 01:28:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:47,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,169 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:47,169 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,170 INFO L82 PathProgramCache]: Analyzing trace with hash 256787699, now seen corresponding path program 1 times [2019-10-15 01:28:47,170 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465735412] [2019-10-15 01:28:47,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:47,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465735412] [2019-10-15 01:28:47,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:47,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:47,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942034068] [2019-10-15 01:28:47,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:47,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:47,230 INFO L87 Difference]: Start difference. First operand 412 states and 510 transitions. Second operand 5 states. [2019-10-15 01:28:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,966 INFO L93 Difference]: Finished difference Result 915 states and 1184 transitions. [2019-10-15 01:28:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:47,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,971 INFO L225 Difference]: With dead ends: 915 [2019-10-15 01:28:47,971 INFO L226 Difference]: Without dead ends: 526 [2019-10-15 01:28:47,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-10-15 01:28:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 453. [2019-10-15 01:28:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-10-15 01:28:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 552 transitions. [2019-10-15 01:28:48,026 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 552 transitions. Word has length 105 [2019-10-15 01:28:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:48,027 INFO L462 AbstractCegarLoop]: Abstraction has 453 states and 552 transitions. [2019-10-15 01:28:48,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 552 transitions. [2019-10-15 01:28:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:48,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:48,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:48,032 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash 318827313, now seen corresponding path program 1 times [2019-10-15 01:28:48,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:48,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767863779] [2019-10-15 01:28:48,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:48,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767863779] [2019-10-15 01:28:48,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:48,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:48,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742556964] [2019-10-15 01:28:48,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:48,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:48,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:48,155 INFO L87 Difference]: Start difference. First operand 453 states and 552 transitions. Second operand 5 states. [2019-10-15 01:28:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,787 INFO L93 Difference]: Finished difference Result 961 states and 1228 transitions. [2019-10-15 01:28:48,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:48,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:48,791 INFO L225 Difference]: With dead ends: 961 [2019-10-15 01:28:48,792 INFO L226 Difference]: Without dead ends: 531 [2019-10-15 01:28:48,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-15 01:28:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 484. [2019-10-15 01:28:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-15 01:28:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 580 transitions. [2019-10-15 01:28:48,832 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 580 transitions. Word has length 105 [2019-10-15 01:28:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:48,832 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 580 transitions. [2019-10-15 01:28:48,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 580 transitions. [2019-10-15 01:28:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:48,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:48,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:48,834 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:48,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash 184813807, now seen corresponding path program 1 times [2019-10-15 01:28:48,835 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:48,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114644609] [2019-10-15 01:28:48,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:48,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114644609] [2019-10-15 01:28:48,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:48,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:48,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066637246] [2019-10-15 01:28:48,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:48,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:48,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:48,899 INFO L87 Difference]: Start difference. First operand 484 states and 580 transitions. Second operand 3 states. [2019-10-15 01:28:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,983 INFO L93 Difference]: Finished difference Result 1381 states and 1703 transitions. [2019-10-15 01:28:48,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:48,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-15 01:28:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:48,990 INFO L225 Difference]: With dead ends: 1381 [2019-10-15 01:28:48,991 INFO L226 Difference]: Without dead ends: 920 [2019-10-15 01:28:48,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-15 01:28:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-10-15 01:28:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 919. [2019-10-15 01:28:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-10-15 01:28:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1114 transitions. [2019-10-15 01:28:49,099 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1114 transitions. Word has length 105 [2019-10-15 01:28:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,100 INFO L462 AbstractCegarLoop]: Abstraction has 919 states and 1114 transitions. [2019-10-15 01:28:49,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1114 transitions. [2019-10-15 01:28:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-15 01:28:49,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,106 INFO L380 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, 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] [2019-10-15 01:28:49,106 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1241286252, now seen corresponding path program 1 times [2019-10-15 01:28:49,107 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495735058] [2019-10-15 01:28:49,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-15 01:28:49,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495735058] [2019-10-15 01:28:49,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367883405] [2019-10-15 01:28:49,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:49,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:49,496 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-15 01:28:49,687 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:49,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [4] total 6 [2019-10-15 01:28:49,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035319420] [2019-10-15 01:28:49,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:49,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:49,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:49,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:49,690 INFO L87 Difference]: Start difference. First operand 919 states and 1114 transitions. Second operand 4 states. [2019-10-15 01:28:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:49,865 INFO L93 Difference]: Finished difference Result 1813 states and 2197 transitions. [2019-10-15 01:28:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:49,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-10-15 01:28:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,871 INFO L225 Difference]: With dead ends: 1813 [2019-10-15 01:28:49,872 INFO L226 Difference]: Without dead ends: 919 [2019-10-15 01:28:49,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-10-15 01:28:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919. [2019-10-15 01:28:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-10-15 01:28:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1104 transitions. [2019-10-15 01:28:49,948 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1104 transitions. Word has length 170 [2019-10-15 01:28:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,949 INFO L462 AbstractCegarLoop]: Abstraction has 919 states and 1104 transitions. [2019-10-15 01:28:49,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1104 transitions. [2019-10-15 01:28:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-15 01:28:49,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,953 INFO L380 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, 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] [2019-10-15 01:28:50,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:50,160 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2103787486, now seen corresponding path program 1 times [2019-10-15 01:28:50,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:50,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206069668] [2019-10-15 01:28:50,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 01:28:50,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206069668] [2019-10-15 01:28:50,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:50,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:50,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688972530] [2019-10-15 01:28:50,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:50,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:50,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:50,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:50,277 INFO L87 Difference]: Start difference. First operand 919 states and 1104 transitions. Second operand 4 states. [2019-10-15 01:28:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:50,599 INFO L93 Difference]: Finished difference Result 2585 states and 3128 transitions. [2019-10-15 01:28:50,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:50,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-10-15 01:28:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:50,608 INFO L225 Difference]: With dead ends: 2585 [2019-10-15 01:28:50,608 INFO L226 Difference]: Without dead ends: 1302 [2019-10-15 01:28:50,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-10-15 01:28:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2019-10-15 01:28:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2019-10-15 01:28:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1556 transitions. [2019-10-15 01:28:50,714 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1556 transitions. Word has length 169 [2019-10-15 01:28:50,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:50,715 INFO L462 AbstractCegarLoop]: Abstraction has 1302 states and 1556 transitions. [2019-10-15 01:28:50,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1556 transitions. [2019-10-15 01:28:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-15 01:28:50,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:50,720 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:50,721 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:50,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:50,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1557384399, now seen corresponding path program 1 times [2019-10-15 01:28:50,721 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:50,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931709620] [2019-10-15 01:28:50,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-15 01:28:50,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931709620] [2019-10-15 01:28:50,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994737727] [2019-10-15 01:28:50,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:51,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 01:28:51,187 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-15 01:28:51,418 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:51,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-10-15 01:28:51,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004348735] [2019-10-15 01:28:51,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:51,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:51,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:51,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:51,423 INFO L87 Difference]: Start difference. First operand 1302 states and 1556 transitions. Second operand 4 states. [2019-10-15 01:28:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:51,753 INFO L93 Difference]: Finished difference Result 3261 states and 4012 transitions. [2019-10-15 01:28:51,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:51,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-10-15 01:28:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:51,768 INFO L225 Difference]: With dead ends: 3261 [2019-10-15 01:28:51,768 INFO L226 Difference]: Without dead ends: 1982 [2019-10-15 01:28:51,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-10-15 01:28:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1978. [2019-10-15 01:28:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-10-15 01:28:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2313 transitions. [2019-10-15 01:28:51,929 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2313 transitions. Word has length 222 [2019-10-15 01:28:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:51,930 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 2313 transitions. [2019-10-15 01:28:51,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2313 transitions. [2019-10-15 01:28:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-15 01:28:51,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:51,936 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:52,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:52,142 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1473110279, now seen corresponding path program 1 times [2019-10-15 01:28:52,144 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189748547] [2019-10-15 01:28:52,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-15 01:28:52,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189748547] [2019-10-15 01:28:52,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732912738] [2019-10-15 01:28:52,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:52,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-15 01:28:52,505 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-15 01:28:52,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:52,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-10-15 01:28:52,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017380555] [2019-10-15 01:28:52,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:52,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:52,848 INFO L87 Difference]: Start difference. First operand 1978 states and 2313 transitions. Second operand 3 states. [2019-10-15 01:28:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:52,967 INFO L93 Difference]: Finished difference Result 3922 states and 4601 transitions. [2019-10-15 01:28:52,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:52,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-10-15 01:28:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:52,977 INFO L225 Difference]: With dead ends: 3922 [2019-10-15 01:28:52,978 INFO L226 Difference]: Without dead ends: 1969 [2019-10-15 01:28:52,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 489 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-10-15 01:28:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-15 01:28:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2019-10-15 01:28:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-10-15 01:28:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2289 transitions. [2019-10-15 01:28:53,221 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2289 transitions. Word has length 244 [2019-10-15 01:28:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:53,221 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2289 transitions. [2019-10-15 01:28:53,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2289 transitions. [2019-10-15 01:28:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-15 01:28:53,228 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:53,228 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:53,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:53,442 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash 685665299, now seen corresponding path program 1 times [2019-10-15 01:28:53,442 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:53,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060162453] [2019-10-15 01:28:53,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-15 01:28:53,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060162453] [2019-10-15 01:28:53,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939962844] [2019-10-15 01:28:53,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:53,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 01:28:53,841 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-15 01:28:54,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:54,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 7 [2019-10-15 01:28:54,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047517847] [2019-10-15 01:28:54,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:54,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:54,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:54,101 INFO L87 Difference]: Start difference. First operand 1969 states and 2289 transitions. Second operand 3 states. [2019-10-15 01:28:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,521 INFO L93 Difference]: Finished difference Result 5673 states and 6650 transitions. [2019-10-15 01:28:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:54,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-10-15 01:28:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,540 INFO L225 Difference]: With dead ends: 5673 [2019-10-15 01:28:54,540 INFO L226 Difference]: Without dead ends: 3039 [2019-10-15 01:28:54,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2019-10-15 01:28:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 3036. [2019-10-15 01:28:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3036 states. [2019-10-15 01:28:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 3565 transitions. [2019-10-15 01:28:54,844 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 3565 transitions. Word has length 244 [2019-10-15 01:28:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:54,844 INFO L462 AbstractCegarLoop]: Abstraction has 3036 states and 3565 transitions. [2019-10-15 01:28:54,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 3565 transitions. [2019-10-15 01:28:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-15 01:28:54,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:54,853 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:55,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:55,058 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,059 INFO L82 PathProgramCache]: Analyzing trace with hash -755898766, now seen corresponding path program 1 times [2019-10-15 01:28:55,059 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417995256] [2019-10-15 01:28:55,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-10-15 01:28:55,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417995256] [2019-10-15 01:28:55,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040720631] [2019-10-15 01:28:55,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:55,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-15 01:28:55,520 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-15 01:28:55,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:55,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 5 [2019-10-15 01:28:55,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6109826] [2019-10-15 01:28:55,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:55,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:55,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:55,792 INFO L87 Difference]: Start difference. First operand 3036 states and 3565 transitions. Second operand 3 states. [2019-10-15 01:28:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:56,315 INFO L93 Difference]: Finished difference Result 8961 states and 10734 transitions. [2019-10-15 01:28:56,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:56,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-15 01:28:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:56,349 INFO L225 Difference]: With dead ends: 8961 [2019-10-15 01:28:56,350 INFO L226 Difference]: Without dead ends: 5950 [2019-10-15 01:28:56,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2019-10-15 01:28:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 5941. [2019-10-15 01:28:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5941 states. [2019-10-15 01:28:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5941 states to 5941 states and 7070 transitions. [2019-10-15 01:28:56,936 INFO L78 Accepts]: Start accepts. Automaton has 5941 states and 7070 transitions. Word has length 298 [2019-10-15 01:28:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:56,937 INFO L462 AbstractCegarLoop]: Abstraction has 5941 states and 7070 transitions. [2019-10-15 01:28:56,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5941 states and 7070 transitions. [2019-10-15 01:28:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-10-15 01:28:56,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:56,955 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:57,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,160 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash -442297697, now seen corresponding path program 1 times [2019-10-15 01:28:57,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815196616] [2019-10-15 01:28:57,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 51 proven. 32 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-10-15 01:28:57,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815196616] [2019-10-15 01:28:57,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704118381] [2019-10-15 01:28:57,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:57,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-15 01:28:57,601 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 51 proven. 32 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-10-15 01:28:57,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:57,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-10-15 01:28:57,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728369335] [2019-10-15 01:28:57,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:57,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:57,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:57,994 INFO L87 Difference]: Start difference. First operand 5941 states and 7070 transitions. Second operand 3 states. [2019-10-15 01:28:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,788 INFO L93 Difference]: Finished difference Result 17517 states and 22115 transitions. [2019-10-15 01:28:58,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:58,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-10-15 01:28:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,850 INFO L225 Difference]: With dead ends: 17517 [2019-10-15 01:28:58,850 INFO L226 Difference]: Without dead ends: 11610 [2019-10-15 01:28:58,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11610 states. [2019-10-15 01:28:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11610 to 11585. [2019-10-15 01:28:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11585 states. [2019-10-15 01:28:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11585 states to 11585 states and 14200 transitions. [2019-10-15 01:28:59,966 INFO L78 Accepts]: Start accepts. Automaton has 11585 states and 14200 transitions. Word has length 320 [2019-10-15 01:28:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,966 INFO L462 AbstractCegarLoop]: Abstraction has 11585 states and 14200 transitions. [2019-10-15 01:28:59,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 11585 states and 14200 transitions. [2019-10-15 01:29:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-10-15 01:29:00,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:00,008 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:29:00,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:00,214 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:00,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash -413293325, now seen corresponding path program 1 times [2019-10-15 01:29:00,215 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:00,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572140059] [2019-10-15 01:29:00,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-10-15 01:29:00,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572140059] [2019-10-15 01:29:00,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:00,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:00,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972449438] [2019-10-15 01:29:00,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:00,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:00,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:00,561 INFO L87 Difference]: Start difference. First operand 11585 states and 14200 transitions. Second operand 4 states. [2019-10-15 01:29:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,378 INFO L93 Difference]: Finished difference Result 20295 states and 24677 transitions. [2019-10-15 01:29:01,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:01,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2019-10-15 01:29:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,426 INFO L225 Difference]: With dead ends: 20295 [2019-10-15 01:29:01,426 INFO L226 Difference]: Without dead ends: 8737 [2019-10-15 01:29:01,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2019-10-15 01:29:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8737. [2019-10-15 01:29:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8737 states. [2019-10-15 01:29:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8737 states to 8737 states and 10518 transitions. [2019-10-15 01:29:02,927 INFO L78 Accepts]: Start accepts. Automaton has 8737 states and 10518 transitions. Word has length 409 [2019-10-15 01:29:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:02,928 INFO L462 AbstractCegarLoop]: Abstraction has 8737 states and 10518 transitions. [2019-10-15 01:29:02,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 8737 states and 10518 transitions. [2019-10-15 01:29:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-10-15 01:29:02,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:02,957 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:29:02,957 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:02,957 INFO L82 PathProgramCache]: Analyzing trace with hash -984890599, now seen corresponding path program 1 times [2019-10-15 01:29:02,958 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:02,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967843850] [2019-10-15 01:29:02,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 31 proven. 26 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2019-10-15 01:29:03,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967843850] [2019-10-15 01:29:03,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55210368] [2019-10-15 01:29:03,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:03,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-15 01:29:03,519 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 55 proven. 13 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-15 01:29:03,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:03,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 10 [2019-10-15 01:29:03,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247988965] [2019-10-15 01:29:03,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:03,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:29:03,899 INFO L87 Difference]: Start difference. First operand 8737 states and 10518 transitions. Second operand 3 states. [2019-10-15 01:29:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:04,748 INFO L93 Difference]: Finished difference Result 20560 states and 26162 transitions. [2019-10-15 01:29:04,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:04,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 410 [2019-10-15 01:29:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:04,796 INFO L225 Difference]: With dead ends: 20560 [2019-10-15 01:29:04,796 INFO L226 Difference]: Without dead ends: 11850 [2019-10-15 01:29:04,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 822 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:29:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2019-10-15 01:29:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11826. [2019-10-15 01:29:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11826 states. [2019-10-15 01:29:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11826 states to 11826 states and 14252 transitions. [2019-10-15 01:29:05,745 INFO L78 Accepts]: Start accepts. Automaton has 11826 states and 14252 transitions. Word has length 410 [2019-10-15 01:29:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:05,746 INFO L462 AbstractCegarLoop]: Abstraction has 11826 states and 14252 transitions. [2019-10-15 01:29:05,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 11826 states and 14252 transitions. [2019-10-15 01:29:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-15 01:29:05,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:05,793 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:29:05,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:05,999 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1348016368, now seen corresponding path program 1 times [2019-10-15 01:29:06,001 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:06,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744691982] [2019-10-15 01:29:06,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-10-15 01:29:06,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744691982] [2019-10-15 01:29:06,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155821816] [2019-10-15 01:29:06,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:06,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-15 01:29:06,544 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-15 01:29:06,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:06,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2019-10-15 01:29:06,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573844063] [2019-10-15 01:29:06,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:06,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:06,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:06,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:06,829 INFO L87 Difference]: Start difference. First operand 11826 states and 14252 transitions. Second operand 3 states.