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/transmitter.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:47,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:47,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:47,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:47,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:47,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:47,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:47,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:47,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:47,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:47,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:47,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:47,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:47,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:47,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:47,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:47,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:47,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:47,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:47,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:47,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:47,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:47,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:47,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:47,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:47,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:47,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:47,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:47,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:47,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:47,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:47,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:47,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:47,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:47,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:47,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:47,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:47,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:47,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:47,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:47,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:47,373 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:47,387 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:47,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:47,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:47,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:47,389 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:47,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:47,389 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:47,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:47,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:47,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:47,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:47,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:47,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:47,391 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:47,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:47,391 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:47,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:47,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:47,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:47,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:47,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:47,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:47,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:47,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:47,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:47,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:47,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:47,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:47,394 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:47,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:47,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:47,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:47,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:47,703 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:47,704 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-10-15 01:28:47,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd481186b/d0f24961789b4b7ab29488875d9ccd14/FLAGb59785c7b [2019-10-15 01:28:48,350 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:48,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-10-15 01:28:48,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd481186b/d0f24961789b4b7ab29488875d9ccd14/FLAGb59785c7b [2019-10-15 01:28:48,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd481186b/d0f24961789b4b7ab29488875d9ccd14 [2019-10-15 01:28:48,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:48,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:48,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:48,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:48,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:48,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:48" (1/1) ... [2019-10-15 01:28:48,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6688ee2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:48, skipping insertion in model container [2019-10-15 01:28:48,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:48" (1/1) ... [2019-10-15 01:28:48,642 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:48,683 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:48,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:48,942 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:49,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:49,101 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:49,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:49 WrapperNode [2019-10-15 01:28:49,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:49,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:49,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:49,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:49,113 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:49" (1/1) ... [2019-10-15 01:28:49,114 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:49" (1/1) ... [2019-10-15 01:28:49,122 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:49" (1/1) ... [2019-10-15 01:28:49,122 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:49" (1/1) ... [2019-10-15 01:28:49,133 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:49" (1/1) ... [2019-10-15 01:28:49,147 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:49" (1/1) ... [2019-10-15 01:28:49,150 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:49" (1/1) ... [2019-10-15 01:28:49,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:49,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:49,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:49,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:49,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:49" (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:49,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:49,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:49,204 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:49,204 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:28:49,204 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:28:49,204 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-15 01:28:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-15 01:28:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:28:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:28:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-15 01:28:49,205 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-15 01:28:49,206 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:49,206 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:49,206 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:49,206 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:49,206 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:49,208 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:49,208 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:49,208 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:49,208 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:49,209 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:49,209 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:49,209 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:49,209 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:49,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:49,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:28:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:28:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-15 01:28:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-15 01:28:49,210 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:28:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:28:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-15 01:28:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-15 01:28:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:49,883 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:49,884 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-15 01:28:49,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:49 BoogieIcfgContainer [2019-10-15 01:28:49,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:49,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:49,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:49,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:49,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:48" (1/3) ... [2019-10-15 01:28:49,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b20cfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:49, skipping insertion in model container [2019-10-15 01:28:49,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:49" (2/3) ... [2019-10-15 01:28:49,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b20cfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:49, skipping insertion in model container [2019-10-15 01:28:49,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:49" (3/3) ... [2019-10-15 01:28:49,895 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2019-10-15 01:28:49,905 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:49,913 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:49,922 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:49,951 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:49,952 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:49,952 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:49,952 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:49,953 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:49,953 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:49,953 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:49,953 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-10-15 01:28:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:49,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,995 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:49,997 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:50,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1961190691, now seen corresponding path program 1 times [2019-10-15 01:28:50,010 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:50,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661551224] [2019-10-15 01:28:50,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,388 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:50,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661551224] [2019-10-15 01:28:50,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:50,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:50,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137459423] [2019-10-15 01:28:50,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:50,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:50,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:50,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:50,423 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 5 states. [2019-10-15 01:28:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:51,175 INFO L93 Difference]: Finished difference Result 412 states and 610 transitions. [2019-10-15 01:28:51,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:51,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:51,197 INFO L225 Difference]: With dead ends: 412 [2019-10-15 01:28:51,198 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 01:28:51,204 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:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 01:28:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2019-10-15 01:28:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-15 01:28:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2019-10-15 01:28:51,279 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 105 [2019-10-15 01:28:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:51,280 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2019-10-15 01:28:51,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2019-10-15 01:28:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:51,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:51,289 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:51,289 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:51,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:51,290 INFO L82 PathProgramCache]: Analyzing trace with hash -767018655, now seen corresponding path program 1 times [2019-10-15 01:28:51,290 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:51,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38581980] [2019-10-15 01:28:51,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,501 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:51,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38581980] [2019-10-15 01:28:51,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:51,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:51,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578369813] [2019-10-15 01:28:51,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:51,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:51,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:51,513 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand 5 states. [2019-10-15 01:28:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:52,059 INFO L93 Difference]: Finished difference Result 391 states and 548 transitions. [2019-10-15 01:28:52,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:52,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:52,063 INFO L225 Difference]: With dead ends: 391 [2019-10-15 01:28:52,063 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 01:28:52,065 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:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 01:28:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2019-10-15 01:28:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-15 01:28:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 257 transitions. [2019-10-15 01:28:52,091 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 257 transitions. Word has length 105 [2019-10-15 01:28:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:52,092 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 257 transitions. [2019-10-15 01:28:52,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 257 transitions. [2019-10-15 01:28:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:52,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,095 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:52,096 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1824856733, now seen corresponding path program 1 times [2019-10-15 01:28:52,096 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896865124] [2019-10-15 01:28:52,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:52,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896865124] [2019-10-15 01:28:52,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:52,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:52,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358283060] [2019-10-15 01:28:52,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:52,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:52,208 INFO L87 Difference]: Start difference. First operand 190 states and 257 transitions. Second operand 5 states. [2019-10-15 01:28:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:52,696 INFO L93 Difference]: Finished difference Result 389 states and 542 transitions. [2019-10-15 01:28:52,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:52,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:52,700 INFO L225 Difference]: With dead ends: 389 [2019-10-15 01:28:52,700 INFO L226 Difference]: Without dead ends: 220 [2019-10-15 01:28:52,701 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:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-15 01:28:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 190. [2019-10-15 01:28:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-15 01:28:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 256 transitions. [2019-10-15 01:28:52,724 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 256 transitions. Word has length 105 [2019-10-15 01:28:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:52,724 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 256 transitions. [2019-10-15 01:28:52,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 256 transitions. [2019-10-15 01:28:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:52,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,727 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:52,727 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1327608097, now seen corresponding path program 1 times [2019-10-15 01:28:52,728 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303617422] [2019-10-15 01:28:52,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,845 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:52,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303617422] [2019-10-15 01:28:52,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:52,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:52,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141148993] [2019-10-15 01:28:52,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:52,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:52,848 INFO L87 Difference]: Start difference. First operand 190 states and 256 transitions. Second operand 5 states. [2019-10-15 01:28:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:53,332 INFO L93 Difference]: Finished difference Result 387 states and 536 transitions. [2019-10-15 01:28:53,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:53,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:53,334 INFO L225 Difference]: With dead ends: 387 [2019-10-15 01:28:53,335 INFO L226 Difference]: Without dead ends: 218 [2019-10-15 01:28:53,336 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:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-15 01:28:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2019-10-15 01:28:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-15 01:28:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2019-10-15 01:28:53,359 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 105 [2019-10-15 01:28:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:53,359 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2019-10-15 01:28:53,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2019-10-15 01:28:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:53,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:53,362 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:53,362 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1567847843, now seen corresponding path program 1 times [2019-10-15 01:28:53,363 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:53,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267374657] [2019-10-15 01:28:53,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,471 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:53,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267374657] [2019-10-15 01:28:53,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:53,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:53,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771995085] [2019-10-15 01:28:53,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:53,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:53,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:53,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:53,475 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand 5 states. [2019-10-15 01:28:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:53,873 INFO L93 Difference]: Finished difference Result 407 states and 568 transitions. [2019-10-15 01:28:53,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:53,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:53,877 INFO L225 Difference]: With dead ends: 407 [2019-10-15 01:28:53,877 INFO L226 Difference]: Without dead ends: 238 [2019-10-15 01:28:53,878 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:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-15 01:28:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 190. [2019-10-15 01:28:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-15 01:28:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2019-10-15 01:28:53,900 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 105 [2019-10-15 01:28:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:53,900 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2019-10-15 01:28:53,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2019-10-15 01:28:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:53,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:53,903 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:53,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:53,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:53,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1888085791, now seen corresponding path program 1 times [2019-10-15 01:28:53,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:53,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808887646] [2019-10-15 01:28:53,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,997 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:53,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808887646] [2019-10-15 01:28:53,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:53,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:53,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927784908] [2019-10-15 01:28:53,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:53,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:53,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:54,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:54,000 INFO L87 Difference]: Start difference. First operand 190 states and 254 transitions. Second operand 5 states. [2019-10-15 01:28:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,440 INFO L93 Difference]: Finished difference Result 405 states and 562 transitions. [2019-10-15 01:28:54,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:54,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,443 INFO L225 Difference]: With dead ends: 405 [2019-10-15 01:28:54,443 INFO L226 Difference]: Without dead ends: 236 [2019-10-15 01:28:54,444 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:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-15 01:28:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 190. [2019-10-15 01:28:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-15 01:28:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 253 transitions. [2019-10-15 01:28:54,464 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 253 transitions. Word has length 105 [2019-10-15 01:28:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:54,464 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 253 transitions. [2019-10-15 01:28:54,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 253 transitions. [2019-10-15 01:28:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:54,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:54,466 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:54,466 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1861020189, now seen corresponding path program 1 times [2019-10-15 01:28:54,467 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:54,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929210131] [2019-10-15 01:28:54,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:54,519 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:54,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929210131] [2019-10-15 01:28:54,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:54,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:54,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577648980] [2019-10-15 01:28:54,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:54,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:54,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:54,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:54,521 INFO L87 Difference]: Start difference. First operand 190 states and 253 transitions. Second operand 4 states. [2019-10-15 01:28:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,752 INFO L93 Difference]: Finished difference Result 518 states and 714 transitions. [2019-10-15 01:28:54,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:54,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-15 01:28:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,755 INFO L225 Difference]: With dead ends: 518 [2019-10-15 01:28:54,755 INFO L226 Difference]: Without dead ends: 350 [2019-10-15 01:28:54,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-10-15 01:28:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 345. [2019-10-15 01:28:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-10-15 01:28:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 459 transitions. [2019-10-15 01:28:54,790 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 459 transitions. Word has length 105 [2019-10-15 01:28:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:54,790 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 459 transitions. [2019-10-15 01:28:54,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 459 transitions. [2019-10-15 01:28:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:54,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:54,792 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:54,792 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash -723391324, now seen corresponding path program 1 times [2019-10-15 01:28:54,793 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:54,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418148079] [2019-10-15 01:28:54,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:54,840 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:54,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418148079] [2019-10-15 01:28:54,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:54,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:54,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260726314] [2019-10-15 01:28:54,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:54,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:54,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:54,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:54,842 INFO L87 Difference]: Start difference. First operand 345 states and 459 transitions. Second operand 6 states. [2019-10-15 01:28:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,915 INFO L93 Difference]: Finished difference Result 684 states and 934 transitions. [2019-10-15 01:28:54,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:54,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-15 01:28:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,918 INFO L225 Difference]: With dead ends: 684 [2019-10-15 01:28:54,919 INFO L226 Difference]: Without dead ends: 361 [2019-10-15 01:28:54,920 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:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-15 01:28:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 350. [2019-10-15 01:28:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-15 01:28:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 463 transitions. [2019-10-15 01:28:54,953 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 463 transitions. Word has length 105 [2019-10-15 01:28:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:54,954 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 463 transitions. [2019-10-15 01:28:54,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 463 transitions. [2019-10-15 01:28:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:54,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:54,956 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:54,956 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:54,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1140787930, now seen corresponding path program 1 times [2019-10-15 01:28:54,957 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:54,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285074959] [2019-10-15 01:28:54,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,030 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:55,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285074959] [2019-10-15 01:28:55,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:55,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:55,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989025998] [2019-10-15 01:28:55,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:55,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:55,035 INFO L87 Difference]: Start difference. First operand 350 states and 463 transitions. Second operand 6 states. [2019-10-15 01:28:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:55,110 INFO L93 Difference]: Finished difference Result 704 states and 958 transitions. [2019-10-15 01:28:55,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:55,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-15 01:28:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:55,117 INFO L225 Difference]: With dead ends: 704 [2019-10-15 01:28:55,117 INFO L226 Difference]: Without dead ends: 376 [2019-10-15 01:28:55,120 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:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-15 01:28:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 360. [2019-10-15 01:28:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-15 01:28:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2019-10-15 01:28:55,168 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 105 [2019-10-15 01:28:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,168 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2019-10-15 01:28:55,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2019-10-15 01:28:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:55,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,170 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:55,171 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash -264768924, now seen corresponding path program 1 times [2019-10-15 01:28:55,171 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69657181] [2019-10-15 01:28:55,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,236 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:55,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69657181] [2019-10-15 01:28:55,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:55,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:55,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730441624] [2019-10-15 01:28:55,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:55,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:55,240 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand 6 states. [2019-10-15 01:28:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:55,296 INFO L93 Difference]: Finished difference Result 718 states and 968 transitions. [2019-10-15 01:28:55,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:55,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-15 01:28:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:55,300 INFO L225 Difference]: With dead ends: 718 [2019-10-15 01:28:55,300 INFO L226 Difference]: Without dead ends: 380 [2019-10-15 01:28:55,306 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:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-15 01:28:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 370. [2019-10-15 01:28:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-15 01:28:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 483 transitions. [2019-10-15 01:28:55,343 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 483 transitions. Word has length 105 [2019-10-15 01:28:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,343 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 483 transitions. [2019-10-15 01:28:55,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 483 transitions. [2019-10-15 01:28:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:55,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,345 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:55,346 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,346 INFO L82 PathProgramCache]: Analyzing trace with hash 628717414, now seen corresponding path program 1 times [2019-10-15 01:28:55,347 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667792307] [2019-10-15 01:28:55,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,419 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:55,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667792307] [2019-10-15 01:28:55,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:55,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:55,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083619484] [2019-10-15 01:28:55,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:55,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:55,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:55,423 INFO L87 Difference]: Start difference. First operand 370 states and 483 transitions. Second operand 6 states. [2019-10-15 01:28:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:55,475 INFO L93 Difference]: Finished difference Result 732 states and 978 transitions. [2019-10-15 01:28:55,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:55,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-10-15 01:28:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:55,479 INFO L225 Difference]: With dead ends: 732 [2019-10-15 01:28:55,479 INFO L226 Difference]: Without dead ends: 384 [2019-10-15 01:28:55,481 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:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-15 01:28:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2019-10-15 01:28:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-15 01:28:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 493 transitions. [2019-10-15 01:28:55,518 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 493 transitions. Word has length 105 [2019-10-15 01:28:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,519 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 493 transitions. [2019-10-15 01:28:55,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 493 transitions. [2019-10-15 01:28:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:55,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,521 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:55,522 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 234350628, now seen corresponding path program 1 times [2019-10-15 01:28:55,523 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891085708] [2019-10-15 01:28:55,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,657 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:55,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891085708] [2019-10-15 01:28:55,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:55,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:55,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138002716] [2019-10-15 01:28:55,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:55,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:55,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:55,659 INFO L87 Difference]: Start difference. First operand 380 states and 493 transitions. Second operand 5 states. [2019-10-15 01:28:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:56,221 INFO L93 Difference]: Finished difference Result 896 states and 1184 transitions. [2019-10-15 01:28:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:56,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:56,225 INFO L225 Difference]: With dead ends: 896 [2019-10-15 01:28:56,226 INFO L226 Difference]: Without dead ends: 539 [2019-10-15 01:28:56,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-10-15 01:28:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 499. [2019-10-15 01:28:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-10-15 01:28:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 635 transitions. [2019-10-15 01:28:56,271 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 635 transitions. Word has length 105 [2019-10-15 01:28:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:56,271 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 635 transitions. [2019-10-15 01:28:56,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 635 transitions. [2019-10-15 01:28:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:56,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:56,273 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:56,274 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash 509110242, now seen corresponding path program 1 times [2019-10-15 01:28:56,274 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:56,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166390151] [2019-10-15 01:28:56,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:56,347 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:56,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166390151] [2019-10-15 01:28:56,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:56,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:56,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778850773] [2019-10-15 01:28:56,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:56,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:56,350 INFO L87 Difference]: Start difference. First operand 499 states and 635 transitions. Second operand 5 states. [2019-10-15 01:28:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:56,762 INFO L93 Difference]: Finished difference Result 975 states and 1246 transitions. [2019-10-15 01:28:56,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:56,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:56,767 INFO L225 Difference]: With dead ends: 975 [2019-10-15 01:28:56,767 INFO L226 Difference]: Without dead ends: 499 [2019-10-15 01:28:56,769 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:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-15 01:28:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-10-15 01:28:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-10-15 01:28:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 630 transitions. [2019-10-15 01:28:56,810 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 630 transitions. Word has length 105 [2019-10-15 01:28:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:56,811 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 630 transitions. [2019-10-15 01:28:56,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 630 transitions. [2019-10-15 01:28:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:56,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:56,814 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:56,814 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1210710116, now seen corresponding path program 1 times [2019-10-15 01:28:56,815 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:56,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635196516] [2019-10-15 01:28:56,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:56,913 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:56,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635196516] [2019-10-15 01:28:56,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:56,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:56,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273562923] [2019-10-15 01:28:56,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:56,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:56,916 INFO L87 Difference]: Start difference. First operand 499 states and 630 transitions. Second operand 5 states. [2019-10-15 01:28:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:57,415 INFO L93 Difference]: Finished difference Result 975 states and 1236 transitions. [2019-10-15 01:28:57,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:57,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:57,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:57,421 INFO L225 Difference]: With dead ends: 975 [2019-10-15 01:28:57,421 INFO L226 Difference]: Without dead ends: 499 [2019-10-15 01:28:57,425 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:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-15 01:28:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-10-15 01:28:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-10-15 01:28:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 625 transitions. [2019-10-15 01:28:57,466 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 625 transitions. Word has length 105 [2019-10-15 01:28:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:57,467 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 625 transitions. [2019-10-15 01:28:57,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 625 transitions. [2019-10-15 01:28:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:57,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:57,469 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:57,470 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1233342370, now seen corresponding path program 1 times [2019-10-15 01:28:57,470 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569825935] [2019-10-15 01:28:57,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,542 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:57,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569825935] [2019-10-15 01:28:57,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:57,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:57,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349720935] [2019-10-15 01:28:57,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:57,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:57,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:57,544 INFO L87 Difference]: Start difference. First operand 499 states and 625 transitions. Second operand 5 states. [2019-10-15 01:28:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,135 INFO L93 Difference]: Finished difference Result 1073 states and 1375 transitions. [2019-10-15 01:28:58,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:58,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,140 INFO L225 Difference]: With dead ends: 1073 [2019-10-15 01:28:58,141 INFO L226 Difference]: Without dead ends: 596 [2019-10-15 01:28:58,145 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:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-15 01:28:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 561. [2019-10-15 01:28:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-15 01:28:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 697 transitions. [2019-10-15 01:28:58,211 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 697 transitions. Word has length 105 [2019-10-15 01:28:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,214 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 697 transitions. [2019-10-15 01:28:58,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 697 transitions. [2019-10-15 01:28:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:58,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,216 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:58,217 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash 723869280, now seen corresponding path program 1 times [2019-10-15 01:28:58,218 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136938112] [2019-10-15 01:28:58,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:58,310 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:58,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136938112] [2019-10-15 01:28:58,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:58,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:58,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597455816] [2019-10-15 01:28:58,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:58,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:58,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:58,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:58,323 INFO L87 Difference]: Start difference. First operand 561 states and 697 transitions. Second operand 5 states. [2019-10-15 01:28:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:59,027 INFO L93 Difference]: Finished difference Result 1325 states and 1735 transitions. [2019-10-15 01:28:59,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:59,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:59,036 INFO L225 Difference]: With dead ends: 1325 [2019-10-15 01:28:59,037 INFO L226 Difference]: Without dead ends: 786 [2019-10-15 01:28:59,040 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:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-10-15 01:28:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 647. [2019-10-15 01:28:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 01:28:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 786 transitions. [2019-10-15 01:28:59,100 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 786 transitions. Word has length 105 [2019-10-15 01:28:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,101 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 786 transitions. [2019-10-15 01:28:59,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 786 transitions. [2019-10-15 01:28:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:59,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,102 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:59,103 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1647869982, now seen corresponding path program 1 times [2019-10-15 01:28:59,104 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81357011] [2019-10-15 01:28:59,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,184 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:59,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81357011] [2019-10-15 01:28:59,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:59,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:59,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820548115] [2019-10-15 01:28:59,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:59,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:59,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:59,187 INFO L87 Difference]: Start difference. First operand 647 states and 786 transitions. Second operand 5 states. [2019-10-15 01:28:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:59,764 INFO L93 Difference]: Finished difference Result 1474 states and 1904 transitions. [2019-10-15 01:28:59,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:59,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-15 01:28:59,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:59,772 INFO L225 Difference]: With dead ends: 1474 [2019-10-15 01:28:59,773 INFO L226 Difference]: Without dead ends: 849 [2019-10-15 01:28:59,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-10-15 01:28:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 739. [2019-10-15 01:28:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-10-15 01:28:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 886 transitions. [2019-10-15 01:28:59,843 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 886 transitions. Word has length 105 [2019-10-15 01:28:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,843 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 886 transitions. [2019-10-15 01:28:59,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 886 transitions. [2019-10-15 01:28:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:28:59,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,847 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:59,847 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1585830368, now seen corresponding path program 1 times [2019-10-15 01:28:59,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811529934] [2019-10-15 01:28:59,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,914 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:59,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811529934] [2019-10-15 01:28:59,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:59,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:59,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46814695] [2019-10-15 01:28:59,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:59,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:59,918 INFO L87 Difference]: Start difference. First operand 739 states and 886 transitions. Second operand 3 states. [2019-10-15 01:29:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:00,108 INFO L93 Difference]: Finished difference Result 2099 states and 2536 transitions. [2019-10-15 01:29:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:00,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-15 01:29:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:00,121 INFO L225 Difference]: With dead ends: 2099 [2019-10-15 01:29:00,121 INFO L226 Difference]: Without dead ends: 1385 [2019-10-15 01:29:00,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-10-15 01:29:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1382. [2019-10-15 01:29:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-10-15 01:29:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1666 transitions. [2019-10-15 01:29:00,282 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1666 transitions. Word has length 105 [2019-10-15 01:29:00,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:00,283 INFO L462 AbstractCegarLoop]: Abstraction has 1382 states and 1666 transitions. [2019-10-15 01:29:00,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1666 transitions. [2019-10-15 01:29:00,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:29:00,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:00,287 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, 1] [2019-10-15 01:29:00,288 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:00,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1038281626, now seen corresponding path program 1 times [2019-10-15 01:29:00,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:00,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622462656] [2019-10-15 01:29:00,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:00,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622462656] [2019-10-15 01:29:00,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:00,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:00,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110019894] [2019-10-15 01:29:00,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:00,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:00,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:00,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:00,358 INFO L87 Difference]: Start difference. First operand 1382 states and 1666 transitions. Second operand 3 states. [2019-10-15 01:29:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:00,573 INFO L93 Difference]: Finished difference Result 4000 states and 5001 transitions. [2019-10-15 01:29:00,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:00,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-15 01:29:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:00,595 INFO L225 Difference]: With dead ends: 4000 [2019-10-15 01:29:00,596 INFO L226 Difference]: Without dead ends: 2649 [2019-10-15 01:29:00,602 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:29:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2019-10-15 01:29:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2643. [2019-10-15 01:29:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-10-15 01:29:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 3237 transitions. [2019-10-15 01:29:00,864 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 3237 transitions. Word has length 106 [2019-10-15 01:29:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:00,865 INFO L462 AbstractCegarLoop]: Abstraction has 2643 states and 3237 transitions. [2019-10-15 01:29:00,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3237 transitions. [2019-10-15 01:29:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:29:00,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:00,870 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:29:00,870 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:00,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash -941553424, now seen corresponding path program 1 times [2019-10-15 01:29:00,871 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:00,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811319960] [2019-10-15 01:29:00,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:29:00,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811319960] [2019-10-15 01:29:00,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:00,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:00,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760508981] [2019-10-15 01:29:00,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:00,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:00,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:00,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:00,922 INFO L87 Difference]: Start difference. First operand 2643 states and 3237 transitions. Second operand 3 states. [2019-10-15 01:29:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,256 INFO L93 Difference]: Finished difference Result 7814 states and 9714 transitions. [2019-10-15 01:29:01,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:01,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-15 01:29:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,284 INFO L225 Difference]: With dead ends: 7814 [2019-10-15 01:29:01,284 INFO L226 Difference]: Without dead ends: 3927 [2019-10-15 01:29:01,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2019-10-15 01:29:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3927. [2019-10-15 01:29:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3927 states. [2019-10-15 01:29:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 4801 transitions. [2019-10-15 01:29:01,773 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 4801 transitions. Word has length 127 [2019-10-15 01:29:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:01,773 INFO L462 AbstractCegarLoop]: Abstraction has 3927 states and 4801 transitions. [2019-10-15 01:29:01,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 4801 transitions. [2019-10-15 01:29:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-15 01:29:01,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:01,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:29:01,784 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1911837015, now seen corresponding path program 1 times [2019-10-15 01:29:01,784 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:01,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449376202] [2019-10-15 01:29:01,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-15 01:29:01,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449376202] [2019-10-15 01:29:01,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:01,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:01,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886866123] [2019-10-15 01:29:01,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:01,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:01,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:01,852 INFO L87 Difference]: Start difference. First operand 3927 states and 4801 transitions. Second operand 3 states. [2019-10-15 01:29:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:02,377 INFO L93 Difference]: Finished difference Result 11541 states and 14535 transitions. [2019-10-15 01:29:02,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:02,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-15 01:29:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:02,426 INFO L225 Difference]: With dead ends: 11541 [2019-10-15 01:29:02,426 INFO L226 Difference]: Without dead ends: 7649 [2019-10-15 01:29:02,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2019-10-15 01:29:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 7646. [2019-10-15 01:29:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7646 states. [2019-10-15 01:29:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7646 states to 7646 states and 9538 transitions. [2019-10-15 01:29:03,202 INFO L78 Accepts]: Start accepts. Automaton has 7646 states and 9538 transitions. Word has length 180 [2019-10-15 01:29:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:03,202 INFO L462 AbstractCegarLoop]: Abstraction has 7646 states and 9538 transitions. [2019-10-15 01:29:03,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7646 states and 9538 transitions. [2019-10-15 01:29:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-15 01:29:03,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:03,217 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, 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] [2019-10-15 01:29:03,218 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:03,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:03,218 INFO L82 PathProgramCache]: Analyzing trace with hash -875605821, now seen corresponding path program 1 times [2019-10-15 01:29:03,218 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:03,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644466635] [2019-10-15 01:29:03,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 01:29:03,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644466635] [2019-10-15 01:29:03,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879063099] [2019-10-15 01:29:03,309 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:29:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:03,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 01:29:03,563 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 01:29:03,791 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:03,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-10-15 01:29:03,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436246003] [2019-10-15 01:29:03,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:03,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:03,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:29:03,796 INFO L87 Difference]: Start difference. First operand 7646 states and 9538 transitions. Second operand 4 states. [2019-10-15 01:29:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:04,906 INFO L93 Difference]: Finished difference Result 22358 states and 29610 transitions. [2019-10-15 01:29:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:04,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-10-15 01:29:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,010 INFO L225 Difference]: With dead ends: 22358 [2019-10-15 01:29:05,010 INFO L226 Difference]: Without dead ends: 14755 [2019-10-15 01:29:05,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 363 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:29:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14755 states. [2019-10-15 01:29:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14755 to 14716. [2019-10-15 01:29:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14716 states. [2019-10-15 01:29:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14716 states to 14716 states and 18013 transitions. [2019-10-15 01:29:06,271 INFO L78 Accepts]: Start accepts. Automaton has 14716 states and 18013 transitions. Word has length 181 [2019-10-15 01:29:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:06,272 INFO L462 AbstractCegarLoop]: Abstraction has 14716 states and 18013 transitions. [2019-10-15 01:29:06,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 14716 states and 18013 transitions. [2019-10-15 01:29:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-15 01:29:06,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:06,299 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, 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] [2019-10-15 01:29:06,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:06,504 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash -248422449, now seen corresponding path program 1 times [2019-10-15 01:29:06,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:06,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775901835] [2019-10-15 01:29:06,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-10-15 01:29:06,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775901835] [2019-10-15 01:29:06,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:06,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:06,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747404594] [2019-10-15 01:29:06,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:06,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:06,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:06,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:06,590 INFO L87 Difference]: Start difference. First operand 14716 states and 18013 transitions. Second operand 4 states. [2019-10-15 01:29:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:07,919 INFO L93 Difference]: Finished difference Result 26413 states and 32122 transitions. [2019-10-15 01:29:07,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:07,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-10-15 01:29:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:07,970 INFO L225 Difference]: With dead ends: 26413 [2019-10-15 01:29:07,970 INFO L226 Difference]: Without dead ends: 11730 [2019-10-15 01:29:07,997 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:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11730 states. [2019-10-15 01:29:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11730 to 11392. [2019-10-15 01:29:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11392 states. [2019-10-15 01:29:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11392 states to 11392 states and 13807 transitions. [2019-10-15 01:29:08,701 INFO L78 Accepts]: Start accepts. Automaton has 11392 states and 13807 transitions. Word has length 242 [2019-10-15 01:29:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:08,702 INFO L462 AbstractCegarLoop]: Abstraction has 11392 states and 13807 transitions. [2019-10-15 01:29:08,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 11392 states and 13807 transitions. [2019-10-15 01:29:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-15 01:29:08,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:08,715 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, 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] [2019-10-15 01:29:08,716 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1139497071, now seen corresponding path program 1 times [2019-10-15 01:29:08,716 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:08,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790027670] [2019-10-15 01:29:08,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-15 01:29:08,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790027670] [2019-10-15 01:29:08,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421175220] [2019-10-15 01:29:08,799 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:29:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:08,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-15 01:29:09,034 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-15 01:29:09,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:09,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-10-15 01:29:09,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154162938] [2019-10-15 01:29:09,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:09,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:09,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:09,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:09,253 INFO L87 Difference]: Start difference. First operand 11392 states and 13807 transitions. Second operand 3 states. [2019-10-15 01:29:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:10,153 INFO L93 Difference]: Finished difference Result 29721 states and 38362 transitions. [2019-10-15 01:29:10,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:10,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-10-15 01:29:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:10,232 INFO L225 Difference]: With dead ends: 29721 [2019-10-15 01:29:10,233 INFO L226 Difference]: Without dead ends: 18362 [2019-10-15 01:29:10,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 484 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:29:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18362 states. [2019-10-15 01:29:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18362 to 18305. [2019-10-15 01:29:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18305 states. [2019-10-15 01:29:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18305 states to 18305 states and 22604 transitions. [2019-10-15 01:29:11,462 INFO L78 Accepts]: Start accepts. Automaton has 18305 states and 22604 transitions. Word has length 242 [2019-10-15 01:29:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:11,463 INFO L462 AbstractCegarLoop]: Abstraction has 18305 states and 22604 transitions. [2019-10-15 01:29:11,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 18305 states and 22604 transitions. [2019-10-15 01:29:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-15 01:29:11,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:11,489 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, 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] [2019-10-15 01:29:11,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:11,693 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:11,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash -65823310, now seen corresponding path program 1 times [2019-10-15 01:29:11,693 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:11,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055917825] [2019-10-15 01:29:11,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:11,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:11,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-15 01:29:11,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055917825] [2019-10-15 01:29:11,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949675474] [2019-10-15 01:29:11,782 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:29:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:11,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:29:11,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-15 01:29:12,166 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-15 01:29:12,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:12,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-10-15 01:29:12,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691207128] [2019-10-15 01:29:12,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:12,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:12,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:12,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:12,481 INFO L87 Difference]: Start difference. First operand 18305 states and 22604 transitions. Second operand 3 states. [2019-10-15 01:29:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:14,871 INFO L93 Difference]: Finished difference Result 29721 states and 36612 transitions. [2019-10-15 01:29:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:14,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-10-15 01:29:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:14,965 INFO L225 Difference]: With dead ends: 29721 [2019-10-15 01:29:14,965 INFO L226 Difference]: Without dead ends: 18358 [2019-10-15 01:29:15,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 485 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18358 states. [2019-10-15 01:29:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18358 to 18301. [2019-10-15 01:29:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18301 states. [2019-10-15 01:29:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18301 states to 18301 states and 22132 transitions. [2019-10-15 01:29:17,043 INFO L78 Accepts]: Start accepts. Automaton has 18301 states and 22132 transitions. Word has length 245 [2019-10-15 01:29:17,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:17,043 INFO L462 AbstractCegarLoop]: Abstraction has 18301 states and 22132 transitions. [2019-10-15 01:29:17,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 18301 states and 22132 transitions. [2019-10-15 01:29:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-15 01:29:17,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:17,066 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, 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] [2019-10-15 01:29:17,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:17,271 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:17,272 INFO L82 PathProgramCache]: Analyzing trace with hash 550544530, now seen corresponding path program 1 times [2019-10-15 01:29:17,272 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:17,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563910445] [2019-10-15 01:29:17,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:17,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:17,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-15 01:29:17,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563910445] [2019-10-15 01:29:17,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499906966] [2019-10-15 01:29:17,416 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:29:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:17,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:29:17,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-15 01:29:17,678 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-15 01:29:17,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:17,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2019-10-15 01:29:17,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217729635] [2019-10-15 01:29:17,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:17,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:17,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:29:17,875 INFO L87 Difference]: Start difference. First operand 18301 states and 22132 transitions. Second operand 4 states.