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.13.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:50:25,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:50:25,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:50:25,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:50:25,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:50:25,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:50:25,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:50:25,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:50:25,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:50:25,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:50:25,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:50:25,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:50:25,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:50:25,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:50:25,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:50:25,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:50:25,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:50:25,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:50:25,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:50:25,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:50:25,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:50:25,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:50:25,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:50:25,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:50:25,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:50:25,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:50:25,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:50:25,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:50:25,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:50:25,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:50:25,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:50:25,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:50:25,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:50:25,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:50:25,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:50:25,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:50:25,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:50:25,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:50:25,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:50:25,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:50:25,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:50:25,238 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:50:25,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:50:25,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:50:25,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:50:25,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:50:25,270 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:50:25,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:50:25,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:50:25,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:50:25,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:50:25,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:50:25,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:50:25,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:50:25,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:50:25,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:50:25,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:50:25,274 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:50:25,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:50:25,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:50:25,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:50:25,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:50:25,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:50:25,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:50:25,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:50:25,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:50:25,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:50:25,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:50:25,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:50:25,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:50:25,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:50:25,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:50:25,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:50:25,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:50:25,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:50:25,365 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:50:25,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.13.cil-1.c [2019-09-08 06:50:25,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f3a4acf/c5e4119db4814dffbc433911430271f8/FLAG2a55880ed [2019-09-08 06:50:25,946 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:50:25,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.13.cil-1.c [2019-09-08 06:50:25,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f3a4acf/c5e4119db4814dffbc433911430271f8/FLAG2a55880ed [2019-09-08 06:50:26,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f3a4acf/c5e4119db4814dffbc433911430271f8 [2019-09-08 06:50:26,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:50:26,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:50:26,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:50:26,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:50:26,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:50:26,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:50:26" (1/1) ... [2019-09-08 06:50:26,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328a7f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:26, skipping insertion in model container [2019-09-08 06:50:26,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:50:26" (1/1) ... [2019-09-08 06:50:26,302 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:50:26,370 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:50:26,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:50:26,861 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:50:26,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:50:27,030 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:50:27,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27 WrapperNode [2019-09-08 06:50:27,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:50:27,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:50:27,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:50:27,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:50:27,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27" (1/1) ... [2019-09-08 06:50:27,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27" (1/1) ... [2019-09-08 06:50:27,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27" (1/1) ... [2019-09-08 06:50:27,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27" (1/1) ... [2019-09-08 06:50:27,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27" (1/1) ... [2019-09-08 06:50:27,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27" (1/1) ... [2019-09-08 06:50:27,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27" (1/1) ... [2019-09-08 06:50:27,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:50:27,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:50:27,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:50:27,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:50:27,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27" (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:50:27,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:50:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:50:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:50:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:50:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:50:27,206 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:50:27,206 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:50:27,206 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:50:27,206 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:50:27,207 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:50:27,207 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:50:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:50:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:50:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-08 06:50:27,209 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-08 06:50:27,209 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-08 06:50:27,211 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit13 [2019-09-08 06:50:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:50:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:50:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:50:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:50:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:50:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:50:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:50:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:50:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:50:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:50:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-08 06:50:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-08 06:50:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-08 06:50:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit13_triggered [2019-09-08 06:50:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:50:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:50:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:50:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:50:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:50:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:50:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:50:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:50:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:50:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:50:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:50:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:50:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:50:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:50:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:50:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:50:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:50:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:50:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:50:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:50:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:50:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:50:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:50:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-08 06:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-08 06:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-08 06:50:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit13_triggered [2019-09-08 06:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:50:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:50:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:50:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:50:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:50:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:50:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:50:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:50:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:50:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-08 06:50:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-08 06:50:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-08 06:50:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure transmit13 [2019-09-08 06:50:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:50:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:50:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:50:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:50:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:50:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:50:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:50:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:50:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:50:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:50:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:50:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:50:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:50:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:50:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:50:28,723 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:50:28,723 INFO L283 CfgBuilder]: Removed 16 assume(true) statements. [2019-09-08 06:50:28,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:50:28 BoogieIcfgContainer [2019-09-08 06:50:28,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:50:28,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:50:28,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:50:28,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:50:28,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:50:26" (1/3) ... [2019-09-08 06:50:28,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148f7e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:50:28, skipping insertion in model container [2019-09-08 06:50:28,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:27" (2/3) ... [2019-09-08 06:50:28,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148f7e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:50:28, skipping insertion in model container [2019-09-08 06:50:28,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:50:28" (3/3) ... [2019-09-08 06:50:28,734 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-1.c [2019-09-08 06:50:28,744 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:50:28,754 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:50:28,772 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:50:28,814 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:50:28,815 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:50:28,815 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:50:28,815 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:50:28,815 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:50:28,816 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:50:28,816 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:50:28,816 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:50:28,816 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:50:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states. [2019-09-08 06:50:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:28,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:28,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:28,906 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:28,912 INFO L82 PathProgramCache]: Analyzing trace with hash 440076770, now seen corresponding path program 1 times [2019-09-08 06:50:28,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:28,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:28,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:50:29,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:29,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:29,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:29,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:29,503 INFO L87 Difference]: Start difference. First operand 511 states. Second operand 4 states. [2019-09-08 06:50:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:30,023 INFO L93 Difference]: Finished difference Result 1000 states and 1555 transitions. [2019-09-08 06:50:30,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:30,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-08 06:50:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:30,058 INFO L225 Difference]: With dead ends: 1000 [2019-09-08 06:50:30,059 INFO L226 Difference]: Without dead ends: 502 [2019-09-08 06:50:30,080 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:50:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-08 06:50:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2019-09-08 06:50:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 740 transitions. [2019-09-08 06:50:30,231 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 740 transitions. Word has length 246 [2019-09-08 06:50:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:30,232 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 740 transitions. [2019-09-08 06:50:30,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 740 transitions. [2019-09-08 06:50:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:30,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:30,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:30,242 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1104069088, now seen corresponding path program 1 times [2019-09-08 06:50:30,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:30,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:30,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:30,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:30,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:30,523 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:50:30,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:30,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:30,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:30,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:30,532 INFO L87 Difference]: Start difference. First operand 502 states and 740 transitions. Second operand 4 states. [2019-09-08 06:50:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:30,863 INFO L93 Difference]: Finished difference Result 976 states and 1438 transitions. [2019-09-08 06:50:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:30,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-08 06:50:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:30,868 INFO L225 Difference]: With dead ends: 976 [2019-09-08 06:50:30,868 INFO L226 Difference]: Without dead ends: 502 [2019-09-08 06:50:30,871 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:50:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-08 06:50:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2019-09-08 06:50:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 739 transitions. [2019-09-08 06:50:30,899 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 739 transitions. Word has length 246 [2019-09-08 06:50:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:30,900 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 739 transitions. [2019-09-08 06:50:30,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 739 transitions. [2019-09-08 06:50:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:30,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:30,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:30,905 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:30,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1428072482, now seen corresponding path program 1 times [2019-09-08 06:50:30,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:30,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:30,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:30,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:30,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:31,157 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:50:31,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:31,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:31,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:31,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:31,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:31,159 INFO L87 Difference]: Start difference. First operand 502 states and 739 transitions. Second operand 5 states. [2019-09-08 06:50:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:32,302 INFO L93 Difference]: Finished difference Result 1047 states and 1575 transitions. [2019-09-08 06:50:32,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:32,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:32,309 INFO L225 Difference]: With dead ends: 1047 [2019-09-08 06:50:32,309 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 06:50:32,311 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:50:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 06:50:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 502. [2019-09-08 06:50:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 738 transitions. [2019-09-08 06:50:32,346 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 738 transitions. Word has length 246 [2019-09-08 06:50:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:32,346 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 738 transitions. [2019-09-08 06:50:32,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 738 transitions. [2019-09-08 06:50:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:32,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:32,351 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:32,351 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1182264608, now seen corresponding path program 1 times [2019-09-08 06:50:32,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:32,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:32,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:32,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:32,493 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:50:32,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:32,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:32,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:32,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:32,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:32,495 INFO L87 Difference]: Start difference. First operand 502 states and 738 transitions. Second operand 5 states. [2019-09-08 06:50:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:33,659 INFO L93 Difference]: Finished difference Result 1047 states and 1574 transitions. [2019-09-08 06:50:33,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:33,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:33,665 INFO L225 Difference]: With dead ends: 1047 [2019-09-08 06:50:33,665 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 06:50:33,669 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:50:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 06:50:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 502. [2019-09-08 06:50:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 737 transitions. [2019-09-08 06:50:33,720 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 737 transitions. Word has length 246 [2019-09-08 06:50:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:33,721 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 737 transitions. [2019-09-08 06:50:33,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 737 transitions. [2019-09-08 06:50:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:33,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:33,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:33,724 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:33,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1451429986, now seen corresponding path program 1 times [2019-09-08 06:50:33,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:33,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:33,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:33,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:33,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:50:33,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:33,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:33,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:33,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:33,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:33,916 INFO L87 Difference]: Start difference. First operand 502 states and 737 transitions. Second operand 5 states. [2019-09-08 06:50:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:34,848 INFO L93 Difference]: Finished difference Result 1045 states and 1568 transitions. [2019-09-08 06:50:34,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:34,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:34,853 INFO L225 Difference]: With dead ends: 1045 [2019-09-08 06:50:34,853 INFO L226 Difference]: Without dead ends: 574 [2019-09-08 06:50:34,855 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:50:34,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-08 06:50:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 502. [2019-09-08 06:50:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 736 transitions. [2019-09-08 06:50:34,887 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 736 transitions. Word has length 246 [2019-09-08 06:50:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:34,887 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 736 transitions. [2019-09-08 06:50:34,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 736 transitions. [2019-09-08 06:50:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:34,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:34,890 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:34,890 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:34,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1321565408, now seen corresponding path program 1 times [2019-09-08 06:50:34,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:34,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:34,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:35,079 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:50:35,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:35,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:35,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:35,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:35,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:35,081 INFO L87 Difference]: Start difference. First operand 502 states and 736 transitions. Second operand 5 states. [2019-09-08 06:50:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:36,040 INFO L93 Difference]: Finished difference Result 1043 states and 1562 transitions. [2019-09-08 06:50:36,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:36,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:36,046 INFO L225 Difference]: With dead ends: 1043 [2019-09-08 06:50:36,046 INFO L226 Difference]: Without dead ends: 572 [2019-09-08 06:50:36,048 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:50:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-08 06:50:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 502. [2019-09-08 06:50:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 735 transitions. [2019-09-08 06:50:36,086 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 735 transitions. Word has length 246 [2019-09-08 06:50:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:36,086 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 735 transitions. [2019-09-08 06:50:36,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 735 transitions. [2019-09-08 06:50:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:36,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:36,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:36,090 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash 899381086, now seen corresponding path program 1 times [2019-09-08 06:50:36,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:36,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:36,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:36,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:36,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:36,265 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:50:36,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:36,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:36,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:36,268 INFO L87 Difference]: Start difference. First operand 502 states and 735 transitions. Second operand 5 states. [2019-09-08 06:50:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:37,187 INFO L93 Difference]: Finished difference Result 1041 states and 1556 transitions. [2019-09-08 06:50:37,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:37,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:37,192 INFO L225 Difference]: With dead ends: 1041 [2019-09-08 06:50:37,192 INFO L226 Difference]: Without dead ends: 570 [2019-09-08 06:50:37,195 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:50:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-08 06:50:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 502. [2019-09-08 06:50:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 734 transitions. [2019-09-08 06:50:37,228 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 734 transitions. Word has length 246 [2019-09-08 06:50:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:37,229 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 734 transitions. [2019-09-08 06:50:37,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 734 transitions. [2019-09-08 06:50:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:37,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:37,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:37,231 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:37,232 INFO L82 PathProgramCache]: Analyzing trace with hash -414448800, now seen corresponding path program 1 times [2019-09-08 06:50:37,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:37,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:37,452 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:50:37,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:37,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:37,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:37,454 INFO L87 Difference]: Start difference. First operand 502 states and 734 transitions. Second operand 5 states. [2019-09-08 06:50:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:38,627 INFO L93 Difference]: Finished difference Result 1039 states and 1550 transitions. [2019-09-08 06:50:38,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:38,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:38,636 INFO L225 Difference]: With dead ends: 1039 [2019-09-08 06:50:38,638 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 06:50:38,643 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:50:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 06:50:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 502. [2019-09-08 06:50:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 733 transitions. [2019-09-08 06:50:38,681 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 733 transitions. Word has length 246 [2019-09-08 06:50:38,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:38,682 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 733 transitions. [2019-09-08 06:50:38,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 733 transitions. [2019-09-08 06:50:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:38,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:38,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,685 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1288114402, now seen corresponding path program 1 times [2019-09-08 06:50:38,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:38,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:38,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:38,838 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:50:38,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:38,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:38,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:38,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:38,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:38,840 INFO L87 Difference]: Start difference. First operand 502 states and 733 transitions. Second operand 5 states. [2019-09-08 06:50:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:39,839 INFO L93 Difference]: Finished difference Result 1035 states and 1540 transitions. [2019-09-08 06:50:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:39,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:39,844 INFO L225 Difference]: With dead ends: 1035 [2019-09-08 06:50:39,844 INFO L226 Difference]: Without dead ends: 564 [2019-09-08 06:50:39,847 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:50:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-08 06:50:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 502. [2019-09-08 06:50:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 732 transitions. [2019-09-08 06:50:39,878 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 732 transitions. Word has length 246 [2019-09-08 06:50:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:39,879 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 732 transitions. [2019-09-08 06:50:39,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 732 transitions. [2019-09-08 06:50:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:39,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:39,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:39,881 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2142653860, now seen corresponding path program 1 times [2019-09-08 06:50:39,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:39,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:39,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:39,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:39,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:39,999 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:50:40,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:40,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:40,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:40,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:40,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:40,001 INFO L87 Difference]: Start difference. First operand 502 states and 732 transitions. Second operand 5 states. [2019-09-08 06:50:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:41,025 INFO L93 Difference]: Finished difference Result 1033 states and 1534 transitions. [2019-09-08 06:50:41,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:41,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:41,032 INFO L225 Difference]: With dead ends: 1033 [2019-09-08 06:50:41,033 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 06:50:41,035 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:50:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 06:50:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 502. [2019-09-08 06:50:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 731 transitions. [2019-09-08 06:50:41,080 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 731 transitions. Word has length 246 [2019-09-08 06:50:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:41,081 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 731 transitions. [2019-09-08 06:50:41,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 731 transitions. [2019-09-08 06:50:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:41,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:41,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:41,085 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:41,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1016368990, now seen corresponding path program 1 times [2019-09-08 06:50:41,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:41,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:41,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:41,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:41,248 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:50:41,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:41,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:41,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:41,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:41,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:41,251 INFO L87 Difference]: Start difference. First operand 502 states and 731 transitions. Second operand 5 states. [2019-09-08 06:50:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:42,252 INFO L93 Difference]: Finished difference Result 1031 states and 1528 transitions. [2019-09-08 06:50:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:42,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:42,258 INFO L225 Difference]: With dead ends: 1031 [2019-09-08 06:50:42,258 INFO L226 Difference]: Without dead ends: 560 [2019-09-08 06:50:42,260 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:50:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-08 06:50:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 502. [2019-09-08 06:50:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 730 transitions. [2019-09-08 06:50:42,299 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 730 transitions. Word has length 246 [2019-09-08 06:50:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:42,299 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 730 transitions. [2019-09-08 06:50:42,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 730 transitions. [2019-09-08 06:50:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:42,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:42,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:42,303 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:42,304 INFO L82 PathProgramCache]: Analyzing trace with hash 148441628, now seen corresponding path program 1 times [2019-09-08 06:50:42,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:42,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:42,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:42,464 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:50:42,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:42,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:42,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:42,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:42,466 INFO L87 Difference]: Start difference. First operand 502 states and 730 transitions. Second operand 5 states. [2019-09-08 06:50:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:43,844 INFO L93 Difference]: Finished difference Result 1029 states and 1522 transitions. [2019-09-08 06:50:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:43,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:43,850 INFO L225 Difference]: With dead ends: 1029 [2019-09-08 06:50:43,851 INFO L226 Difference]: Without dead ends: 558 [2019-09-08 06:50:43,854 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:50:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-08 06:50:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 502. [2019-09-08 06:50:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 729 transitions. [2019-09-08 06:50:43,910 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 729 transitions. Word has length 246 [2019-09-08 06:50:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:43,910 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 729 transitions. [2019-09-08 06:50:43,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 729 transitions. [2019-09-08 06:50:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:43,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:43,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:43,915 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1126482018, now seen corresponding path program 1 times [2019-09-08 06:50:43,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:43,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:43,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:43,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:43,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:44,093 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:50:44,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:44,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:44,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:44,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:44,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:44,096 INFO L87 Difference]: Start difference. First operand 502 states and 729 transitions. Second operand 5 states. [2019-09-08 06:50:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:45,369 INFO L93 Difference]: Finished difference Result 1027 states and 1516 transitions. [2019-09-08 06:50:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:45,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:45,373 INFO L225 Difference]: With dead ends: 1027 [2019-09-08 06:50:45,373 INFO L226 Difference]: Without dead ends: 556 [2019-09-08 06:50:45,375 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:50:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-08 06:50:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 502. [2019-09-08 06:50:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 728 transitions. [2019-09-08 06:50:45,417 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 728 transitions. Word has length 246 [2019-09-08 06:50:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:45,418 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 728 transitions. [2019-09-08 06:50:45,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 728 transitions. [2019-09-08 06:50:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:45,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:45,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:45,420 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1998892580, now seen corresponding path program 1 times [2019-09-08 06:50:45,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:45,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:45,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:50:45,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:45,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:45,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:45,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:45,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:45,544 INFO L87 Difference]: Start difference. First operand 502 states and 728 transitions. Second operand 5 states. [2019-09-08 06:50:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:46,538 INFO L93 Difference]: Finished difference Result 1025 states and 1510 transitions. [2019-09-08 06:50:46,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:46,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:46,543 INFO L225 Difference]: With dead ends: 1025 [2019-09-08 06:50:46,543 INFO L226 Difference]: Without dead ends: 554 [2019-09-08 06:50:46,545 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:50:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-08 06:50:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 502. [2019-09-08 06:50:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 727 transitions. [2019-09-08 06:50:46,584 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 727 transitions. Word has length 246 [2019-09-08 06:50:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:46,584 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 727 transitions. [2019-09-08 06:50:46,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 727 transitions. [2019-09-08 06:50:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:46,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:46,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:46,587 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:46,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:46,587 INFO L82 PathProgramCache]: Analyzing trace with hash 328269790, now seen corresponding path program 1 times [2019-09-08 06:50:46,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:46,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:46,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:46,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:46,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:46,705 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:50:46,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:46,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:46,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:46,707 INFO L87 Difference]: Start difference. First operand 502 states and 727 transitions. Second operand 5 states. [2019-09-08 06:50:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:47,796 INFO L93 Difference]: Finished difference Result 1023 states and 1504 transitions. [2019-09-08 06:50:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:47,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:47,801 INFO L225 Difference]: With dead ends: 1023 [2019-09-08 06:50:47,802 INFO L226 Difference]: Without dead ends: 552 [2019-09-08 06:50:47,806 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:50:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-08 06:50:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 502. [2019-09-08 06:50:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 726 transitions. [2019-09-08 06:50:47,857 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 726 transitions. Word has length 246 [2019-09-08 06:50:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:47,857 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 726 transitions. [2019-09-08 06:50:47,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 726 transitions. [2019-09-08 06:50:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:47,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:47,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:47,859 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:47,860 INFO L82 PathProgramCache]: Analyzing trace with hash 541886876, now seen corresponding path program 1 times [2019-09-08 06:50:47,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:47,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:47,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:47,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:47,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:47,995 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:50:47,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:47,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:47,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:47,999 INFO L87 Difference]: Start difference. First operand 502 states and 726 transitions. Second operand 5 states. [2019-09-08 06:50:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:49,031 INFO L93 Difference]: Finished difference Result 1067 states and 1587 transitions. [2019-09-08 06:50:49,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:49,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:49,035 INFO L225 Difference]: With dead ends: 1067 [2019-09-08 06:50:49,036 INFO L226 Difference]: Without dead ends: 596 [2019-09-08 06:50:49,037 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:50:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-08 06:50:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 502. [2019-09-08 06:50:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 725 transitions. [2019-09-08 06:50:49,091 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 725 transitions. Word has length 246 [2019-09-08 06:50:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:49,091 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 725 transitions. [2019-09-08 06:50:49,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 725 transitions. [2019-09-08 06:50:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:49,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:49,094 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:49,094 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:49,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1388614950, now seen corresponding path program 1 times [2019-09-08 06:50:49,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:49,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:49,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:49,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:49,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:49,264 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:50:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:49,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:49,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:49,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:49,266 INFO L87 Difference]: Start difference. First operand 502 states and 725 transitions. Second operand 5 states. [2019-09-08 06:50:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:50,242 INFO L93 Difference]: Finished difference Result 1069 states and 1586 transitions. [2019-09-08 06:50:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:50,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:50,246 INFO L225 Difference]: With dead ends: 1069 [2019-09-08 06:50:50,246 INFO L226 Difference]: Without dead ends: 598 [2019-09-08 06:50:50,248 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:50:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-08 06:50:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 502. [2019-09-08 06:50:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 724 transitions. [2019-09-08 06:50:50,300 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 724 transitions. Word has length 246 [2019-09-08 06:50:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:50,301 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 724 transitions. [2019-09-08 06:50:50,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 724 transitions. [2019-09-08 06:50:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:50,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:50,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:50,303 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:50,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1181510108, now seen corresponding path program 1 times [2019-09-08 06:50:50,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:50,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:50,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:50,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:50,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:50,440 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:50:50,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:50,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:50,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:50,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:50,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:50,443 INFO L87 Difference]: Start difference. First operand 502 states and 724 transitions. Second operand 5 states. [2019-09-08 06:50:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:51,446 INFO L93 Difference]: Finished difference Result 1067 states and 1580 transitions. [2019-09-08 06:50:51,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:51,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:51,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:51,451 INFO L225 Difference]: With dead ends: 1067 [2019-09-08 06:50:51,451 INFO L226 Difference]: Without dead ends: 596 [2019-09-08 06:50:51,453 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:50:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-08 06:50:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 502. [2019-09-08 06:50:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 723 transitions. [2019-09-08 06:50:51,521 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 723 transitions. Word has length 246 [2019-09-08 06:50:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:51,522 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 723 transitions. [2019-09-08 06:50:51,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 723 transitions. [2019-09-08 06:50:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:51,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:51,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:51,526 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:51,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:51,527 INFO L82 PathProgramCache]: Analyzing trace with hash -813792614, now seen corresponding path program 1 times [2019-09-08 06:50:51,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:51,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:51,688 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:50:51,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:51,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:51,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:51,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:51,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:51,690 INFO L87 Difference]: Start difference. First operand 502 states and 723 transitions. Second operand 5 states. [2019-09-08 06:50:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:52,695 INFO L93 Difference]: Finished difference Result 1065 states and 1574 transitions. [2019-09-08 06:50:52,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:52,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:52,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:52,700 INFO L225 Difference]: With dead ends: 1065 [2019-09-08 06:50:52,701 INFO L226 Difference]: Without dead ends: 594 [2019-09-08 06:50:52,702 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:50:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-08 06:50:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 502. [2019-09-08 06:50:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 722 transitions. [2019-09-08 06:50:52,748 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 722 transitions. Word has length 246 [2019-09-08 06:50:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:52,748 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 722 transitions. [2019-09-08 06:50:52,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 722 transitions. [2019-09-08 06:50:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:52,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:52,750 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:52,751 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1200052764, now seen corresponding path program 1 times [2019-09-08 06:50:52,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:52,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:52,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:52,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:52,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:52,862 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:50:52,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:52,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:52,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:52,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:52,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:52,864 INFO L87 Difference]: Start difference. First operand 502 states and 722 transitions. Second operand 5 states. [2019-09-08 06:50:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:53,892 INFO L93 Difference]: Finished difference Result 1063 states and 1568 transitions. [2019-09-08 06:50:53,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:53,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:53,898 INFO L225 Difference]: With dead ends: 1063 [2019-09-08 06:50:53,898 INFO L226 Difference]: Without dead ends: 592 [2019-09-08 06:50:53,900 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:50:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-08 06:50:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 502. [2019-09-08 06:50:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 721 transitions. [2019-09-08 06:50:53,969 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 721 transitions. Word has length 246 [2019-09-08 06:50:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:53,969 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 721 transitions. [2019-09-08 06:50:53,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 721 transitions. [2019-09-08 06:50:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:53,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:53,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:53,972 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1126468186, now seen corresponding path program 1 times [2019-09-08 06:50:53,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:53,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:53,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:53,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:53,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:54,087 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:50:54,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:54,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:54,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:54,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:54,089 INFO L87 Difference]: Start difference. First operand 502 states and 721 transitions. Second operand 5 states. [2019-09-08 06:50:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:55,062 INFO L93 Difference]: Finished difference Result 1061 states and 1562 transitions. [2019-09-08 06:50:55,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:55,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:55,067 INFO L225 Difference]: With dead ends: 1061 [2019-09-08 06:50:55,067 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 06:50:55,068 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:50:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 06:50:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 502. [2019-09-08 06:50:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 720 transitions. [2019-09-08 06:50:55,118 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 720 transitions. Word has length 246 [2019-09-08 06:50:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:55,118 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 720 transitions. [2019-09-08 06:50:55,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 720 transitions. [2019-09-08 06:50:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:55,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:55,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:55,121 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash -954115492, now seen corresponding path program 1 times [2019-09-08 06:50:55,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:55,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:55,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:55,239 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:50:55,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:55,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:55,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:55,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:55,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:55,242 INFO L87 Difference]: Start difference. First operand 502 states and 720 transitions. Second operand 5 states. [2019-09-08 06:50:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:56,219 INFO L93 Difference]: Finished difference Result 1059 states and 1556 transitions. [2019-09-08 06:50:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:56,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:56,225 INFO L225 Difference]: With dead ends: 1059 [2019-09-08 06:50:56,225 INFO L226 Difference]: Without dead ends: 588 [2019-09-08 06:50:56,227 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:50:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-09-08 06:50:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 502. [2019-09-08 06:50:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 719 transitions. [2019-09-08 06:50:56,320 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 719 transitions. Word has length 246 [2019-09-08 06:50:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:56,321 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 719 transitions. [2019-09-08 06:50:56,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 719 transitions. [2019-09-08 06:50:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:56,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:56,323 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:56,324 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash -467041766, now seen corresponding path program 1 times [2019-09-08 06:50:56,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:56,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:56,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:56,484 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:50:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:56,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:56,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:56,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:56,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:56,486 INFO L87 Difference]: Start difference. First operand 502 states and 719 transitions. Second operand 5 states. [2019-09-08 06:50:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:57,465 INFO L93 Difference]: Finished difference Result 1055 states and 1546 transitions. [2019-09-08 06:50:57,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:57,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:57,469 INFO L225 Difference]: With dead ends: 1055 [2019-09-08 06:50:57,470 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 06:50:57,471 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:50:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 06:50:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 502. [2019-09-08 06:50:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 718 transitions. [2019-09-08 06:50:57,523 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 718 transitions. Word has length 246 [2019-09-08 06:50:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:57,523 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 718 transitions. [2019-09-08 06:50:57,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 718 transitions. [2019-09-08 06:50:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:57,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:57,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:57,526 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash -940277416, now seen corresponding path program 1 times [2019-09-08 06:50:57,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:57,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:57,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:57,634 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:50:57,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:57,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:57,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:57,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:57,636 INFO L87 Difference]: Start difference. First operand 502 states and 718 transitions. Second operand 5 states. [2019-09-08 06:50:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:58,652 INFO L93 Difference]: Finished difference Result 1053 states and 1540 transitions. [2019-09-08 06:50:58,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:58,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:58,657 INFO L225 Difference]: With dead ends: 1053 [2019-09-08 06:50:58,657 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 06:50:58,658 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:50:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 06:50:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 502. [2019-09-08 06:50:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 717 transitions. [2019-09-08 06:50:58,700 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 717 transitions. Word has length 246 [2019-09-08 06:50:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:58,701 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 717 transitions. [2019-09-08 06:50:58,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 717 transitions. [2019-09-08 06:50:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:58,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:58,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:58,703 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:58,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:58,703 INFO L82 PathProgramCache]: Analyzing trace with hash -816995750, now seen corresponding path program 1 times [2019-09-08 06:50:58,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:58,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:58,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:58,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:58,828 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:50:58,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:58,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:58,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:58,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:58,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:58,830 INFO L87 Difference]: Start difference. First operand 502 states and 717 transitions. Second operand 5 states. [2019-09-08 06:50:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:59,812 INFO L93 Difference]: Finished difference Result 1051 states and 1534 transitions. [2019-09-08 06:50:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:59,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:50:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:59,815 INFO L225 Difference]: With dead ends: 1051 [2019-09-08 06:50:59,815 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 06:50:59,817 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:50:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 06:50:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 502. [2019-09-08 06:50:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:50:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 716 transitions. [2019-09-08 06:50:59,864 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 716 transitions. Word has length 246 [2019-09-08 06:50:59,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:59,865 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 716 transitions. [2019-09-08 06:50:59,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 716 transitions. [2019-09-08 06:50:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:50:59,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:59,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:59,867 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1403738392, now seen corresponding path program 1 times [2019-09-08 06:50:59,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:59,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:59,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:59,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:59,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:59,968 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:50:59,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:59,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:59,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:59,969 INFO L87 Difference]: Start difference. First operand 502 states and 716 transitions. Second operand 5 states. [2019-09-08 06:51:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:01,021 INFO L93 Difference]: Finished difference Result 1049 states and 1528 transitions. [2019-09-08 06:51:01,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:01,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:01,026 INFO L225 Difference]: With dead ends: 1049 [2019-09-08 06:51:01,026 INFO L226 Difference]: Without dead ends: 578 [2019-09-08 06:51:01,028 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:51:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-08 06:51:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 502. [2019-09-08 06:51:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:51:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 715 transitions. [2019-09-08 06:51:01,084 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 715 transitions. Word has length 246 [2019-09-08 06:51:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:01,085 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 715 transitions. [2019-09-08 06:51:01,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 715 transitions. [2019-09-08 06:51:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:01,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:01,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:01,087 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1988308326, now seen corresponding path program 1 times [2019-09-08 06:51:01,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:01,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:01,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:01,254 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:51:01,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:01,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:01,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:01,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:01,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:01,256 INFO L87 Difference]: Start difference. First operand 502 states and 715 transitions. Second operand 5 states. [2019-09-08 06:51:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:02,260 INFO L93 Difference]: Finished difference Result 1047 states and 1522 transitions. [2019-09-08 06:51:02,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:02,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:02,265 INFO L225 Difference]: With dead ends: 1047 [2019-09-08 06:51:02,266 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 06:51:02,267 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:51:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 06:51:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 502. [2019-09-08 06:51:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 06:51:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 714 transitions. [2019-09-08 06:51:02,321 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 714 transitions. Word has length 246 [2019-09-08 06:51:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:02,321 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 714 transitions. [2019-09-08 06:51:02,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 714 transitions. [2019-09-08 06:51:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:02,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:02,323 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:02,323 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2058690776, now seen corresponding path program 1 times [2019-09-08 06:51:02,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:02,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:02,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:02,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:02,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:02,431 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:51:02,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:02,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:02,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:02,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:02,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:02,433 INFO L87 Difference]: Start difference. First operand 502 states and 714 transitions. Second operand 4 states. [2019-09-08 06:51:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:03,055 INFO L93 Difference]: Finished difference Result 1428 states and 2096 transitions. [2019-09-08 06:51:03,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:03,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-08 06:51:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:03,062 INFO L225 Difference]: With dead ends: 1428 [2019-09-08 06:51:03,063 INFO L226 Difference]: Without dead ends: 958 [2019-09-08 06:51:03,065 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:51:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-09-08 06:51:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 957. [2019-09-08 06:51:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-09-08 06:51:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1356 transitions. [2019-09-08 06:51:03,168 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1356 transitions. Word has length 246 [2019-09-08 06:51:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:03,169 INFO L475 AbstractCegarLoop]: Abstraction has 957 states and 1356 transitions. [2019-09-08 06:51:03,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1356 transitions. [2019-09-08 06:51:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-08 06:51:03,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:03,173 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:03,173 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1924086306, now seen corresponding path program 1 times [2019-09-08 06:51:03,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:03,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:03,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:03,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:03,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 06:51:03,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:03,389 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:51:03,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:03,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:03,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:51:04,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:04,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:04,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:04,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:04,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:04,050 INFO L87 Difference]: Start difference. First operand 957 states and 1356 transitions. Second operand 7 states. [2019-09-08 06:51:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:04,503 INFO L93 Difference]: Finished difference Result 2875 states and 4294 transitions. [2019-09-08 06:51:04,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:04,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 411 [2019-09-08 06:51:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:04,517 INFO L225 Difference]: With dead ends: 2875 [2019-09-08 06:51:04,517 INFO L226 Difference]: Without dead ends: 1950 [2019-09-08 06:51:04,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 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:51:04,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-09-08 06:51:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1858. [2019-09-08 06:51:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2019-09-08 06:51:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2691 transitions. [2019-09-08 06:51:04,735 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2691 transitions. Word has length 411 [2019-09-08 06:51:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:04,736 INFO L475 AbstractCegarLoop]: Abstraction has 1858 states and 2691 transitions. [2019-09-08 06:51:04,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2691 transitions. [2019-09-08 06:51:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-08 06:51:04,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:04,743 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:04,743 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1485012124, now seen corresponding path program 1 times [2019-09-08 06:51:04,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:04,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:04,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:04,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:04,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:05,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:05,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:05,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:05,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:05,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:05,016 INFO L87 Difference]: Start difference. First operand 1858 states and 2691 transitions. Second operand 4 states. [2019-09-08 06:51:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:05,535 INFO L93 Difference]: Finished difference Result 3667 states and 5304 transitions. [2019-09-08 06:51:05,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:05,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2019-09-08 06:51:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:05,547 INFO L225 Difference]: With dead ends: 3667 [2019-09-08 06:51:05,548 INFO L226 Difference]: Without dead ends: 1841 [2019-09-08 06:51:05,556 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:51:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2019-09-08 06:51:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1841. [2019-09-08 06:51:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1841 states. [2019-09-08 06:51:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2659 transitions. [2019-09-08 06:51:05,859 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2659 transitions. Word has length 411 [2019-09-08 06:51:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:05,860 INFO L475 AbstractCegarLoop]: Abstraction has 1841 states and 2659 transitions. [2019-09-08 06:51:05,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2659 transitions. [2019-09-08 06:51:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 06:51:05,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:05,866 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:05,868 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash -87606238, now seen corresponding path program 1 times [2019-09-08 06:51:05,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:05,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:05,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 06:51:06,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:06,074 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:51:06,101 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:51:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:06,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:06,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:51:06,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:06,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:51:06,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:06,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:06,581 INFO L87 Difference]: Start difference. First operand 1841 states and 2659 transitions. Second operand 5 states. [2019-09-08 06:51:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:08,496 INFO L93 Difference]: Finished difference Result 7190 states and 11096 transitions. [2019-09-08 06:51:08,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:51:08,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 412 [2019-09-08 06:51:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:08,535 INFO L225 Difference]: With dead ends: 7190 [2019-09-08 06:51:08,535 INFO L226 Difference]: Without dead ends: 5381 [2019-09-08 06:51:08,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 416 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:51:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-09-08 06:51:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 5343. [2019-09-08 06:51:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5343 states. [2019-09-08 06:51:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 7894 transitions. [2019-09-08 06:51:09,172 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 7894 transitions. Word has length 412 [2019-09-08 06:51:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:09,172 INFO L475 AbstractCegarLoop]: Abstraction has 5343 states and 7894 transitions. [2019-09-08 06:51:09,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 7894 transitions. [2019-09-08 06:51:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-09-08 06:51:09,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:09,181 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:09,181 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:09,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1618971074, now seen corresponding path program 1 times [2019-09-08 06:51:09,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:09,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:09,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:09,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:09,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-09-08 06:51:09,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:09,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:09,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:09,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:09,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:09,366 INFO L87 Difference]: Start difference. First operand 5343 states and 7894 transitions. Second operand 4 states. [2019-09-08 06:51:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:10,252 INFO L93 Difference]: Finished difference Result 10638 states and 15713 transitions. [2019-09-08 06:51:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:10,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 443 [2019-09-08 06:51:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:10,292 INFO L225 Difference]: With dead ends: 10638 [2019-09-08 06:51:10,292 INFO L226 Difference]: Without dead ends: 5327 [2019-09-08 06:51:10,315 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:51:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5327 states. [2019-09-08 06:51:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5327 to 5327. [2019-09-08 06:51:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5327 states. [2019-09-08 06:51:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5327 states to 5327 states and 7864 transitions. [2019-09-08 06:51:11,207 INFO L78 Accepts]: Start accepts. Automaton has 5327 states and 7864 transitions. Word has length 443 [2019-09-08 06:51:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:11,207 INFO L475 AbstractCegarLoop]: Abstraction has 5327 states and 7864 transitions. [2019-09-08 06:51:11,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5327 states and 7864 transitions. [2019-09-08 06:51:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 06:51:11,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:11,217 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:11,217 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash -838722339, now seen corresponding path program 1 times [2019-09-08 06:51:11,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:11,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:11,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 06:51:11,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:11,542 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:51:11,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:11,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:11,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 06:51:11,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:11,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:11,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:11,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:11,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:11,999 INFO L87 Difference]: Start difference. First operand 5327 states and 7864 transitions. Second operand 7 states. [2019-09-08 06:51:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:13,322 INFO L93 Difference]: Finished difference Result 16199 states and 25973 transitions. [2019-09-08 06:51:13,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:13,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 413 [2019-09-08 06:51:13,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:13,390 INFO L225 Difference]: With dead ends: 16199 [2019-09-08 06:51:13,390 INFO L226 Difference]: Without dead ends: 10904 [2019-09-08 06:51:13,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 414 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:51:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10904 states. [2019-09-08 06:51:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10904 to 10864. [2019-09-08 06:51:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10864 states. [2019-09-08 06:51:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10864 states to 10864 states and 16903 transitions. [2019-09-08 06:51:15,699 INFO L78 Accepts]: Start accepts. Automaton has 10864 states and 16903 transitions. Word has length 413 [2019-09-08 06:51:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:15,700 INFO L475 AbstractCegarLoop]: Abstraction has 10864 states and 16903 transitions. [2019-09-08 06:51:15,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 10864 states and 16903 transitions. [2019-09-08 06:51:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 06:51:15,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:15,716 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:15,716 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash 671152419, now seen corresponding path program 1 times [2019-09-08 06:51:15,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:15,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:15,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:15,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:15,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:15,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:15,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:15,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:15,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:15,900 INFO L87 Difference]: Start difference. First operand 10864 states and 16903 transitions. Second operand 4 states. [2019-09-08 06:51:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:17,437 INFO L93 Difference]: Finished difference Result 21681 states and 33734 transitions. [2019-09-08 06:51:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:17,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 413 [2019-09-08 06:51:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:17,484 INFO L225 Difference]: With dead ends: 21681 [2019-09-08 06:51:17,484 INFO L226 Difference]: Without dead ends: 10849 [2019-09-08 06:51:17,520 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:51:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10849 states. [2019-09-08 06:51:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10849 to 10849. [2019-09-08 06:51:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2019-09-08 06:51:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 16875 transitions. [2019-09-08 06:51:18,695 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 16875 transitions. Word has length 413 [2019-09-08 06:51:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:18,696 INFO L475 AbstractCegarLoop]: Abstraction has 10849 states and 16875 transitions. [2019-09-08 06:51:18,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 16875 transitions. [2019-09-08 06:51:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-08 06:51:18,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:18,712 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:18,713 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash 864394331, now seen corresponding path program 1 times [2019-09-08 06:51:18,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:18,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:18,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:18,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:18,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 06:51:19,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:19,000 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:51:19,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:19,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 2719 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:19,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:51:19,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:19,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:19,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:19,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:19,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:19,498 INFO L87 Difference]: Start difference. First operand 10849 states and 16875 transitions. Second operand 7 states. [2019-09-08 06:51:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:21,650 INFO L93 Difference]: Finished difference Result 33678 states and 58539 transitions. [2019-09-08 06:51:21,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:21,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 414 [2019-09-08 06:51:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:21,772 INFO L225 Difference]: With dead ends: 33678 [2019-09-08 06:51:21,773 INFO L226 Difference]: Without dead ends: 22861 [2019-09-08 06:51:21,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 415 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:51:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22861 states. [2019-09-08 06:51:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22861 to 22785. [2019-09-08 06:51:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22785 states. [2019-09-08 06:51:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22785 states to 22785 states and 38221 transitions. [2019-09-08 06:51:24,782 INFO L78 Accepts]: Start accepts. Automaton has 22785 states and 38221 transitions. Word has length 414 [2019-09-08 06:51:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:24,783 INFO L475 AbstractCegarLoop]: Abstraction has 22785 states and 38221 transitions. [2019-09-08 06:51:24,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 22785 states and 38221 transitions. [2019-09-08 06:51:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-08 06:51:24,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:24,811 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:24,811 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:24,812 INFO L82 PathProgramCache]: Analyzing trace with hash 77791393, now seen corresponding path program 1 times [2019-09-08 06:51:24,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:24,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:24,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:24,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:24,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:24,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:24,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:24,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:24,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:24,975 INFO L87 Difference]: Start difference. First operand 22785 states and 38221 transitions. Second operand 4 states. [2019-09-08 06:51:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:28,121 INFO L93 Difference]: Finished difference Result 45524 states and 76370 transitions. [2019-09-08 06:51:28,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:28,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 414 [2019-09-08 06:51:28,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:28,240 INFO L225 Difference]: With dead ends: 45524 [2019-09-08 06:51:28,240 INFO L226 Difference]: Without dead ends: 22771 [2019-09-08 06:51:28,327 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:51:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22771 states. [2019-09-08 06:51:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22771 to 22771. [2019-09-08 06:51:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22771 states. [2019-09-08 06:51:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22771 states to 22771 states and 38193 transitions. [2019-09-08 06:51:30,665 INFO L78 Accepts]: Start accepts. Automaton has 22771 states and 38193 transitions. Word has length 414 [2019-09-08 06:51:30,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:30,666 INFO L475 AbstractCegarLoop]: Abstraction has 22771 states and 38193 transitions. [2019-09-08 06:51:30,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 22771 states and 38193 transitions. [2019-09-08 06:51:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-09-08 06:51:30,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:30,689 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:30,689 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:30,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:30,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1390800831, now seen corresponding path program 1 times [2019-09-08 06:51:30,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:30,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:30,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:30,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:30,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 06:51:30,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:30,842 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:30,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:31,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:31,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 06:51:31,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:31,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:31,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:31,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:31,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:31,334 INFO L87 Difference]: Start difference. First operand 22771 states and 38193 transitions. Second operand 7 states. [2019-09-08 06:51:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:36,931 INFO L93 Difference]: Finished difference Result 71592 states and 139863 transitions. [2019-09-08 06:51:36,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:36,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 415 [2019-09-08 06:51:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:37,469 INFO L225 Difference]: With dead ends: 71592 [2019-09-08 06:51:37,469 INFO L226 Difference]: Without dead ends: 48853 [2019-09-08 06:51:38,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 416 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:51:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48853 states. [2019-09-08 06:51:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48853 to 48705. [2019-09-08 06:51:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48705 states. [2019-09-08 06:51:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48705 states to 48705 states and 90635 transitions. [2019-09-08 06:51:45,228 INFO L78 Accepts]: Start accepts. Automaton has 48705 states and 90635 transitions. Word has length 415 [2019-09-08 06:51:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:45,229 INFO L475 AbstractCegarLoop]: Abstraction has 48705 states and 90635 transitions. [2019-09-08 06:51:45,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 48705 states and 90635 transitions. [2019-09-08 06:51:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 06:51:45,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:45,266 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:45,266 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash -480367974, now seen corresponding path program 1 times [2019-09-08 06:51:45,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:45,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:45,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 06:51:45,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:45,694 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) [2019-09-08 06:51:45,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:46,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 2729 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:46,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 06:51:46,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:46,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:46,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:46,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:46,139 INFO L87 Difference]: Start difference. First operand 48705 states and 90635 transitions. Second operand 7 states. [2019-09-08 06:51:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:57,685 INFO L93 Difference]: Finished difference Result 155360 states and 354317 transitions. [2019-09-08 06:51:57,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:57,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 416 [2019-09-08 06:51:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:58,619 INFO L225 Difference]: With dead ends: 155360 [2019-09-08 06:51:58,620 INFO L226 Difference]: Without dead ends: 106687 [2019-09-08 06:51:59,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 417 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:51:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106687 states. [2019-09-08 06:52:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106687 to 106395. [2019-09-08 06:52:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106395 states. [2019-09-08 06:52:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106395 states to 106395 states and 227443 transitions. [2019-09-08 06:52:16,396 INFO L78 Accepts]: Start accepts. Automaton has 106395 states and 227443 transitions. Word has length 416 [2019-09-08 06:52:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:16,396 INFO L475 AbstractCegarLoop]: Abstraction has 106395 states and 227443 transitions. [2019-09-08 06:52:16,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:52:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 106395 states and 227443 transitions. [2019-09-08 06:52:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 06:52:16,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:16,508 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:52:16,508 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:16,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1984038787, now seen corresponding path program 1 times [2019-09-08 06:52:16,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:16,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:16,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:16,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-08 06:52:20,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:52:20,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:52:20,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:52:20,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:52:20,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:52:20,762 INFO L87 Difference]: Start difference. First operand 106395 states and 227443 transitions. Second operand 4 states. [2019-09-08 06:52:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:32,388 INFO L93 Difference]: Finished difference Result 212746 states and 454800 transitions. [2019-09-08 06:52:32,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:52:32,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 416 [2019-09-08 06:52:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:33,228 INFO L225 Difference]: With dead ends: 212746 [2019-09-08 06:52:33,228 INFO L226 Difference]: Without dead ends: 106383 [2019-09-08 06:52:33,905 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:52:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106383 states. [2019-09-08 06:52:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106383 to 106383. [2019-09-08 06:52:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106383 states. [2019-09-08 06:52:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106383 states to 106383 states and 227406 transitions. [2019-09-08 06:52:54,849 INFO L78 Accepts]: Start accepts. Automaton has 106383 states and 227406 transitions. Word has length 416 [2019-09-08 06:52:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:54,849 INFO L475 AbstractCegarLoop]: Abstraction has 106383 states and 227406 transitions. [2019-09-08 06:52:54,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:52:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 106383 states and 227406 transitions. [2019-09-08 06:52:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-08 06:52:54,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:54,951 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:52:54,952 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1690203231, now seen corresponding path program 1 times [2019-09-08 06:52:54,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:54,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:54,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 06:52:55,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:52:55,092 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:52:55,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:55,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 2734 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:52:55,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:52:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:52:56,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:52:56,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:52:56,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:52:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:52:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:52:56,159 INFO L87 Difference]: Start difference. First operand 106383 states and 227406 transitions. Second operand 7 states. [2019-09-08 06:53:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:36,118 INFO L93 Difference]: Finished difference Result 344619 states and 957218 transitions. [2019-09-08 06:53:36,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:53:36,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 417 [2019-09-08 06:53:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:38,572 INFO L225 Difference]: With dead ends: 344619 [2019-09-08 06:53:38,572 INFO L226 Difference]: Without dead ends: 238268 [2019-09-08 06:53:41,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 418 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:53:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238268 states. [2019-09-08 06:54:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238268 to 237688. [2019-09-08 06:54:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237688 states. [2019-09-08 06:54:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237688 states to 237688 states and 607504 transitions. [2019-09-08 06:54:51,663 INFO L78 Accepts]: Start accepts. Automaton has 237688 states and 607504 transitions. Word has length 417 [2019-09-08 06:54:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:51,664 INFO L475 AbstractCegarLoop]: Abstraction has 237688 states and 607504 transitions. [2019-09-08 06:54:51,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:54:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 237688 states and 607504 transitions. [2019-09-08 06:54:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-08 06:54:51,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:51,891 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:51,891 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:51,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1769850698, now seen corresponding path program 1 times [2019-09-08 06:54:51,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:51,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:51,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:51,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:51,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 06:54:52,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:54:52,060 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:54:52,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:52,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 2904 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:54:52,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:54:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:54:52,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:54:52,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:54:52,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:52,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:52,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:52,566 INFO L87 Difference]: Start difference. First operand 237688 states and 607504 transitions. Second operand 5 states.