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 -i ../../../trunk/examples/svcomp/systemc/token_ring.05.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:39:24,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:39:24,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:39:24,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:39:24,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:39:24,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:39:24,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:39:24,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:39:24,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:39:24,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:39:24,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:39:24,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:39:24,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:39:24,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:39:24,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:39:24,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:39:24,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:39:24,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:39:24,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:39:24,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:39:24,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:39:24,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:39:24,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:39:24,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:39:24,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:39:24,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:39:24,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:39:24,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:39:24,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:39:24,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:39:24,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:39:24,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:39:24,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:39:24,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:39:24,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:39:24,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:39:24,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:39:24,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:39:24,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:39:24,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:39:24,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:39:24,260 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-09-08 06:39:24,274 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:39:24,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:39:24,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:39:24,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:39:24,276 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:39:24,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:39:24,276 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:39:24,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:39:24,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:39:24,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:39:24,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:39:24,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:39:24,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:39:24,278 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:39:24,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:39:24,278 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:39:24,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:39:24,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:39:24,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:39:24,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:39:24,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:39:24,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:39:24,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:39:24,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:39:24,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:39:24,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:39:24,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:39:24,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:39:24,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:39:24,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:39:24,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:39:24,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:39:24,338 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:39:24,338 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:39:24,339 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.05.cil-2.c [2019-09-08 06:39:24,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26f3cc64/736104886bf14cf6a77fd37fa3b145b3/FLAGfd74ae013 [2019-09-08 06:39:24,861 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:39:24,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.05.cil-2.c [2019-09-08 06:39:24,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26f3cc64/736104886bf14cf6a77fd37fa3b145b3/FLAGfd74ae013 [2019-09-08 06:39:25,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26f3cc64/736104886bf14cf6a77fd37fa3b145b3 [2019-09-08 06:39:25,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:39:25,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:39:25,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:39:25,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:39:25,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:39:25,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:39:25" (1/1) ... [2019-09-08 06:39:25,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0615bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25, skipping insertion in model container [2019-09-08 06:39:25,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:39:25" (1/1) ... [2019-09-08 06:39:25,233 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:39:25,292 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:39:25,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:39:25,788 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:39:25,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:39:25,873 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:39:25,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25 WrapperNode [2019-09-08 06:39:25,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:39:25,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:39:25,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:39:25,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:39:25,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25" (1/1) ... [2019-09-08 06:39:25,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25" (1/1) ... [2019-09-08 06:39:25,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25" (1/1) ... [2019-09-08 06:39:25,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25" (1/1) ... [2019-09-08 06:39:25,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25" (1/1) ... [2019-09-08 06:39:25,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25" (1/1) ... [2019-09-08 06:39:25,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25" (1/1) ... [2019-09-08 06:39:25,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:39:25,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:39:25,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:39:25,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:39:25,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:39:26,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:39:26,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:39:26,011 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:39:26,012 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:39:26,012 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:39:26,012 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:39:26,012 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:39:26,013 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:39:26,014 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:39:26,015 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:39:26,015 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:39:26,015 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:39:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:39:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:39:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:39:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:39:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:39:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:39:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:39:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:39:26,021 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:39:26,021 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:39:26,021 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:39:26,022 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:39:26,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:39:26,023 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:39:26,023 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:39:26,023 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:39:26,024 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:39:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:39:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:39:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:39:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:39:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:39:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:39:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:39:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:39:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:39:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:39:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:39:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:39:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:39:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:39:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:39:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:39:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:39:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:39:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:39:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:39:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:39:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:39:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:39:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:39:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:39:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:39:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:39:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:39:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:39:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:39:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:39:26,778 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:39:26,779 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-09-08 06:39:26,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:39:26 BoogieIcfgContainer [2019-09-08 06:39:26,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:39:26,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:39:26,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:39:26,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:39:26,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:39:25" (1/3) ... [2019-09-08 06:39:26,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653bd2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:39:26, skipping insertion in model container [2019-09-08 06:39:26,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:39:25" (2/3) ... [2019-09-08 06:39:26,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653bd2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:39:26, skipping insertion in model container [2019-09-08 06:39:26,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:39:26" (3/3) ... [2019-09-08 06:39:26,788 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-2.c [2019-09-08 06:39:26,798 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:39:26,806 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:39:26,822 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:39:26,854 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:39:26,855 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:39:26,855 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:39:26,856 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:39:26,856 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:39:26,856 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:39:26,856 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:39:26,857 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:39:26,857 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:39:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states. [2019-09-08 06:39:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:26,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:26,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:26,901 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1273585975, now seen corresponding path program 1 times [2019-09-08 06:39:26,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:26,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:26,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:27,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:27,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:27,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:27,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:27,382 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 4 states. [2019-09-08 06:39:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:27,760 INFO L93 Difference]: Finished difference Result 521 states and 781 transitions. [2019-09-08 06:39:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:27,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-09-08 06:39:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:27,781 INFO L225 Difference]: With dead ends: 521 [2019-09-08 06:39:27,781 INFO L226 Difference]: Without dead ends: 262 [2019-09-08 06:39:27,787 INFO L628 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-09-08 06:39:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-08 06:39:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-09-08 06:39:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 372 transitions. [2019-09-08 06:39:27,878 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 372 transitions. Word has length 134 [2019-09-08 06:39:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:27,880 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 372 transitions. [2019-09-08 06:39:27,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 372 transitions. [2019-09-08 06:39:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:27,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:27,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:27,894 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:27,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:27,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1019495051, now seen corresponding path program 1 times [2019-09-08 06:39:27,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:27,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:27,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:27,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:27,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:28,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:28,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:28,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:28,134 INFO L87 Difference]: Start difference. First operand 262 states and 372 transitions. Second operand 5 states. [2019-09-08 06:39:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:28,830 INFO L93 Difference]: Finished difference Result 543 states and 792 transitions. [2019-09-08 06:39:28,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:28,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:28,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:28,835 INFO L225 Difference]: With dead ends: 543 [2019-09-08 06:39:28,835 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 06:39:28,837 INFO L628 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-09-08 06:39:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 06:39:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 262. [2019-09-08 06:39:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 371 transitions. [2019-09-08 06:39:28,867 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 371 transitions. Word has length 134 [2019-09-08 06:39:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:28,868 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 371 transitions. [2019-09-08 06:39:28,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 371 transitions. [2019-09-08 06:39:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:28,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:28,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:28,871 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:28,871 INFO L82 PathProgramCache]: Analyzing trace with hash -19089523, now seen corresponding path program 1 times [2019-09-08 06:39:28,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:28,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:28,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:28,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:28,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:28,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:28,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:28,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:28,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:28,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:28,965 INFO L87 Difference]: Start difference. First operand 262 states and 371 transitions. Second operand 5 states. [2019-09-08 06:39:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:29,537 INFO L93 Difference]: Finished difference Result 543 states and 791 transitions. [2019-09-08 06:39:29,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:29,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:29,540 INFO L225 Difference]: With dead ends: 543 [2019-09-08 06:39:29,541 INFO L226 Difference]: Without dead ends: 304 [2019-09-08 06:39:29,542 INFO L628 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-09-08 06:39:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-08 06:39:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 262. [2019-09-08 06:39:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 370 transitions. [2019-09-08 06:39:29,570 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 370 transitions. Word has length 134 [2019-09-08 06:39:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:29,572 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 370 transitions. [2019-09-08 06:39:29,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 370 transitions. [2019-09-08 06:39:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:29,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:29,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:29,575 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1992254901, now seen corresponding path program 1 times [2019-09-08 06:39:29,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:29,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:29,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:29,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:29,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:29,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:29,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:29,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:29,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:29,693 INFO L87 Difference]: Start difference. First operand 262 states and 370 transitions. Second operand 5 states. [2019-09-08 06:39:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:30,284 INFO L93 Difference]: Finished difference Result 541 states and 785 transitions. [2019-09-08 06:39:30,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:30,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:30,288 INFO L225 Difference]: With dead ends: 541 [2019-09-08 06:39:30,288 INFO L226 Difference]: Without dead ends: 302 [2019-09-08 06:39:30,289 INFO L628 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-09-08 06:39:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-08 06:39:30,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 262. [2019-09-08 06:39:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2019-09-08 06:39:30,312 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 134 [2019-09-08 06:39:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:30,313 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2019-09-08 06:39:30,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2019-09-08 06:39:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:30,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:30,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:30,316 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash 160851917, now seen corresponding path program 1 times [2019-09-08 06:39:30,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:30,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:30,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:30,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:30,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:30,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:30,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:30,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:30,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:30,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:30,403 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 5 states. [2019-09-08 06:39:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:30,941 INFO L93 Difference]: Finished difference Result 539 states and 779 transitions. [2019-09-08 06:39:30,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:30,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:30,944 INFO L225 Difference]: With dead ends: 539 [2019-09-08 06:39:30,945 INFO L226 Difference]: Without dead ends: 300 [2019-09-08 06:39:30,946 INFO L628 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-09-08 06:39:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-08 06:39:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 262. [2019-09-08 06:39:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 368 transitions. [2019-09-08 06:39:30,966 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 368 transitions. Word has length 134 [2019-09-08 06:39:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:30,967 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 368 transitions. [2019-09-08 06:39:30,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 368 transitions. [2019-09-08 06:39:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:30,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:30,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:30,969 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash -462429685, now seen corresponding path program 1 times [2019-09-08 06:39:30,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:30,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:30,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:30,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:30,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:31,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:31,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:31,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:31,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:31,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:31,042 INFO L87 Difference]: Start difference. First operand 262 states and 368 transitions. Second operand 5 states. [2019-09-08 06:39:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:31,565 INFO L93 Difference]: Finished difference Result 535 states and 769 transitions. [2019-09-08 06:39:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:31,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:31,568 INFO L225 Difference]: With dead ends: 535 [2019-09-08 06:39:31,569 INFO L226 Difference]: Without dead ends: 296 [2019-09-08 06:39:31,570 INFO L628 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-09-08 06:39:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-08 06:39:31,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 262. [2019-09-08 06:39:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 367 transitions. [2019-09-08 06:39:31,592 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 367 transitions. Word has length 134 [2019-09-08 06:39:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:31,593 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 367 transitions. [2019-09-08 06:39:31,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 367 transitions. [2019-09-08 06:39:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:31,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:31,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:31,596 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:31,596 INFO L82 PathProgramCache]: Analyzing trace with hash 926864329, now seen corresponding path program 1 times [2019-09-08 06:39:31,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:31,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:31,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:31,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:31,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:31,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:31,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:31,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:31,704 INFO L87 Difference]: Start difference. First operand 262 states and 367 transitions. Second operand 5 states. [2019-09-08 06:39:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:32,285 INFO L93 Difference]: Finished difference Result 561 states and 813 transitions. [2019-09-08 06:39:32,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:32,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:32,288 INFO L225 Difference]: With dead ends: 561 [2019-09-08 06:39:32,288 INFO L226 Difference]: Without dead ends: 322 [2019-09-08 06:39:32,290 INFO L628 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-09-08 06:39:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-08 06:39:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 262. [2019-09-08 06:39:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 366 transitions. [2019-09-08 06:39:32,325 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 366 transitions. Word has length 134 [2019-09-08 06:39:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:32,326 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 366 transitions. [2019-09-08 06:39:32,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 366 transitions. [2019-09-08 06:39:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:32,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:32,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:32,329 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1106529717, now seen corresponding path program 1 times [2019-09-08 06:39:32,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:32,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:32,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:32,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:32,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:32,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:32,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:32,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:32,425 INFO L87 Difference]: Start difference. First operand 262 states and 366 transitions. Second operand 5 states. [2019-09-08 06:39:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:32,953 INFO L93 Difference]: Finished difference Result 555 states and 802 transitions. [2019-09-08 06:39:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:32,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:32,956 INFO L225 Difference]: With dead ends: 555 [2019-09-08 06:39:32,956 INFO L226 Difference]: Without dead ends: 316 [2019-09-08 06:39:32,959 INFO L628 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-09-08 06:39:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-08 06:39:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 262. [2019-09-08 06:39:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 365 transitions. [2019-09-08 06:39:32,987 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 365 transitions. Word has length 134 [2019-09-08 06:39:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:32,988 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 365 transitions. [2019-09-08 06:39:32,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 365 transitions. [2019-09-08 06:39:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:32,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:32,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:32,991 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:32,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1321728905, now seen corresponding path program 1 times [2019-09-08 06:39:32,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:32,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:32,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:32,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:32,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:33,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:33,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:33,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:33,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:33,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:33,064 INFO L87 Difference]: Start difference. First operand 262 states and 365 transitions. Second operand 5 states. [2019-09-08 06:39:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:33,554 INFO L93 Difference]: Finished difference Result 557 states and 801 transitions. [2019-09-08 06:39:33,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:33,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:33,557 INFO L225 Difference]: With dead ends: 557 [2019-09-08 06:39:33,557 INFO L226 Difference]: Without dead ends: 318 [2019-09-08 06:39:33,559 INFO L628 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-09-08 06:39:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-08 06:39:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 262. [2019-09-08 06:39:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 364 transitions. [2019-09-08 06:39:33,580 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 364 transitions. Word has length 134 [2019-09-08 06:39:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:33,581 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 364 transitions. [2019-09-08 06:39:33,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 364 transitions. [2019-09-08 06:39:33,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:33,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:33,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:33,583 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:33,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:33,583 INFO L82 PathProgramCache]: Analyzing trace with hash 14586507, now seen corresponding path program 1 times [2019-09-08 06:39:33,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:33,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:33,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:33,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:33,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:33,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:33,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:33,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:33,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:33,646 INFO L87 Difference]: Start difference. First operand 262 states and 364 transitions. Second operand 5 states. [2019-09-08 06:39:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:34,149 INFO L93 Difference]: Finished difference Result 555 states and 795 transitions. [2019-09-08 06:39:34,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:34,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:34,152 INFO L225 Difference]: With dead ends: 555 [2019-09-08 06:39:34,152 INFO L226 Difference]: Without dead ends: 316 [2019-09-08 06:39:34,153 INFO L628 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-09-08 06:39:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-08 06:39:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 262. [2019-09-08 06:39:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 363 transitions. [2019-09-08 06:39:34,177 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 363 transitions. Word has length 134 [2019-09-08 06:39:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:34,178 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 363 transitions. [2019-09-08 06:39:34,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 363 transitions. [2019-09-08 06:39:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:34,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:34,180 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:34,180 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:34,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1912083273, now seen corresponding path program 1 times [2019-09-08 06:39:34,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:34,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:34,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:34,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:34,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:34,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:34,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:34,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:34,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:34,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:34,243 INFO L87 Difference]: Start difference. First operand 262 states and 363 transitions. Second operand 5 states. [2019-09-08 06:39:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:34,736 INFO L93 Difference]: Finished difference Result 553 states and 789 transitions. [2019-09-08 06:39:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:34,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:34,739 INFO L225 Difference]: With dead ends: 553 [2019-09-08 06:39:34,740 INFO L226 Difference]: Without dead ends: 314 [2019-09-08 06:39:34,742 INFO L628 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-09-08 06:39:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-08 06:39:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 262. [2019-09-08 06:39:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 362 transitions. [2019-09-08 06:39:34,770 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 362 transitions. Word has length 134 [2019-09-08 06:39:34,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:34,770 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 362 transitions. [2019-09-08 06:39:34,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 362 transitions. [2019-09-08 06:39:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:34,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:34,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:34,773 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:34,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:34,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1351843125, now seen corresponding path program 1 times [2019-09-08 06:39:34,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:34,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:34,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:34,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:34,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:34,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:34,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:39:34,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:34,885 INFO L87 Difference]: Start difference. First operand 262 states and 362 transitions. Second operand 5 states. [2019-09-08 06:39:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:35,440 INFO L93 Difference]: Finished difference Result 551 states and 783 transitions. [2019-09-08 06:39:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:39:35,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-08 06:39:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:35,445 INFO L225 Difference]: With dead ends: 551 [2019-09-08 06:39:35,445 INFO L226 Difference]: Without dead ends: 312 [2019-09-08 06:39:35,447 INFO L628 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-09-08 06:39:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-08 06:39:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 262. [2019-09-08 06:39:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 06:39:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 361 transitions. [2019-09-08 06:39:35,477 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 361 transitions. Word has length 134 [2019-09-08 06:39:35,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:35,477 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 361 transitions. [2019-09-08 06:39:35,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 361 transitions. [2019-09-08 06:39:35,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 06:39:35,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:35,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:35,479 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:35,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1036720905, now seen corresponding path program 1 times [2019-09-08 06:39:35,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:35,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:35,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:35,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:35,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:39:35,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:35,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:35,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:35,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:35,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:35,551 INFO L87 Difference]: Start difference. First operand 262 states and 361 transitions. Second operand 4 states. [2019-09-08 06:39:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:35,825 INFO L93 Difference]: Finished difference Result 724 states and 1035 transitions. [2019-09-08 06:39:35,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:35,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-09-08 06:39:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:35,830 INFO L225 Difference]: With dead ends: 724 [2019-09-08 06:39:35,830 INFO L226 Difference]: Without dead ends: 486 [2019-09-08 06:39:35,832 INFO L628 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-09-08 06:39:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-09-08 06:39:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 485. [2019-09-08 06:39:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-08 06:39:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 665 transitions. [2019-09-08 06:39:35,920 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 665 transitions. Word has length 134 [2019-09-08 06:39:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:35,922 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 665 transitions. [2019-09-08 06:39:35,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 665 transitions. [2019-09-08 06:39:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 06:39:35,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:35,931 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:39:35,932 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:35,932 INFO L82 PathProgramCache]: Analyzing trace with hash -315092634, now seen corresponding path program 1 times [2019-09-08 06:39:35,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:35,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:35,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 06:39:36,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:36,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:36,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:36,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:36,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:39:36,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:36,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:39:36,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:39:36,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:39:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:39:36,540 INFO L87 Difference]: Start difference. First operand 485 states and 665 transitions. Second operand 7 states. [2019-09-08 06:39:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:36,779 INFO L93 Difference]: Finished difference Result 1435 states and 2092 transitions. [2019-09-08 06:39:36,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:39:36,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 219 [2019-09-08 06:39:36,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:36,787 INFO L225 Difference]: With dead ends: 1435 [2019-09-08 06:39:36,787 INFO L226 Difference]: Without dead ends: 974 [2019-09-08 06:39:36,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:39:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-08 06:39:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 930. [2019-09-08 06:39:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-09-08 06:39:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1309 transitions. [2019-09-08 06:39:36,942 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1309 transitions. Word has length 219 [2019-09-08 06:39:36,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:36,942 INFO L475 AbstractCegarLoop]: Abstraction has 930 states and 1309 transitions. [2019-09-08 06:39:36,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:39:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1309 transitions. [2019-09-08 06:39:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 06:39:36,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:36,950 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:36,951 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:36,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:36,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1383334969, now seen corresponding path program 1 times [2019-09-08 06:39:36,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:36,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:36,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:36,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:36,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 06:39:37,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:37,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:37,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:37,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:37,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:37,062 INFO L87 Difference]: Start difference. First operand 930 states and 1309 transitions. Second operand 4 states. [2019-09-08 06:39:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:37,289 INFO L93 Difference]: Finished difference Result 1827 states and 2570 transitions. [2019-09-08 06:39:37,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:37,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-08 06:39:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:37,296 INFO L225 Difference]: With dead ends: 1827 [2019-09-08 06:39:37,296 INFO L226 Difference]: Without dead ends: 921 [2019-09-08 06:39:37,302 INFO L628 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-09-08 06:39:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-09-08 06:39:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2019-09-08 06:39:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-09-08 06:39:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1292 transitions. [2019-09-08 06:39:37,421 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1292 transitions. Word has length 241 [2019-09-08 06:39:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:37,421 INFO L475 AbstractCegarLoop]: Abstraction has 921 states and 1292 transitions. [2019-09-08 06:39:37,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1292 transitions. [2019-09-08 06:39:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 06:39:37,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:37,426 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:39:37,427 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:37,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1522233821, now seen corresponding path program 1 times [2019-09-08 06:39:37,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:37,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:37,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 06:39:37,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:37,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:39:37,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:37,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:37,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:39:37,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:37,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:39:37,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:39:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:39:37,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:39:37,798 INFO L87 Difference]: Start difference. First operand 921 states and 1292 transitions. Second operand 7 states. [2019-09-08 06:39:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:38,079 INFO L93 Difference]: Finished difference Result 2780 states and 4163 transitions. [2019-09-08 06:39:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:39:38,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2019-09-08 06:39:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:38,097 INFO L225 Difference]: With dead ends: 2780 [2019-09-08 06:39:38,097 INFO L226 Difference]: Without dead ends: 1883 [2019-09-08 06:39:38,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:39:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2019-09-08 06:39:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1867. [2019-09-08 06:39:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-09-08 06:39:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2735 transitions. [2019-09-08 06:39:38,351 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2735 transitions. Word has length 220 [2019-09-08 06:39:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:38,351 INFO L475 AbstractCegarLoop]: Abstraction has 1867 states and 2735 transitions. [2019-09-08 06:39:38,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:39:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2735 transitions. [2019-09-08 06:39:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 06:39:38,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:38,360 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:39:38,360 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:38,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:38,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1714924319, now seen corresponding path program 1 times [2019-09-08 06:39:38,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:38,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:38,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:38,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 06:39:38,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:38,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:38,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:38,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:38,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:38,483 INFO L87 Difference]: Start difference. First operand 1867 states and 2735 transitions. Second operand 4 states. [2019-09-08 06:39:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:38,795 INFO L93 Difference]: Finished difference Result 3702 states and 5422 transitions. [2019-09-08 06:39:38,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:38,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-09-08 06:39:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:38,810 INFO L225 Difference]: With dead ends: 3702 [2019-09-08 06:39:38,810 INFO L226 Difference]: Without dead ends: 1859 [2019-09-08 06:39:38,820 INFO L628 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-09-08 06:39:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2019-09-08 06:39:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1859. [2019-09-08 06:39:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1859 states. [2019-09-08 06:39:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2718 transitions. [2019-09-08 06:39:39,009 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2718 transitions. Word has length 220 [2019-09-08 06:39:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:39,009 INFO L475 AbstractCegarLoop]: Abstraction has 1859 states and 2718 transitions. [2019-09-08 06:39:39,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2718 transitions. [2019-09-08 06:39:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 06:39:39,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:39,016 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:39:39,016 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:39,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:39,016 INFO L82 PathProgramCache]: Analyzing trace with hash 380924871, now seen corresponding path program 1 times [2019-09-08 06:39:39,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:39,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:39,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:39,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:39,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 06:39:39,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:39,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:39,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:39,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:39,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 06:39:39,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:39,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:39:39,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:39,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:39,440 INFO L87 Difference]: Start difference. First operand 1859 states and 2718 transitions. Second operand 5 states. [2019-09-08 06:39:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:40,548 INFO L93 Difference]: Finished difference Result 7263 states and 11828 transitions. [2019-09-08 06:39:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:39:40,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-09-08 06:39:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:40,603 INFO L225 Difference]: With dead ends: 7263 [2019-09-08 06:39:40,603 INFO L226 Difference]: Without dead ends: 5428 [2019-09-08 06:39:40,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:39:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5428 states. [2019-09-08 06:39:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5428 to 5364. [2019-09-08 06:39:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5364 states. [2019-09-08 06:39:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 5364 states and 8202 transitions. [2019-09-08 06:39:41,368 INFO L78 Accepts]: Start accepts. Automaton has 5364 states and 8202 transitions. Word has length 221 [2019-09-08 06:39:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:41,369 INFO L475 AbstractCegarLoop]: Abstraction has 5364 states and 8202 transitions. [2019-09-08 06:39:41,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5364 states and 8202 transitions. [2019-09-08 06:39:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 06:39:41,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:41,382 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:39:41,382 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:41,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:41,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1745053447, now seen corresponding path program 1 times [2019-09-08 06:39:41,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:41,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:41,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:41,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:41,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 06:39:41,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:39:41,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:39:41,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:39:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:39:41,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:39:41,510 INFO L87 Difference]: Start difference. First operand 5364 states and 8202 transitions. Second operand 4 states. [2019-09-08 06:39:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:42,242 INFO L93 Difference]: Finished difference Result 10697 states and 16359 transitions. [2019-09-08 06:39:42,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:39:42,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-09-08 06:39:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:42,287 INFO L225 Difference]: With dead ends: 10697 [2019-09-08 06:39:42,288 INFO L226 Difference]: Without dead ends: 5357 [2019-09-08 06:39:42,317 INFO L628 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-09-08 06:39:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states. [2019-09-08 06:39:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 5357. [2019-09-08 06:39:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5357 states. [2019-09-08 06:39:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 8187 transitions. [2019-09-08 06:39:42,915 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 8187 transitions. Word has length 221 [2019-09-08 06:39:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:42,916 INFO L475 AbstractCegarLoop]: Abstraction has 5357 states and 8187 transitions. [2019-09-08 06:39:42,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:39:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 8187 transitions. [2019-09-08 06:39:42,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 06:39:42,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:42,925 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:39:42,926 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:42,926 INFO L82 PathProgramCache]: Analyzing trace with hash 238847872, now seen corresponding path program 1 times [2019-09-08 06:39:42,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:42,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:42,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 06:39:43,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:43,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:43,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:43,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:43,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 06:39:43,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:43,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:39:43,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:39:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:39:43,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:39:43,246 INFO L87 Difference]: Start difference. First operand 5357 states and 8187 transitions. Second operand 7 states. [2019-09-08 06:39:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:44,383 INFO L93 Difference]: Finished difference Result 16284 states and 28435 transitions. [2019-09-08 06:39:44,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:39:44,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-09-08 06:39:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:44,516 INFO L225 Difference]: With dead ends: 16284 [2019-09-08 06:39:44,516 INFO L226 Difference]: Without dead ends: 10951 [2019-09-08 06:39:44,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:39:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10951 states. [2019-09-08 06:39:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10951 to 10875. [2019-09-08 06:39:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10875 states. [2019-09-08 06:39:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10875 states to 10875 states and 18163 transitions. [2019-09-08 06:39:46,204 INFO L78 Accepts]: Start accepts. Automaton has 10875 states and 18163 transitions. Word has length 222 [2019-09-08 06:39:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:46,204 INFO L475 AbstractCegarLoop]: Abstraction has 10875 states and 18163 transitions. [2019-09-08 06:39:46,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:39:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 10875 states and 18163 transitions. [2019-09-08 06:39:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 06:39:46,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:46,220 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:39:46,220 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:46,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:46,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1360095838, now seen corresponding path program 1 times [2019-09-08 06:39:46,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:46,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:46,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:46,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:46,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:39:46,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:46,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:39:46,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:46,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:46,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:39:46,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:46,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:39:46,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:39:46,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:39:46,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:39:46,583 INFO L87 Difference]: Start difference. First operand 10875 states and 18163 transitions. Second operand 5 states. [2019-09-08 06:39:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:50,089 INFO L93 Difference]: Finished difference Result 42829 states and 90020 transitions. [2019-09-08 06:39:50,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:39:50,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-09-08 06:39:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:39:50,441 INFO L225 Difference]: With dead ends: 42829 [2019-09-08 06:39:50,442 INFO L226 Difference]: Without dead ends: 31978 [2019-09-08 06:39:50,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 227 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-09-08 06:39:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31978 states. [2019-09-08 06:39:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31978 to 31654. [2019-09-08 06:39:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31654 states. [2019-09-08 06:39:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31654 states to 31654 states and 60104 transitions. [2019-09-08 06:39:54,371 INFO L78 Accepts]: Start accepts. Automaton has 31654 states and 60104 transitions. Word has length 223 [2019-09-08 06:39:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:39:54,372 INFO L475 AbstractCegarLoop]: Abstraction has 31654 states and 60104 transitions. [2019-09-08 06:39:54,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:39:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 31654 states and 60104 transitions. [2019-09-08 06:39:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 06:39:54,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:39:54,410 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:39:54,410 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:39:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:39:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash -80462070, now seen corresponding path program 1 times [2019-09-08 06:39:54,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:39:54,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:39:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:54,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:39:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 06:39:54,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:39:54,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:39:54,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:39:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:39:54,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1397 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:39:54,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:39:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 06:39:54,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:39:54,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:39:54,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:39:54,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:39:54,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:39:54,726 INFO L87 Difference]: Start difference. First operand 31654 states and 60104 transitions. Second operand 7 states. [2019-09-08 06:39:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:39:59,713 INFO L93 Difference]: Finished difference Result 95807 states and 236219 transitions. [2019-09-08 06:39:59,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:39:59,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 249 [2019-09-08 06:39:59,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:00,217 INFO L225 Difference]: With dead ends: 95807 [2019-09-08 06:40:00,217 INFO L226 Difference]: Without dead ends: 64181 [2019-09-08 06:40:00,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:40:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64181 states. [2019-09-08 06:40:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64181 to 64109. [2019-09-08 06:40:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64109 states. [2019-09-08 06:40:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64109 states to 64109 states and 141898 transitions. [2019-09-08 06:40:11,134 INFO L78 Accepts]: Start accepts. Automaton has 64109 states and 141898 transitions. Word has length 249 [2019-09-08 06:40:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:11,134 INFO L475 AbstractCegarLoop]: Abstraction has 64109 states and 141898 transitions. [2019-09-08 06:40:11,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:40:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 64109 states and 141898 transitions. [2019-09-08 06:40:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 06:40:11,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:11,197 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:40:11,198 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash -658988122, now seen corresponding path program 1 times [2019-09-08 06:40:11,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:11,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:11,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 06:40:11,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:11,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:40:11,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:40:11,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:40:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:40:11,273 INFO L87 Difference]: Start difference. First operand 64109 states and 141898 transitions. Second operand 4 states. [2019-09-08 06:40:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:16,876 INFO L93 Difference]: Finished difference Result 119659 states and 255614 transitions. [2019-09-08 06:40:16,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:40:16,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-09-08 06:40:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:17,259 INFO L225 Difference]: With dead ends: 119659 [2019-09-08 06:40:17,259 INFO L226 Difference]: Without dead ends: 55580 [2019-09-08 06:40:18,041 INFO L628 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-09-08 06:40:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55580 states. [2019-09-08 06:40:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55580 to 55580. [2019-09-08 06:40:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55580 states. [2019-09-08 06:40:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55580 states to 55580 states and 113758 transitions. [2019-09-08 06:40:22,906 INFO L78 Accepts]: Start accepts. Automaton has 55580 states and 113758 transitions. Word has length 250 [2019-09-08 06:40:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:22,906 INFO L475 AbstractCegarLoop]: Abstraction has 55580 states and 113758 transitions. [2019-09-08 06:40:22,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:40:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 55580 states and 113758 transitions. [2019-09-08 06:40:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 06:40:22,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:22,950 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:40:22,950 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:22,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:22,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1916037590, now seen corresponding path program 1 times [2019-09-08 06:40:22,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:22,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:22,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 06:40:23,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:23,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:40:23,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:40:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:40:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:40:23,021 INFO L87 Difference]: Start difference. First operand 55580 states and 113758 transitions. Second operand 4 states. [2019-09-08 06:40:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:30,694 INFO L93 Difference]: Finished difference Result 111131 states and 227476 transitions. [2019-09-08 06:40:30,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:40:30,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-09-08 06:40:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:31,033 INFO L225 Difference]: With dead ends: 111131 [2019-09-08 06:40:31,033 INFO L226 Difference]: Without dead ends: 55575 [2019-09-08 06:40:31,333 INFO L628 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-09-08 06:40:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55575 states. [2019-09-08 06:40:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55575 to 55575. [2019-09-08 06:40:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55575 states. [2019-09-08 06:40:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55575 states to 55575 states and 113746 transitions. [2019-09-08 06:40:36,518 INFO L78 Accepts]: Start accepts. Automaton has 55575 states and 113746 transitions. Word has length 223 [2019-09-08 06:40:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:36,519 INFO L475 AbstractCegarLoop]: Abstraction has 55575 states and 113746 transitions. [2019-09-08 06:40:36,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:40:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 55575 states and 113746 transitions. [2019-09-08 06:40:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 06:40:36,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:36,567 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 06:40:36,567 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1465639069, now seen corresponding path program 1 times [2019-09-08 06:40:36,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:36,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 06:40:36,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:40:36,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:40:36,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:40:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:36,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:40:36,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:40:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 06:40:36,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:40:36,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:40:36,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:40:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:40:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:40:36,914 INFO L87 Difference]: Start difference. First operand 55575 states and 113746 transitions. Second operand 7 states. [2019-09-08 06:40:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:42,414 INFO L93 Difference]: Finished difference Result 123854 states and 287384 transitions. [2019-09-08 06:40:42,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:40:42,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2019-09-08 06:40:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:42,709 INFO L225 Difference]: With dead ends: 123854 [2019-09-08 06:40:42,709 INFO L226 Difference]: Without dead ends: 68303 [2019-09-08 06:40:43,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:40:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68303 states. [2019-09-08 06:40:51,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68303 to 68303. [2019-09-08 06:40:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68303 states. [2019-09-08 06:40:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68303 states to 68303 states and 134768 transitions. [2019-09-08 06:40:52,280 INFO L78 Accepts]: Start accepts. Automaton has 68303 states and 134768 transitions. Word has length 224 [2019-09-08 06:40:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:52,280 INFO L475 AbstractCegarLoop]: Abstraction has 68303 states and 134768 transitions. [2019-09-08 06:40:52,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:40:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 68303 states and 134768 transitions. [2019-09-08 06:40:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2019-09-08 06:40:52,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:52,553 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:40:52,553 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:52,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:52,554 INFO L82 PathProgramCache]: Analyzing trace with hash -260910849, now seen corresponding path program 1 times [2019-09-08 06:40:52,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:52,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:52,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:52,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:52,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-09-08 06:40:52,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:40:52,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:40:52,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:40:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:53,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 2157 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:40:53,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:40:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:40:53,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:40:53,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:40:53,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:53,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:53,215 INFO L87 Difference]: Start difference. First operand 68303 states and 134768 transitions. Second operand 5 states. [2019-09-08 06:41:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:04,311 INFO L93 Difference]: Finished difference Result 174479 states and 400954 transitions. [2019-09-08 06:41:04,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:41:04,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 458 [2019-09-08 06:41:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:04,723 INFO L225 Difference]: With dead ends: 174479 [2019-09-08 06:41:04,723 INFO L226 Difference]: Without dead ends: 106200 [2019-09-08 06:41:05,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:41:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106200 states. [2019-09-08 06:41:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106200 to 95228. [2019-09-08 06:41:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95228 states. [2019-09-08 06:41:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95228 states to 95228 states and 175957 transitions. [2019-09-08 06:41:19,099 INFO L78 Accepts]: Start accepts. Automaton has 95228 states and 175957 transitions. Word has length 458 [2019-09-08 06:41:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:19,100 INFO L475 AbstractCegarLoop]: Abstraction has 95228 states and 175957 transitions. [2019-09-08 06:41:19,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 95228 states and 175957 transitions. [2019-09-08 06:41:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 06:41:19,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:19,380 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:41:19,380 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:19,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1420973832, now seen corresponding path program 1 times [2019-09-08 06:41:19,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:19,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:19,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:19,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:19,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-08 06:41:19,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:19,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:41:19,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:19,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:41:19,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 06:41:19,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:41:19,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:41:19,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:41:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:41:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:41:19,817 INFO L87 Difference]: Start difference. First operand 95228 states and 175957 transitions. Second operand 7 states. [2019-09-08 06:41:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:37,736 INFO L93 Difference]: Finished difference Result 242022 states and 555948 transitions. [2019-09-08 06:41:37,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:41:37,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 300 [2019-09-08 06:41:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:38,351 INFO L225 Difference]: With dead ends: 242022 [2019-09-08 06:41:38,351 INFO L226 Difference]: Without dead ends: 146818 [2019-09-08 06:41:39,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:41:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146818 states. [2019-09-08 06:41:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146818 to 146490. [2019-09-08 06:41:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146490 states. [2019-09-08 06:41:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146490 states to 146490 states and 289502 transitions. [2019-09-08 06:41:53,122 INFO L78 Accepts]: Start accepts. Automaton has 146490 states and 289502 transitions. Word has length 300 [2019-09-08 06:41:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:53,123 INFO L475 AbstractCegarLoop]: Abstraction has 146490 states and 289502 transitions. [2019-09-08 06:41:53,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:41:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 146490 states and 289502 transitions. [2019-09-08 06:41:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 06:41:53,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:53,630 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:41:53,630 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:53,631 INFO L82 PathProgramCache]: Analyzing trace with hash -36723649, now seen corresponding path program 1 times [2019-09-08 06:41:53,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:53,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:53,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:53,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:53,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-09-08 06:41:53,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:41:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:41:53,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:41:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:41:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:41:53,746 INFO L87 Difference]: Start difference. First operand 146490 states and 289502 transitions. Second operand 5 states. [2019-09-08 06:42:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:09,820 INFO L93 Difference]: Finished difference Result 292954 states and 579944 transitions. [2019-09-08 06:42:09,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:09,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-09-08 06:42:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:10,505 INFO L225 Difference]: With dead ends: 292954 [2019-09-08 06:42:10,505 INFO L226 Difference]: Without dead ends: 146490 [2019-09-08 06:42:12,071 INFO L628 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-09-08 06:42:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146490 states. [2019-09-08 06:42:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146490 to 146490. [2019-09-08 06:42:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146490 states. [2019-09-08 06:42:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146490 states to 146490 states and 288530 transitions. [2019-09-08 06:42:36,122 INFO L78 Accepts]: Start accepts. Automaton has 146490 states and 288530 transitions. Word has length 294 [2019-09-08 06:42:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:36,122 INFO L475 AbstractCegarLoop]: Abstraction has 146490 states and 288530 transitions. [2019-09-08 06:42:36,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 146490 states and 288530 transitions. [2019-09-08 06:42:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 06:42:36,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:36,617 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:36,617 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1977121729, now seen corresponding path program 1 times [2019-09-08 06:42:36,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:36,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:36,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-09-08 06:42:36,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:36,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:36,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:36,778 INFO L87 Difference]: Start difference. First operand 146490 states and 288530 transitions. Second operand 5 states. [2019-09-08 06:42:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:56,034 INFO L93 Difference]: Finished difference Result 292954 states and 578000 transitions. [2019-09-08 06:42:56,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:56,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-09-08 06:42:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:56,751 INFO L225 Difference]: With dead ends: 292954 [2019-09-08 06:42:56,752 INFO L226 Difference]: Without dead ends: 146490 [2019-09-08 06:42:58,125 INFO L628 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-09-08 06:42:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146490 states. [2019-09-08 06:43:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146490 to 146490. [2019-09-08 06:43:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146490 states. [2019-09-08 06:43:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146490 states to 146490 states and 287558 transitions. [2019-09-08 06:43:19,278 INFO L78 Accepts]: Start accepts. Automaton has 146490 states and 287558 transitions. Word has length 294 [2019-09-08 06:43:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:19,278 INFO L475 AbstractCegarLoop]: Abstraction has 146490 states and 287558 transitions. [2019-09-08 06:43:19,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 146490 states and 287558 transitions. [2019-09-08 06:43:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 06:43:19,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:19,794 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:19,794 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1903537151, now seen corresponding path program 1 times [2019-09-08 06:43:19,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:19,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:19,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-09-08 06:43:20,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:20,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:20,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:20,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:20,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:20,832 INFO L87 Difference]: Start difference. First operand 146490 states and 287558 transitions. Second operand 5 states. [2019-09-08 06:43:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:42,339 INFO L93 Difference]: Finished difference Result 292954 states and 576056 transitions. [2019-09-08 06:43:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:42,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-09-08 06:43:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:43,024 INFO L225 Difference]: With dead ends: 292954 [2019-09-08 06:43:43,025 INFO L226 Difference]: Without dead ends: 146490 [2019-09-08 06:43:44,268 INFO L628 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-09-08 06:43:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146490 states. [2019-09-08 06:44:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146490 to 146490. [2019-09-08 06:44:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146490 states. [2019-09-08 06:44:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146490 states to 146490 states and 286586 transitions. [2019-09-08 06:44:06,176 INFO L78 Accepts]: Start accepts. Automaton has 146490 states and 286586 transitions. Word has length 294 [2019-09-08 06:44:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:06,177 INFO L475 AbstractCegarLoop]: Abstraction has 146490 states and 286586 transitions. [2019-09-08 06:44:06,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 146490 states and 286586 transitions. [2019-09-08 06:44:06,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 06:44:06,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:06,702 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:44:06,702 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:06,703 INFO L82 PathProgramCache]: Analyzing trace with hash -177046527, now seen corresponding path program 1 times [2019-09-08 06:44:06,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:06,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:06,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:06,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:06,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-09-08 06:44:06,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:06,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:44:06,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:44:06,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:44:06,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:44:06,852 INFO L87 Difference]: Start difference. First operand 146490 states and 286586 transitions. Second operand 5 states. [2019-09-08 06:44:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:34,335 INFO L93 Difference]: Finished difference Result 361159 states and 749486 transitions. [2019-09-08 06:44:34,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:44:34,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-09-08 06:44:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:35,474 INFO L225 Difference]: With dead ends: 361159 [2019-09-08 06:44:35,474 INFO L226 Difference]: Without dead ends: 214695 [2019-09-08 06:44:36,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214695 states. [2019-09-08 06:45:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214695 to 205947. [2019-09-08 06:45:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205947 states. [2019-09-08 06:45:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205947 states to 205947 states and 363502 transitions. [2019-09-08 06:45:06,912 INFO L78 Accepts]: Start accepts. Automaton has 205947 states and 363502 transitions. Word has length 294 [2019-09-08 06:45:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:45:06,913 INFO L475 AbstractCegarLoop]: Abstraction has 205947 states and 363502 transitions. [2019-09-08 06:45:06,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:45:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 205947 states and 363502 transitions. [2019-09-08 06:45:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-08 06:45:07,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:45:07,530 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-08 06:45:07,530 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:45:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:45:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1675541906, now seen corresponding path program 1 times [2019-09-08 06:45:07,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:45:07,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:45:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:07,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-08 06:45:07,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:45:07,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:45:07,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:08,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 2053 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:45:08,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:45:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-08 06:45:09,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:45:09,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:45:09,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:45:09,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:45:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:45:09,623 INFO L87 Difference]: Start difference. First operand 205947 states and 363502 transitions. Second operand 6 states. [2019-09-08 06:45:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:45:44,243 INFO L93 Difference]: Finished difference Result 505464 states and 1063864 transitions. [2019-09-08 06:45:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:45:44,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 452 [2019-09-08 06:45:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:45:47,004 INFO L225 Difference]: With dead ends: 505464 [2019-09-08 06:45:47,004 INFO L226 Difference]: Without dead ends: 299546 [2019-09-08 06:45:49,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 455 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:45:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299546 states. [2019-09-08 06:46:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299546 to 299020. [2019-09-08 06:46:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299020 states. [2019-09-08 06:46:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299020 states to 299020 states and 558678 transitions. [2019-09-08 06:46:52,338 INFO L78 Accepts]: Start accepts. Automaton has 299020 states and 558678 transitions. Word has length 452 [2019-09-08 06:46:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:46:52,339 INFO L475 AbstractCegarLoop]: Abstraction has 299020 states and 558678 transitions. [2019-09-08 06:46:52,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:46:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 299020 states and 558678 transitions. [2019-09-08 06:46:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 06:46:53,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:46:53,337 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:46:53,337 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:46:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:46:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash 819231672, now seen corresponding path program 1 times [2019-09-08 06:46:53,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:46:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:46:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:53,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-08 06:46:53,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:46:53,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:46:53,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:53,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:46:53,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:46:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 06:46:55,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:46:55,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:46:55,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:46:55,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:46:55,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:46:55,404 INFO L87 Difference]: Start difference. First operand 299020 states and 558678 transitions. Second operand 5 states. [2019-09-08 06:47:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:47:21,226 INFO L93 Difference]: Finished difference Result 505428 states and 953240 transitions. [2019-09-08 06:47:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:47:21,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-09-08 06:47:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:47:23,191 INFO L225 Difference]: With dead ends: 505428 [2019-09-08 06:47:23,191 INFO L226 Difference]: Without dead ends: 299506 [2019-09-08 06:47:39,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 293 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:47:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299506 states. [2019-09-08 06:48:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299506 to 299016. [2019-09-08 06:48:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299016 states. [2019-09-08 06:48:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299016 states to 299016 states and 531288 transitions. [2019-09-08 06:48:19,812 INFO L78 Accepts]: Start accepts. Automaton has 299016 states and 531288 transitions. Word has length 294 [2019-09-08 06:48:19,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:48:19,813 INFO L475 AbstractCegarLoop]: Abstraction has 299016 states and 531288 transitions. [2019-09-08 06:48:19,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:48:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 299016 states and 531288 transitions. [2019-09-08 06:48:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-09-08 06:48:20,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:48:20,601 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-08 06:48:20,601 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:48:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:48:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 566093044, now seen corresponding path program 1 times [2019-09-08 06:48:20,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:48:20,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:48:20,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:48:20,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:48:20,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:48:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:48:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2019-09-08 06:48:21,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:48:21,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:48:21,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:48:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:48:22,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 2051 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:48:22,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:48:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-08 06:48:22,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:48:22,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 06:48:22,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:48:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:48:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:48:22,511 INFO L87 Difference]: Start difference. First operand 299016 states and 531288 transitions. Second operand 8 states.