/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:54:59,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:54:59,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:54:59,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:54:59,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:54:59,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:54:59,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:54:59,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:54:59,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:54:59,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:54:59,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:54:59,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:54:59,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:54:59,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:54:59,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:54:59,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:54:59,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:54:59,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:54:59,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:54:59,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:54:59,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:54:59,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:54:59,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:54:59,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:54:59,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:54:59,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:54:59,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:54:59,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:54:59,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:54:59,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:54:59,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:54:59,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:54:59,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:54:59,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:54:59,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:54:59,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:54:59,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:54:59,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:54:59,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:54:59,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:54:59,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:54:59,223 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 [2020-10-23 18:54:59,251 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:54:59,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:54:59,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:54:59,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:54:59,254 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:54:59,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:54:59,254 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:54:59,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:54:59,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:54:59,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:54:59,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:54:59,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:54:59,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:54:59,256 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:54:59,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:54:59,256 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:54:59,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:54:59,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:54:59,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:54:59,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:54:59,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:54:59,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:54:59,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:54:59,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:54:59,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:54:59,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:54:59,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:54:59,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:54:59,260 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:54:59,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 18:54:59,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:54:59,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:54:59,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:54:59,679 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:54:59,680 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:54:59,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-10-23 18:54:59,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daef80d7e/ce1e274813914262909677ad7e7e61ca/FLAG851aaa2c2 [2020-10-23 18:55:00,565 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:55:00,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-10-23 18:55:00,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daef80d7e/ce1e274813914262909677ad7e7e61ca/FLAG851aaa2c2 [2020-10-23 18:55:00,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daef80d7e/ce1e274813914262909677ad7e7e61ca [2020-10-23 18:55:00,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:55:00,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:55:00,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:55:00,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:55:00,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:55:00,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:55:00" (1/1) ... [2020-10-23 18:55:00,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f89dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:00, skipping insertion in model container [2020-10-23 18:55:00,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:55:00" (1/1) ... [2020-10-23 18:55:00,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:55:00,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:55:01,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:55:01,206 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:55:01,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:55:01,273 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:55:01,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01 WrapperNode [2020-10-23 18:55:01,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:55:01,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:55:01,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:55:01,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:55:01,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01" (1/1) ... [2020-10-23 18:55:01,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01" (1/1) ... [2020-10-23 18:55:01,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01" (1/1) ... [2020-10-23 18:55:01,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01" (1/1) ... [2020-10-23 18:55:01,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01" (1/1) ... [2020-10-23 18:55:01,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01" (1/1) ... [2020-10-23 18:55:01,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01" (1/1) ... [2020-10-23 18:55:01,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:55:01,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:55:01,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:55:01,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:55:01,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01" (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 [2020-10-23 18:55:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:55:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:55:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:55:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-10-23 18:55:01,427 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-10-23 18:55:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-10-23 18:55:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-10-23 18:55:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-10-23 18:55:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-10-23 18:55:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-10-23 18:55:01,429 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-10-23 18:55:01,429 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-10-23 18:55:01,429 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-10-23 18:55:01,429 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-10-23 18:55:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-10-23 18:55:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-10-23 18:55:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-10-23 18:55:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-10-23 18:55:01,430 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-10-23 18:55:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-10-23 18:55:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-10-23 18:55:01,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:55:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:55:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:55:01,431 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:55:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:55:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-10-23 18:55:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-10-23 18:55:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-10-23 18:55:01,432 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-10-23 18:55:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:55:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-10-23 18:55:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-10-23 18:55:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-10-23 18:55:01,433 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-10-23 18:55:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-10-23 18:55:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-10-23 18:55:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-10-23 18:55:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-10-23 18:55:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-10-23 18:55:01,434 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-10-23 18:55:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-10-23 18:55:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-10-23 18:55:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-10-23 18:55:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-10-23 18:55:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:55:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:55:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:55:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:55:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:55:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:55:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:55:02,257 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:55:02,258 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-10-23 18:55:02,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:55:02 BoogieIcfgContainer [2020-10-23 18:55:02,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:55:02,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:55:02,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:55:02,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:55:02,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:55:00" (1/3) ... [2020-10-23 18:55:02,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45748117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:55:02, skipping insertion in model container [2020-10-23 18:55:02,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:55:01" (2/3) ... [2020-10-23 18:55:02,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45748117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:55:02, skipping insertion in model container [2020-10-23 18:55:02,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:55:02" (3/3) ... [2020-10-23 18:55:02,279 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-10-23 18:55:02,295 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:55:02,302 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:55:02,320 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:55:02,373 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:55:02,374 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:55:02,374 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:55:02,374 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:55:02,374 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:55:02,375 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:55:02,375 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:55:02,376 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:55:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2020-10-23 18:55:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-23 18:55:02,420 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:02,421 INFO L422 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] [2020-10-23 18:55:02,422 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:02,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1369809545, now seen corresponding path program 1 times [2020-10-23 18:55:02,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:02,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832998227] [2020-10-23 18:55:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:02,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:02,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:02,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:02,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:02,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:02,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:02,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:03,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:03,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:03,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:55:03,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832998227] [2020-10-23 18:55:03,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:03,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:55:03,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815228185] [2020-10-23 18:55:03,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:55:03,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:03,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:55:03,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:55:03,104 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 8 states. [2020-10-23 18:55:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:05,789 INFO L93 Difference]: Finished difference Result 512 states and 770 transitions. [2020-10-23 18:55:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 18:55:05,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2020-10-23 18:55:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:05,813 INFO L225 Difference]: With dead ends: 512 [2020-10-23 18:55:05,814 INFO L226 Difference]: Without dead ends: 364 [2020-10-23 18:55:05,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-10-23 18:55:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-10-23 18:55:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 245. [2020-10-23 18:55:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-10-23 18:55:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 325 transitions. [2020-10-23 18:55:05,946 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 325 transitions. Word has length 78 [2020-10-23 18:55:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:05,946 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 325 transitions. [2020-10-23 18:55:05,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:55:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 325 transitions. [2020-10-23 18:55:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-23 18:55:05,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:05,951 INFO L422 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] [2020-10-23 18:55:05,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:55:05,952 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash -618365385, now seen corresponding path program 1 times [2020-10-23 18:55:05,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:05,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666449364] [2020-10-23 18:55:05,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:55:06,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666449364] [2020-10-23 18:55:06,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:06,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:55:06,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706823358] [2020-10-23 18:55:06,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:55:06,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:06,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:55:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:55:06,267 INFO L87 Difference]: Start difference. First operand 245 states and 325 transitions. Second operand 9 states. [2020-10-23 18:55:06,652 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-10-23 18:55:08,151 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-10-23 18:55:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:10,230 INFO L93 Difference]: Finished difference Result 921 states and 1299 transitions. [2020-10-23 18:55:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 18:55:10,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-10-23 18:55:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:10,243 INFO L225 Difference]: With dead ends: 921 [2020-10-23 18:55:10,243 INFO L226 Difference]: Without dead ends: 695 [2020-10-23 18:55:10,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:55:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2020-10-23 18:55:10,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 464. [2020-10-23 18:55:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-23 18:55:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 621 transitions. [2020-10-23 18:55:10,391 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 621 transitions. Word has length 78 [2020-10-23 18:55:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:10,393 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 621 transitions. [2020-10-23 18:55:10,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:55:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 621 transitions. [2020-10-23 18:55:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-23 18:55:10,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:10,407 INFO L422 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] [2020-10-23 18:55:10,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:55:10,407 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:10,408 INFO L82 PathProgramCache]: Analyzing trace with hash -577690635, now seen corresponding path program 1 times [2020-10-23 18:55:10,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:10,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157291402] [2020-10-23 18:55:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:55:10,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157291402] [2020-10-23 18:55:10,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:10,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:55:10,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364763288] [2020-10-23 18:55:10,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:55:10,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:10,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:55:10,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:55:10,826 INFO L87 Difference]: Start difference. First operand 464 states and 621 transitions. Second operand 10 states. [2020-10-23 18:55:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:13,026 INFO L93 Difference]: Finished difference Result 1287 states and 1858 transitions. [2020-10-23 18:55:13,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 18:55:13,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-10-23 18:55:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:13,042 INFO L225 Difference]: With dead ends: 1287 [2020-10-23 18:55:13,042 INFO L226 Difference]: Without dead ends: 843 [2020-10-23 18:55:13,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-10-23 18:55:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2020-10-23 18:55:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 566. [2020-10-23 18:55:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2020-10-23 18:55:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 726 transitions. [2020-10-23 18:55:13,204 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 726 transitions. Word has length 78 [2020-10-23 18:55:13,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:13,206 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 726 transitions. [2020-10-23 18:55:13,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:55:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 726 transitions. [2020-10-23 18:55:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-23 18:55:13,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:13,210 INFO L422 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] [2020-10-23 18:55:13,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:55:13,211 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash 871134389, now seen corresponding path program 1 times [2020-10-23 18:55:13,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:13,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336836657] [2020-10-23 18:55:13,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:55:13,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336836657] [2020-10-23 18:55:13,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:13,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:55:13,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384856776] [2020-10-23 18:55:13,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:55:13,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:55:13,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:55:13,520 INFO L87 Difference]: Start difference. First operand 566 states and 726 transitions. Second operand 9 states. [2020-10-23 18:55:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:16,597 INFO L93 Difference]: Finished difference Result 1829 states and 2441 transitions. [2020-10-23 18:55:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 18:55:16,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-10-23 18:55:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:16,609 INFO L225 Difference]: With dead ends: 1829 [2020-10-23 18:55:16,610 INFO L226 Difference]: Without dead ends: 1420 [2020-10-23 18:55:16,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:55:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-10-23 18:55:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1039. [2020-10-23 18:55:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2020-10-23 18:55:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1349 transitions. [2020-10-23 18:55:16,785 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1349 transitions. Word has length 78 [2020-10-23 18:55:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:16,785 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1349 transitions. [2020-10-23 18:55:16,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:55:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1349 transitions. [2020-10-23 18:55:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-23 18:55:16,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:16,787 INFO L422 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] [2020-10-23 18:55:16,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 18:55:16,788 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1747153395, now seen corresponding path program 1 times [2020-10-23 18:55:16,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:16,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221632734] [2020-10-23 18:55:16,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:16,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:55:17,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221632734] [2020-10-23 18:55:17,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:17,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:55:17,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936272729] [2020-10-23 18:55:17,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:55:17,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:17,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:55:17,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:55:17,009 INFO L87 Difference]: Start difference. First operand 1039 states and 1349 transitions. Second operand 10 states. [2020-10-23 18:55:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:18,791 INFO L93 Difference]: Finished difference Result 2346 states and 3129 transitions. [2020-10-23 18:55:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:55:18,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-10-23 18:55:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:18,801 INFO L225 Difference]: With dead ends: 2346 [2020-10-23 18:55:18,801 INFO L226 Difference]: Without dead ends: 1327 [2020-10-23 18:55:18,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-10-23 18:55:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2020-10-23 18:55:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1084. [2020-10-23 18:55:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2020-10-23 18:55:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1387 transitions. [2020-10-23 18:55:18,996 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1387 transitions. Word has length 78 [2020-10-23 18:55:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:18,997 INFO L481 AbstractCegarLoop]: Abstraction has 1084 states and 1387 transitions. [2020-10-23 18:55:18,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:55:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1387 transitions. [2020-10-23 18:55:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-23 18:55:18,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:18,999 INFO L422 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] [2020-10-23 18:55:18,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 18:55:19,000 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2124167179, now seen corresponding path program 1 times [2020-10-23 18:55:19,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:19,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414638842] [2020-10-23 18:55:19,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:55:19,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414638842] [2020-10-23 18:55:19,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:19,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:55:19,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502306088] [2020-10-23 18:55:19,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:55:19,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:55:19,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:55:19,293 INFO L87 Difference]: Start difference. First operand 1084 states and 1387 transitions. Second operand 10 states. [2020-10-23 18:55:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:21,148 INFO L93 Difference]: Finished difference Result 2471 states and 3251 transitions. [2020-10-23 18:55:21,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:55:21,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-10-23 18:55:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:21,159 INFO L225 Difference]: With dead ends: 2471 [2020-10-23 18:55:21,159 INFO L226 Difference]: Without dead ends: 1407 [2020-10-23 18:55:21,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:55:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-10-23 18:55:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1154. [2020-10-23 18:55:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2020-10-23 18:55:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1455 transitions. [2020-10-23 18:55:21,317 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1455 transitions. Word has length 78 [2020-10-23 18:55:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:21,320 INFO L481 AbstractCegarLoop]: Abstraction has 1154 states and 1455 transitions. [2020-10-23 18:55:21,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:55:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1455 transitions. [2020-10-23 18:55:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-23 18:55:21,325 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:21,325 INFO L422 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] [2020-10-23 18:55:21,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 18:55:21,325 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:21,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1849407565, now seen corresponding path program 1 times [2020-10-23 18:55:21,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:21,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169515629] [2020-10-23 18:55:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:55:21,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169515629] [2020-10-23 18:55:21,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:21,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:55:21,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082887588] [2020-10-23 18:55:21,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:55:21,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:21,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:55:21,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:55:21,618 INFO L87 Difference]: Start difference. First operand 1154 states and 1455 transitions. Second operand 10 states. [2020-10-23 18:55:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:24,531 INFO L93 Difference]: Finished difference Result 2482 states and 3209 transitions. [2020-10-23 18:55:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 18:55:24,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-10-23 18:55:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:24,542 INFO L225 Difference]: With dead ends: 2482 [2020-10-23 18:55:24,542 INFO L226 Difference]: Without dead ends: 1349 [2020-10-23 18:55:24,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2020-10-23 18:55:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-10-23 18:55:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1002. [2020-10-23 18:55:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2020-10-23 18:55:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1225 transitions. [2020-10-23 18:55:24,688 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1225 transitions. Word has length 78 [2020-10-23 18:55:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:24,689 INFO L481 AbstractCegarLoop]: Abstraction has 1002 states and 1225 transitions. [2020-10-23 18:55:24,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:55:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1225 transitions. [2020-10-23 18:55:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-23 18:55:24,690 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:24,691 INFO L422 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] [2020-10-23 18:55:24,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 18:55:24,691 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1708858955, now seen corresponding path program 1 times [2020-10-23 18:55:24,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:24,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641121498] [2020-10-23 18:55:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:55:24,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641121498] [2020-10-23 18:55:24,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:24,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 18:55:24,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106255986] [2020-10-23 18:55:24,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:55:24,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:24,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:55:24,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:55:24,865 INFO L87 Difference]: Start difference. First operand 1002 states and 1225 transitions. Second operand 7 states. [2020-10-23 18:55:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:26,807 INFO L93 Difference]: Finished difference Result 2869 states and 3761 transitions. [2020-10-23 18:55:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:55:26,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2020-10-23 18:55:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:26,825 INFO L225 Difference]: With dead ends: 2869 [2020-10-23 18:55:26,826 INFO L226 Difference]: Without dead ends: 1899 [2020-10-23 18:55:26,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:55:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2020-10-23 18:55:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1571. [2020-10-23 18:55:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-10-23 18:55:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 1980 transitions. [2020-10-23 18:55:27,026 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 1980 transitions. Word has length 78 [2020-10-23 18:55:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:27,027 INFO L481 AbstractCegarLoop]: Abstraction has 1571 states and 1980 transitions. [2020-10-23 18:55:27,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:55:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1980 transitions. [2020-10-23 18:55:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-10-23 18:55:27,030 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:27,031 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:55:27,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 18:55:27,031 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:27,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1805037588, now seen corresponding path program 1 times [2020-10-23 18:55:27,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:27,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81594802] [2020-10-23 18:55:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:55:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:55:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-23 18:55:27,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81594802] [2020-10-23 18:55:27,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:27,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:55:27,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067692826] [2020-10-23 18:55:27,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:55:27,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:27,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:55:27,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:55:27,399 INFO L87 Difference]: Start difference. First operand 1571 states and 1980 transitions. Second operand 10 states. [2020-10-23 18:55:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:30,396 INFO L93 Difference]: Finished difference Result 4959 states and 6930 transitions. [2020-10-23 18:55:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 18:55:30,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2020-10-23 18:55:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:30,428 INFO L225 Difference]: With dead ends: 4959 [2020-10-23 18:55:30,428 INFO L226 Difference]: Without dead ends: 3444 [2020-10-23 18:55:30,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2020-10-23 18:55:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2020-10-23 18:55:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 2789. [2020-10-23 18:55:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2020-10-23 18:55:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3693 transitions. [2020-10-23 18:55:30,856 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3693 transitions. Word has length 122 [2020-10-23 18:55:30,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:30,858 INFO L481 AbstractCegarLoop]: Abstraction has 2789 states and 3693 transitions. [2020-10-23 18:55:30,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:55:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3693 transitions. [2020-10-23 18:55:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-10-23 18:55:30,868 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:30,868 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:55:30,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 18:55:30,869 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:30,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1923479062, now seen corresponding path program 1 times [2020-10-23 18:55:30,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:30,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972555552] [2020-10-23 18:55:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:30,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:30,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:30,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:30,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:55:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:55:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-23 18:55:31,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972555552] [2020-10-23 18:55:31,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:31,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:55:31,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754269161] [2020-10-23 18:55:31,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:55:31,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:31,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:55:31,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:55:31,112 INFO L87 Difference]: Start difference. First operand 2789 states and 3693 transitions. Second operand 9 states. [2020-10-23 18:55:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:32,830 INFO L93 Difference]: Finished difference Result 5950 states and 7955 transitions. [2020-10-23 18:55:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 18:55:32,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2020-10-23 18:55:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:32,855 INFO L225 Difference]: With dead ends: 5950 [2020-10-23 18:55:32,856 INFO L226 Difference]: Without dead ends: 3216 [2020-10-23 18:55:32,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:55:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2020-10-23 18:55:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 2749. [2020-10-23 18:55:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2020-10-23 18:55:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 3645 transitions. [2020-10-23 18:55:33,304 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 3645 transitions. Word has length 122 [2020-10-23 18:55:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:33,305 INFO L481 AbstractCegarLoop]: Abstraction has 2749 states and 3645 transitions. [2020-10-23 18:55:33,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:55:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3645 transitions. [2020-10-23 18:55:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-10-23 18:55:33,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:33,310 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:55:33,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 18:55:33,310 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1083119423, now seen corresponding path program 1 times [2020-10-23 18:55:33,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:33,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523012053] [2020-10-23 18:55:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:55:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 18:55:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-23 18:55:33,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523012053] [2020-10-23 18:55:33,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:33,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 18:55:33,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244084788] [2020-10-23 18:55:33,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:55:33,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:55:33,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:55:33,564 INFO L87 Difference]: Start difference. First operand 2749 states and 3645 transitions. Second operand 11 states. [2020-10-23 18:55:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:39,029 INFO L93 Difference]: Finished difference Result 8959 states and 12424 transitions. [2020-10-23 18:55:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-23 18:55:39,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-10-23 18:55:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:39,062 INFO L225 Difference]: With dead ends: 8959 [2020-10-23 18:55:39,062 INFO L226 Difference]: Without dead ends: 4565 [2020-10-23 18:55:39,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=1307, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 18:55:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4565 states. [2020-10-23 18:55:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4565 to 3982. [2020-10-23 18:55:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3982 states. [2020-10-23 18:55:39,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5087 transitions. [2020-10-23 18:55:39,638 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5087 transitions. Word has length 123 [2020-10-23 18:55:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:39,639 INFO L481 AbstractCegarLoop]: Abstraction has 3982 states and 5087 transitions. [2020-10-23 18:55:39,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:55:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5087 transitions. [2020-10-23 18:55:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-10-23 18:55:39,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:39,645 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:55:39,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 18:55:39,645 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash 575771240, now seen corresponding path program 1 times [2020-10-23 18:55:39,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:39,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807903927] [2020-10-23 18:55:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:55:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:55:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-10-23 18:55:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-10-23 18:55:39,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807903927] [2020-10-23 18:55:39,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:55:39,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:55:39,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509653351] [2020-10-23 18:55:39,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:55:39,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:39,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:55:39,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:55:39,942 INFO L87 Difference]: Start difference. First operand 3982 states and 5087 transitions. Second operand 10 states. [2020-10-23 18:55:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:42,870 INFO L93 Difference]: Finished difference Result 9188 states and 12374 transitions. [2020-10-23 18:55:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 18:55:42,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2020-10-23 18:55:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:42,903 INFO L225 Difference]: With dead ends: 9188 [2020-10-23 18:55:42,904 INFO L226 Difference]: Without dead ends: 5253 [2020-10-23 18:55:42,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2020-10-23 18:55:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2020-10-23 18:55:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4770. [2020-10-23 18:55:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4770 states. [2020-10-23 18:55:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 5960 transitions. [2020-10-23 18:55:43,451 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 5960 transitions. Word has length 157 [2020-10-23 18:55:43,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:43,452 INFO L481 AbstractCegarLoop]: Abstraction has 4770 states and 5960 transitions. [2020-10-23 18:55:43,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:55:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 5960 transitions. [2020-10-23 18:55:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-10-23 18:55:43,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:43,460 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-23 18:55:43,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 18:55:43,461 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash 220073049, now seen corresponding path program 1 times [2020-10-23 18:55:43,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:43,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959339496] [2020-10-23 18:55:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:55:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:55:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:55:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-10-23 18:55:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-23 18:55:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-23 18:55:43,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959339496] [2020-10-23 18:55:43,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621096726] [2020-10-23 18:55:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:55:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:44,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:55:44,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:55:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-23 18:55:44,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:55:44,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2020-10-23 18:55:44,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733922201] [2020-10-23 18:55:44,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:55:44,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:44,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:55:44,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:55:44,364 INFO L87 Difference]: Start difference. First operand 4770 states and 5960 transitions. Second operand 3 states. [2020-10-23 18:55:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:44,845 INFO L93 Difference]: Finished difference Result 8445 states and 11070 transitions. [2020-10-23 18:55:44,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:55:44,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-10-23 18:55:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:44,870 INFO L225 Difference]: With dead ends: 8445 [2020-10-23 18:55:44,870 INFO L226 Difference]: Without dead ends: 4594 [2020-10-23 18:55:44,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:55:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2020-10-23 18:55:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4588. [2020-10-23 18:55:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4588 states. [2020-10-23 18:55:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 5615 transitions. [2020-10-23 18:55:45,527 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 5615 transitions. Word has length 176 [2020-10-23 18:55:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:45,528 INFO L481 AbstractCegarLoop]: Abstraction has 4588 states and 5615 transitions. [2020-10-23 18:55:45,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:55:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 5615 transitions. [2020-10-23 18:55:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-23 18:55:45,536 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:45,536 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-23 18:55:45,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-10-23 18:55:45,751 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:45,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:45,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1184187008, now seen corresponding path program 1 times [2020-10-23 18:55:45,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:45,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741099628] [2020-10-23 18:55:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:55:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:45,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:55:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:55:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-10-23 18:55:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-10-23 18:55:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-10-23 18:55:46,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741099628] [2020-10-23 18:55:46,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344690722] [2020-10-23 18:55:46,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:55:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:46,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:55:46,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:55:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-23 18:55:46,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:55:46,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 12 [2020-10-23 18:55:46,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371777099] [2020-10-23 18:55:46,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:55:46,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:55:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:55:46,342 INFO L87 Difference]: Start difference. First operand 4588 states and 5615 transitions. Second operand 3 states. [2020-10-23 18:55:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:46,834 INFO L93 Difference]: Finished difference Result 6450 states and 7957 transitions. [2020-10-23 18:55:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:55:46,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-10-23 18:55:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:46,843 INFO L225 Difference]: With dead ends: 6450 [2020-10-23 18:55:46,843 INFO L226 Difference]: Without dead ends: 1843 [2020-10-23 18:55:46,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:55:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2020-10-23 18:55:47,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1833. [2020-10-23 18:55:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2020-10-23 18:55:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2094 transitions. [2020-10-23 18:55:47,101 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2094 transitions. Word has length 177 [2020-10-23 18:55:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:47,102 INFO L481 AbstractCegarLoop]: Abstraction has 1833 states and 2094 transitions. [2020-10-23 18:55:47,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:55:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2094 transitions. [2020-10-23 18:55:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-23 18:55:47,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:55:47,107 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-23 18:55:47,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-23 18:55:47,322 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:55:47,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:55:47,323 INFO L82 PathProgramCache]: Analyzing trace with hash -655984418, now seen corresponding path program 1 times [2020-10-23 18:55:47,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:55:47,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223487804] [2020-10-23 18:55:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:55:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:55:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:55:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:55:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:55:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:55:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:55:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:55:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:55:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-10-23 18:55:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-10-23 18:55:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-10-23 18:55:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:55:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:55:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:55:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:55:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-10-23 18:55:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-10-23 18:55:47,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223487804] [2020-10-23 18:55:47,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125782450] [2020-10-23 18:55:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:55:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:55:47,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-23 18:55:47,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:55:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-10-23 18:55:48,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:55:48,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-10-23 18:55:48,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945836488] [2020-10-23 18:55:48,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:55:48,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:55:48,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:55:48,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:55:48,149 INFO L87 Difference]: Start difference. First operand 1833 states and 2094 transitions. Second operand 12 states. [2020-10-23 18:55:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:55:50,986 INFO L93 Difference]: Finished difference Result 2140 states and 2449 transitions. [2020-10-23 18:55:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 18:55:50,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 177 [2020-10-23 18:55:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:55:50,988 INFO L225 Difference]: With dead ends: 2140 [2020-10-23 18:55:50,988 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 18:55:51,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-10-23 18:55:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 18:55:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 18:55:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 18:55:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 18:55:51,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2020-10-23 18:55:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:55:51,003 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 18:55:51,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:55:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 18:55:51,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 18:55:51,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-23 18:55:51,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 18:55:51,793 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 46 [2020-10-23 18:55:52,084 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2020-10-23 18:55:52,242 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 37 [2020-10-23 18:55:52,436 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2020-10-23 18:55:52,723 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2020-10-23 18:55:52,878 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 38 [2020-10-23 18:55:53,102 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 103 [2020-10-23 18:55:53,477 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2020-10-23 18:55:53,595 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 114 [2020-10-23 18:55:54,364 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 119 [2020-10-23 18:55:54,530 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 107 [2020-10-23 18:55:55,010 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2020-10-23 18:55:55,114 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2020-10-23 18:55:55,237 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2020-10-23 18:55:55,359 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2020-10-23 18:55:55,784 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 116 [2020-10-23 18:55:56,092 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 107 [2020-10-23 18:55:56,274 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2020-10-23 18:55:56,473 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 108 [2020-10-23 18:55:56,605 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 125 [2020-10-23 18:55:56,793 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 124 [2020-10-23 18:55:57,372 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-10-23 18:55:57,680 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2020-10-23 18:55:58,157 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-23 18:55:59,801 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2020-10-23 18:56:00,324 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 131 [2020-10-23 18:56:01,179 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 125 [2020-10-23 18:56:01,343 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2020-10-23 18:56:04,765 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 119 [2020-10-23 18:56:04,888 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 114 [2020-10-23 18:56:05,125 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2020-10-23 18:56:05,322 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2020-10-23 18:56:05,486 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2020-10-23 18:56:06,205 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 116 [2020-10-23 18:56:06,409 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 108 [2020-10-23 18:56:06,650 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 132 [2020-10-23 18:56:07,282 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2020-10-23 18:56:07,659 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 117 [2020-10-23 18:56:09,063 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 46 [2020-10-23 18:56:10,448 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 119 [2020-10-23 18:56:10,776 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2020-10-23 18:56:11,308 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 116 [2020-10-23 18:56:11,689 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2020-10-23 18:56:11,868 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 108 [2020-10-23 18:56:12,090 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 124 [2020-10-23 18:56:12,700 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2020-10-23 18:56:13,048 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-23 18:56:16,984 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 83 [2020-10-23 18:56:20,039 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 1 [2020-10-23 18:56:20,385 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:56:25,546 WARN L193 SmtUtils]: Spent 5.14 s on a formula simplification. DAG size of input: 481 DAG size of output: 92 [2020-10-23 18:56:25,973 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 44 [2020-10-23 18:56:26,677 WARN L193 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 62 [2020-10-23 18:56:26,905 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2020-10-23 18:56:28,739 WARN L193 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 303 DAG size of output: 75 [2020-10-23 18:56:30,298 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 214 DAG size of output: 60 [2020-10-23 18:56:30,686 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:56:30,814 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 1 [2020-10-23 18:56:31,321 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2020-10-23 18:56:31,924 WARN L193 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2020-10-23 18:56:33,487 WARN L193 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 214 DAG size of output: 60 [2020-10-23 18:56:33,622 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2020-10-23 18:56:39,617 WARN L193 SmtUtils]: Spent 5.98 s on a formula simplification. DAG size of input: 489 DAG size of output: 92 [2020-10-23 18:56:40,715 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2020-10-23 18:56:40,835 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 1 [2020-10-23 18:56:40,968 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2020-10-23 18:56:41,275 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2020-10-23 18:56:41,436 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2020-10-23 18:56:41,636 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-10-23 18:56:43,688 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 213 DAG size of output: 53 [2020-10-23 18:56:44,044 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:56:44,391 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:56:44,500 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 1 [2020-10-23 18:56:44,841 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:56:45,003 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2020-10-23 18:56:45,166 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2020-10-23 18:56:45,409 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2020-10-23 18:56:45,755 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:56:46,099 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:56:47,196 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-10-23 18:56:47,539 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:56:52,790 WARN L193 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 481 DAG size of output: 92 [2020-10-23 18:56:53,455 WARN L193 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 60 [2020-10-23 18:56:56,075 WARN L193 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 264 DAG size of output: 65 [2020-10-23 18:56:56,238 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2020-10-23 18:56:56,519 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2020-10-23 18:56:58,019 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 182 DAG size of output: 75 [2020-10-23 18:56:58,550 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 50 [2020-10-23 18:56:59,456 WARN L193 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2020-10-23 18:56:59,577 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 1 [2020-10-23 18:57:00,194 WARN L193 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2020-10-23 18:57:00,318 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 1 [2020-10-23 18:57:00,664 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:57:00,802 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2020-10-23 18:57:01,152 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-23 18:57:02,606 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 218 DAG size of output: 75 [2020-10-23 18:57:03,435 WARN L193 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 54 [2020-10-23 18:57:03,898 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 55 [2020-10-23 18:57:04,105 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-10-23 18:57:05,637 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 162 DAG size of output: 76 [2020-10-23 18:57:06,260 WARN L193 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 46 [2020-10-23 18:57:07,506 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 225 DAG size of output: 56 [2020-10-23 18:57:08,098 WARN L193 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 54 [2020-10-23 18:57:08,104 INFO L274 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-10-23 18:57:08,105 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 18:57:08,105 INFO L274 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-10-23 18:57:08,105 INFO L274 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-23 18:57:08,106 INFO L270 CegarLoopResult]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse18 (= ~m_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~t1_st~0 0)) (.cse11 (not .cse18)) (.cse14 (<= 2 ~E_M~0)) (.cse3 (= ~t1_i~0 1))) (let ((.cse4 (= ~m_st~0 0)) (.cse5 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (<= ~local~0 |old(~token~0)|))) (.cse20 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse22 (= |old(~token~0)| ~token~0)) (.cse7 (= |old(~t1_pc~0)| 1)) (.cse8 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not .cse3)) (.cse19 (and .cse6 (or (and .cse17 .cse11 .cse15 .cse14) (and .cse16 .cse11 .cse14)))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0)))) (and (let ((.cse0 (or (and .cse14 .cse15) (and .cse16 .cse14))) (.cse1 (= ~t1_pc~0 1))) (or (let ((.cse2 (+ |old(~token~0)| 1))) (and .cse0 .cse1 (<= .cse2 ~token~0) (<= ~token~0 .cse2) .cse3 .cse4)) .cse5 (and .cse6 .cse0 .cse1 .cse3) (not .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or (not (= ~M_E~0 2)) .cse8 .cse10 (and .cse17 .cse15) .cse18 (not (= ~E_1~0 ~M_E~0)) .cse12) (or .cse8 .cse10 .cse18 .cse19 .cse12) (or (and .cse4 .cse20 .cse15 .cse21 .cse22) .cse5 (not (= |old(~m_st~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse18 .cse13) (or (and .cse17 .cse20 .cse15 .cse21 .cse22) .cse7 .cse8 .cse10 .cse19 .cse12 .cse13))))) [2020-10-23 18:57:08,106 INFO L274 CegarLoopResult]: For program point L83(lines 83 87) no Hoare annotation was computed. [2020-10-23 18:57:08,106 INFO L270 CegarLoopResult]: At program point transmit1ENTRY(lines 76 111) the Hoare annotation is: (let ((.cse7 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (= |old(~token~0)| ~token~0))) (let ((.cse1 (= |old(~t1_pc~0)| 1)) (.cse6 (not (<= |old(~token~0)| ~local~0))) (.cse11 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (<= 2 ~E_1~0))) (.cse0 (and (= ~m_st~0 |old(~m_st~0)|) .cse7 .cse8 .cse9 .cse10)) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse12 (= ~m_pc~0 1)) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 (and (= ~m_st~0 0) .cse7 .cse8 .cse9 .cse10) (not (= |old(~m_st~0)| 0)) .cse1 .cse2 .cse11 .cse3 .cse12 .cse5) (or .cse6 .cse0 .cse2 .cse11 .cse3 .cse4 .cse5) (or .cse0 .cse2 .cse3 .cse12 .cse4)))) [2020-10-23 18:57:08,106 INFO L274 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-10-23 18:57:08,107 INFO L270 CegarLoopResult]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse1 (= |old(~t1_pc~0)| 1)) (.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse3 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (not (<= 2 ~E_1~0))) (.cse8 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (not (= |old(~m_st~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse4 .cse7 .cse6) (or .cse0 .cse8 .cse2 .cse3 .cse4 .cse7 .cse6) (or .cse8 .cse2 .cse4 .cse5 .cse7))) [2020-10-23 18:57:08,107 INFO L274 CegarLoopResult]: For program point transmit1EXIT(lines 76 111) no Hoare annotation was computed. [2020-10-23 18:57:08,107 INFO L270 CegarLoopResult]: At program point L105(lines 76 111) the Hoare annotation is: (let ((.cse10 (<= 2 ~m_st~0)) (.cse13 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_M~0))) (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse5 (= ~m_st~0 0)) (.cse8 (not (<= ~local~0 |old(~token~0)|))) (.cse0 (and .cse10 (not .cse13) .cse6)) (.cse15 (= |old(~t1_pc~0)| 1)) (.cse7 (not (<= 2 |old(~E_M~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (let ((.cse4 (+ |old(~token~0)| 1))) (and .cse2 .cse3 (<= .cse4 ~token~0) (<= ~token~0 .cse4) .cse5 .cse6)) .cse7 .cse8 .cse9 (and .cse2 .cse10 .cse3 .cse6) .cse11 .cse12) (or .cse0 .cse7 .cse9 .cse13 .cse11) (or .cse1 (not (= |old(~m_st~0)| 0)) (and .cse2 .cse3 .cse5 .cse14 (= |old(~token~0)| ~token~0)) .cse15 .cse7 .cse8 .cse9 .cse13 .cse12) (or .cse0 .cse15 .cse7 .cse9 .cse11 (and .cse2 .cse10 .cse3 .cse14) .cse12)))) [2020-10-23 18:57:08,107 INFO L270 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse10 (= |old(~t1_pc~0)| 1)) (.cse9 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (not (= ~E_M~0 0))) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse11 (= ~m_pc~0 1)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (let ((.cse3 (+ |old(~token~0)| 1))) (and .cse1 (= ~t1_pc~0 1) .cse2 (<= .cse3 ~token~0) (<= ~token~0 .cse3) .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 (not (= |old(~m_st~0)| 0)) .cse10 .cse5 .cse6 .cse7 .cse11 .cse9) (or .cse10 .cse5 .cse7 .cse8 .cse9) (or (and .cse1 .cse2 .cse4) .cse5 .cse7 .cse11 .cse8))) [2020-10-23 18:57:08,108 INFO L274 CegarLoopResult]: For program point L101-1(line 101) no Hoare annotation was computed. [2020-10-23 18:57:08,108 INFO L274 CegarLoopResult]: For program point immediate_notifyEXIT(lines 328 338) no Hoare annotation was computed. [2020-10-23 18:57:08,108 INFO L270 CegarLoopResult]: At program point immediate_notifyENTRY(lines 328 338) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= ~t1_pc~0 1))) (let ((.cse5 (not (<= 2 ~E_M~0))) (.cse7 (= |old(~m_st~0)| 0)) (.cse3 (= ~m_pc~0 1)) (.cse6 (not .cse8)) (.cse0 (= ~E_M~0 0)) (.cse2 (not (= ~t1_i~0 1))) (.cse1 (and .cse9 (= |old(~t1_st~0)| ~t1_st~0))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (not (<= 2 |old(~t1_st~0)|)) (not (<= ~token~0 ~local~0)) .cse7 .cse2 .cse1 (not (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) .cse5 .cse8 .cse7 .cse2 .cse3 (and .cse9 (= ~t1_st~0 0))) (let ((.cse10 (+ ~local~0 1))) (or .cse6 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse0 .cse2 .cse1 .cse4 (not (<= 2 ~E_1~0))))))) [2020-10-23 18:57:08,108 INFO L274 CegarLoopResult]: For program point immediate_notifyFINAL(lines 328 338) no Hoare annotation was computed. [2020-10-23 18:57:08,108 INFO L274 CegarLoopResult]: For program point L319(lines 319 323) no Hoare annotation was computed. [2020-10-23 18:57:08,108 INFO L274 CegarLoopResult]: For program point L317(line 317) no Hoare annotation was computed. [2020-10-23 18:57:08,108 INFO L274 CegarLoopResult]: For program point L319-2(lines 303 327) no Hoare annotation was computed. [2020-10-23 18:57:08,108 INFO L274 CegarLoopResult]: For program point L311(lines 311 315) no Hoare annotation was computed. [2020-10-23 18:57:08,109 INFO L270 CegarLoopResult]: At program point L309(line 309) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse9 (= |old(~m_st~0)| 0)) (.cse22 (+ ~local~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= ~t1_st~0 0))) (let ((.cse8 (not (<= ~token~0 ~local~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse3 (= ~m_pc~0 1)) (.cse18 (and .cse23 .cse16)) (.cse0 (= ~E_M~0 0)) (.cse1 (and .cse23 .cse21)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not .cse15)) (.cse19 (not (<= ~token~0 .cse22))) (.cse11 (not .cse9)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (not (<= .cse22 ~token~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse12 (and .cse17 .cse21)) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse2 .cse1 .cse10) (or .cse5 .cse6 .cse11 .cse7 .cse8 .cse2 .cse12 .cse3 .cse10 .cse13) (or .cse14 .cse5 .cse15 .cse11 .cse8 (and .cse16 .cse17) .cse2 .cse3 .cse10 .cse13) (or .cse14 .cse5 .cse15 .cse2 .cse18 .cse4 .cse13) (or .cse14 .cse5 .cse8 .cse2 .cse18 .cse10 .cse4 .cse13) (or .cse14 .cse5 .cse15 .cse9 .cse2 .cse3 .cse18) (or .cse6 .cse19 .cse20 .cse0 .cse2 .cse1 .cse4 .cse13) (or .cse5 .cse6 .cse7 .cse2 .cse1 .cse4 .cse13) (or .cse5 .cse6 .cse19 .cse11 .cse7 .cse20 .cse2 .cse12 .cse13)))) [2020-10-23 18:57:08,109 INFO L270 CegarLoopResult]: At program point L311-2(lines 311 315) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= activate_threads_~tmp~1 0)) (.cse19 (< 0 (+ activate_threads_~tmp~1 1))) (.cse6 (= ~m_st~0 0)) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= |old(~m_st~0)| 0)) (.cse24 (+ ~local~0 1))) (let ((.cse1 (not (<= ~token~0 .cse24))) (.cse2 (not (<= .cse24 ~token~0))) (.cse13 (not .cse21)) (.cse17 (and .cse18 .cse19 .cse6 .cse7)) (.cse3 (= ~E_M~0 0)) (.cse5 (and .cse23 .cse7)) (.cse15 (= ~m_pc~0 1)) (.cse0 (not .cse12)) (.cse20 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse11 (not (<= 2 ~E_M~0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse22 (and .cse23 .cse18 .cse19 .cse7)) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse4 .cse15 .cse16 .cse9 .cse17) (or .cse11 .cse4 .cse15 (and .cse18 .cse19) .cse8) (or .cse11 .cse0 .cse1 .cse13 .cse20 .cse2 .cse4 .cse9 .cse17) (or .cse10 .cse11 .cse12 .cse21 .cse4 .cse15 .cse22) (or .cse11 .cse0 .cse20 .cse14 .cse21 .cse4 .cse16 .cse22) (or .cse11 .cse0 .cse13 .cse20 .cse14 .cse4 .cse15 .cse16 .cse9 .cse17) (or .cse10 .cse11 .cse12 .cse4 .cse8 .cse22 .cse9) (or .cse3 .cse4 .cse5 .cse15 .cse8) (or .cse11 .cse0 .cse20 .cse4 .cse8 .cse22 .cse9) (or .cse10 .cse11 .cse14 .cse4 .cse16 .cse8 .cse22 .cse9)))) [2020-10-23 18:57:08,109 INFO L274 CegarLoopResult]: For program point L309-1(line 309) no Hoare annotation was computed. [2020-10-23 18:57:08,109 INFO L270 CegarLoopResult]: At program point activate_threadsENTRY(lines 303 327) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse9 (= |old(~m_st~0)| 0)) (.cse22 (+ ~local~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= ~t1_st~0 0))) (let ((.cse8 (not (<= ~token~0 ~local~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse3 (= ~m_pc~0 1)) (.cse18 (and .cse23 .cse16)) (.cse0 (= ~E_M~0 0)) (.cse1 (and .cse23 .cse21)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not .cse15)) (.cse19 (not (<= ~token~0 .cse22))) (.cse11 (not .cse9)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (not (<= .cse22 ~token~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse12 (and .cse17 .cse21)) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse2 .cse1 .cse10) (or .cse5 .cse6 .cse11 .cse7 .cse8 .cse2 .cse12 .cse3 .cse10 .cse13) (or .cse14 .cse5 .cse15 .cse11 .cse8 (and .cse16 .cse17) .cse2 .cse3 .cse10 .cse13) (or .cse14 .cse5 .cse15 .cse2 .cse18 .cse4 .cse13) (or .cse14 .cse5 .cse8 .cse2 .cse18 .cse10 .cse4 .cse13) (or .cse14 .cse5 .cse15 .cse9 .cse2 .cse3 .cse18) (or .cse6 .cse19 .cse20 .cse0 .cse2 .cse1 .cse4 .cse13) (or .cse5 .cse6 .cse7 .cse2 .cse1 .cse4 .cse13) (or .cse5 .cse6 .cse19 .cse11 .cse7 .cse20 .cse2 .cse12 .cse13)))) [2020-10-23 18:57:08,109 INFO L274 CegarLoopResult]: For program point activate_threadsEXIT(lines 303 327) no Hoare annotation was computed. [2020-10-23 18:57:08,109 INFO L277 CegarLoopResult]: At program point L192(lines 179 194) the Hoare annotation is: true [2020-10-23 18:57:08,109 INFO L274 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 176 195) no Hoare annotation was computed. [2020-10-23 18:57:08,110 INFO L274 CegarLoopResult]: For program point L184(lines 184 189) no Hoare annotation was computed. [2020-10-23 18:57:08,110 INFO L277 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 176 195) the Hoare annotation is: true [2020-10-23 18:57:08,110 INFO L274 CegarLoopResult]: For program point L180(lines 180 190) no Hoare annotation was computed. [2020-10-23 18:57:08,110 INFO L274 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 176 195) no Hoare annotation was computed. [2020-10-23 18:57:08,110 INFO L274 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 131 149) no Hoare annotation was computed. [2020-10-23 18:57:08,110 INFO L277 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 131 149) the Hoare annotation is: true [2020-10-23 18:57:08,110 INFO L274 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 131 149) no Hoare annotation was computed. [2020-10-23 18:57:08,110 INFO L270 CegarLoopResult]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse14 (= ~m_st~0 0)) (.cse8 (= ~t1_pc~0 1))) (let ((.cse3 (= ~E_M~0 0)) (.cse0 (not (<= 2 ~m_st~0))) (.cse10 (not (= ~t1_st~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse1 (not .cse8)) (.cse2 (and (<= 0 is_transmit1_triggered_~__retres1~1) (<= is_transmit1_triggered_~__retres1~1 0))) (.cse9 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse6 (= ~m_pc~0 1)) (.cse13 (not .cse14)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 (not (= ~M_E~0 2)) .cse2 .cse3 .cse4 .cse6 (not (= ~E_1~0 ~M_E~0))) (or .cse7 .cse8 .cse2 .cse9 .cse4 .cse6 .cse10 .cse11 .cse5) (let ((.cse12 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse12)) .cse2 (not (<= .cse12 ~token~0)) .cse3 .cse4 .cse13 .cse5)) (or .cse7 .cse0 .cse2 .cse4 .cse10 .cse5) (or .cse7 .cse8 .cse2 .cse4 .cse6 .cse10 .cse14) (or .cse7 .cse1 .cse2 .cse9 .cse4 .cse6 (not (<= 2 ~t1_st~0)) .cse13 .cse11 .cse5)))) [2020-10-23 18:57:08,110 INFO L274 CegarLoopResult]: For program point L136(lines 136 141) no Hoare annotation was computed. [2020-10-23 18:57:08,110 INFO L274 CegarLoopResult]: For program point L135(lines 135 144) no Hoare annotation was computed. [2020-10-23 18:57:08,111 INFO L274 CegarLoopResult]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2020-10-23 18:57:08,111 INFO L274 CegarLoopResult]: For program point L289-1(lines 278 301) no Hoare annotation was computed. [2020-10-23 18:57:08,111 INFO L274 CegarLoopResult]: For program point L284-1(lines 278 301) no Hoare annotation was computed. [2020-10-23 18:57:08,111 INFO L274 CegarLoopResult]: For program point L279-1(lines 278 301) no Hoare annotation was computed. [2020-10-23 18:57:08,111 INFO L270 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 275 302) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse4 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse11 (not .cse5)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse6 .cse7 .cse2 .cse3 .cse8 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse11 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) .cse7 .cse2 .cse3 .cse13 .cse9)) (or .cse0 .cse1 .cse5 .cse7 .cse2 .cse3 .cse8) (or .cse0 .cse11 .cse6 .cse7 .cse2 .cse3 .cse4 .cse13 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse7 .cse2 .cse3 .cse13)))) [2020-10-23 18:57:08,111 INFO L274 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 275 302) no Hoare annotation was computed. [2020-10-23 18:57:08,111 INFO L274 CegarLoopResult]: For program point L294-1(lines 275 302) no Hoare annotation was computed. [2020-10-23 18:57:08,112 INFO L274 CegarLoopResult]: For program point L162-1(lines 161 174) no Hoare annotation was computed. [2020-10-23 18:57:08,112 INFO L274 CegarLoopResult]: For program point init_threadsEXIT(lines 158 175) no Hoare annotation was computed. [2020-10-23 18:57:08,112 INFO L270 CegarLoopResult]: At program point init_threadsENTRY(lines 158 175) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (<= 2 ~E_M~0)) (not (= ~M_E~0 2)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (not (<= ~token~0 ~local~0)) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (= ~T1_E~0 ~M_E~0)) (not (= ~E_1~0 ~M_E~0)) (not (<= ~local~0 ~token~0))) [2020-10-23 18:57:08,112 INFO L274 CegarLoopResult]: For program point L167-1(lines 158 175) no Hoare annotation was computed. [2020-10-23 18:57:08,112 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 464 475) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (and (= ~E_1~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (= |old(~t1_i~0)| 1)) [2020-10-23 18:57:08,112 INFO L274 CegarLoopResult]: For program point mainFINAL(lines 464 475) no Hoare annotation was computed. [2020-10-23 18:57:08,113 INFO L274 CegarLoopResult]: For program point mainEXIT(lines 464 475) no Hoare annotation was computed. [2020-10-23 18:57:08,113 INFO L274 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2020-10-23 18:57:08,113 INFO L270 CegarLoopResult]: At program point L469(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (and (= ~E_1~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (= |old(~t1_i~0)| 1)) [2020-10-23 18:57:08,113 INFO L270 CegarLoopResult]: At program point L469-1(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (= |old(~t1_i~0)| 1)) [2020-10-23 18:57:08,113 INFO L274 CegarLoopResult]: For program point errorEXIT(lines 8 15) no Hoare annotation was computed. [2020-10-23 18:57:08,113 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-10-23 18:57:08,113 INFO L277 CegarLoopResult]: At program point errorENTRY(lines 8 15) the Hoare annotation is: true [2020-10-23 18:57:08,114 INFO L274 CegarLoopResult]: For program point errorFINAL(lines 8 15) no Hoare annotation was computed. [2020-10-23 18:57:08,114 INFO L274 CegarLoopResult]: For program point masterEXIT(lines 32 75) no Hoare annotation was computed. [2020-10-23 18:57:08,114 INFO L274 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2020-10-23 18:57:08,114 INFO L270 CegarLoopResult]: At program point L40(lines 35 74) the Hoare annotation is: (let ((.cse11 (+ |old(~local~0)| 1)) (.cse10 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse10)) (.cse3 (not (<= |old(~token~0)| .cse11))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (<= .cse11 |old(~token~0)|))) (.cse0 (not (<= 2 ~E_M~0))) (.cse2 (= |old(~m_pc~0)| 1)) (.cse5 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse4 (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse9 (+ ~local~0 1))) (and (<= .cse9 ~token~0) (<= ~token~0 .cse9) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) .cse8) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse10 .cse2 .cse5 .cse6 .cse7)))) [2020-10-23 18:57:08,115 INFO L270 CegarLoopResult]: At program point L69(lines 32 75) the Hoare annotation is: (let ((.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (<= 2 ~E_1~0)) (.cse14 (= ~t1_i~0 1)) (.cse1 (= ~t1_pc~0 1))) (let ((.cse2 (= |old(~m_pc~0)| 1)) (.cse0 (not (<= 2 ~E_M~0))) (.cse9 (not .cse1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not .cse14)) (.cse11 (and .cse6 .cse1 (= ~t1_st~0 0) (<= ~token~0 ~local~0) .cse14 .cse7 (<= ~local~0 ~token~0))) (.cse12 (and (<= 2 ~t1_st~0) .cse6 .cse1 .cse14 .cse7 .cse8))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8)) (or .cse0 .cse9 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse10 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 .cse5 .cse11 .cse12) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse0 .cse9 (not (<= |old(~token~0)| .cse13)) .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 (not (<= .cse13 |old(~token~0)|))))))) [2020-10-23 18:57:08,115 INFO L270 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse8 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse8)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (not (<= 2 ~E_M~0))) (.cse7 (= |old(~m_pc~0)| 1)) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 .cse4 .cse5 .cse6 (not (<= .cse2 |old(~token~0)|)))) (or .cse0 .cse1 .cse7 (not (<= |old(~local~0)| |old(~token~0)|)) .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 .cse6) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse8 .cse7 .cse4 .cse5 .cse6)))) [2020-10-23 18:57:08,115 INFO L270 CegarLoopResult]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (<= 2 ~E_M~0))) (.cse10 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse7 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~token~0)| ~token~0))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~local~0 |old(~local~0)|) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8) .cse9) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 .cse10 (not (<= |old(~token~0)| .cse11)) .cse12 .cse3 .cse4 .cse9 (let ((.cse13 (+ ~local~0 1))) (and (<= .cse13 ~token~0) (<= ~token~0 .cse13) .cse5 .cse6 .cse7 .cse14 .cse8)) (not (<= .cse11 |old(~token~0)|)))) (or .cse0 .cse10 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse12 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 .cse9 (and .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse14 .cse8))))) [2020-10-23 18:57:08,115 INFO L270 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (let ((.cse16 (+ |old(~local~0)| 1)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= ~t1_pc~0 1)) (.cse13 (<= ~token~0 ~local~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse17 (= ~t1_i~0 1)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse4 (= |old(~m_pc~0)| 1)) (.cse11 (and (<= 2 ~t1_st~0) .cse1 .cse3 .cse13 .cse2 .cse17 .cse14 (not (= ~m_st~0 0)) .cse15)) (.cse0 (not (<= 2 ~E_M~0))) (.cse8 (not .cse3)) (.cse9 (not (<= |old(~token~0)| .cse16))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse17)) (.cse12 (not (<= .cse16 |old(~token~0)|)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse1 (= ~t1_st~0 0) .cse2) .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse4 .cse9 .cse10 .cse11 .cse5 .cse6 .cse7 .cse12) (or .cse0 .cse8 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse10 (not (<= |old(~token~0)| |old(~local~0)|)) .cse11 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse10 (and .cse1 .cse13 .cse14 .cse15) .cse5 .cse6 .cse7 .cse12)))) [2020-10-23 18:57:08,116 INFO L274 CegarLoopResult]: For program point L53-1(line 53) no Hoare annotation was computed. [2020-10-23 18:57:08,116 INFO L270 CegarLoopResult]: At program point masterENTRY(lines 32 75) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (<= 2 ~E_M~0))) (.cse10 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse7 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~token~0)| ~token~0))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~local~0 |old(~local~0)|) .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8) .cse9) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 .cse10 (not (<= |old(~token~0)| .cse11)) .cse12 .cse3 .cse4 .cse9 (let ((.cse13 (+ ~local~0 1))) (and (<= .cse13 ~token~0) (<= ~token~0 .cse13) .cse5 .cse6 .cse7 .cse14 .cse8)) (not (<= .cse11 |old(~token~0)|)))) (or .cse0 .cse10 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse12 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 .cse9 (and .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse14 .cse8))))) [2020-10-23 18:57:08,116 INFO L274 CegarLoopResult]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-10-23 18:57:08,116 INFO L274 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 339 347) no Hoare annotation was computed. [2020-10-23 18:57:08,116 INFO L270 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 339 347) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse13)) (.cse4 (not (<= 2 ~t1_st~0))) (.cse8 (not (<= ~token~0 ~local~0))) (.cse7 (= ~m_pc~0 1)) (.cse10 (not (<= ~local~0 ~token~0))) (.cse12 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (not (= ~t1_st~0 0))) (.cse5 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse7 .cse5) (or .cse0 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10 .cse6) (let ((.cse11 (+ ~local~0 1))) (or .cse0 .cse2 (not (<= ~token~0 .cse11)) (not (<= .cse11 ~token~0)) .cse3 .cse4 .cse5 .cse12 .cse6)) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse7 .cse5 .cse10 .cse12 .cse6) (or .cse0 .cse13 .cse8 .cse3 .cse7 .cse5 .cse9 .cse10 .cse12 .cse6) (or .cse0 .cse1 .cse13 .cse3 .cse9 .cse5 .cse6)))) [2020-10-23 18:57:08,117 INFO L274 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 339 347) no Hoare annotation was computed. [2020-10-23 18:57:08,117 INFO L274 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-10-23 18:57:08,117 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |old(#valid)| |#valid|) (= ~E_M~0 |old(~E_M~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~m_i~0 |old(~m_i~0)|)) [2020-10-23 18:57:08,117 INFO L274 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-10-23 18:57:08,117 INFO L277 CegarLoopResult]: At program point L401(lines 390 403) the Hoare annotation is: true [2020-10-23 18:57:08,117 INFO L274 CegarLoopResult]: For program point L394(lines 394 399) no Hoare annotation was computed. [2020-10-23 18:57:08,117 INFO L277 CegarLoopResult]: At program point L392(line 392) the Hoare annotation is: true [2020-10-23 18:57:08,117 INFO L274 CegarLoopResult]: For program point L392-1(line 392) no Hoare annotation was computed. [2020-10-23 18:57:08,118 INFO L274 CegarLoopResult]: For program point stop_simulationEXIT(lines 386 404) no Hoare annotation was computed. [2020-10-23 18:57:08,118 INFO L277 CegarLoopResult]: At program point stop_simulationENTRY(lines 386 404) the Hoare annotation is: true [2020-10-23 18:57:08,118 INFO L274 CegarLoopResult]: For program point stop_simulationFINAL(lines 386 404) no Hoare annotation was computed. [2020-10-23 18:57:08,118 INFO L270 CegarLoopResult]: At program point evalENTRY(lines 196 246) the Hoare annotation is: (let ((.cse26 (= ~local~0 |old(~local~0)|)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse7 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse22 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse25 (= |old(~t1_pc~0)| 1))) (let ((.cse16 (not .cse25)) (.cse19 (not (<= 2 |old(~t1_st~0)|))) (.cse17 (not (= |old(~m_st~0)| 0))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse5 (<= ~token~0 ~local~0)) (.cse21 (= ~m_st~0 0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (<= 2 |old(~E_1~0)|))) (.cse3 (= ~t1_st~0 0)) (.cse23 (= |old(~m_pc~0)| 1)) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~t1_i~0 1))) (.cse24 (and .cse26 .cse1 .cse2 .cse4 .cse7 .cse22 .cse8 .cse9)) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse18 (+ |old(~local~0)| 1))) (or .cse16 .cse17 (not (<= |old(~token~0)| .cse18)) .cse19 (let ((.cse20 (+ ~local~0 1))) (and (<= .cse20 ~token~0) (<= ~token~0 .cse20) .cse2 .cse4 .cse21 .cse7 .cse22 .cse8 .cse9)) .cse12 .cse13 .cse14 (not (<= .cse18 |old(~token~0)|)))) (or .cse16 .cse23 .cse17 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 (and .cse2 .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse9)) (or .cse16 .cse19 .cse12 .cse13 .cse14 .cse24 .cse15) (or .cse0 .cse23 .cse17 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 (and .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9)) (or .cse0 .cse12 .cse25 .cse13 .cse14 (and .cse26 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9) .cse15) (or .cse23 .cse13 .cse14 .cse24 .cse15)))) [2020-10-23 18:57:08,118 INFO L274 CegarLoopResult]: For program point L215(lines 215 222) no Hoare annotation was computed. [2020-10-23 18:57:08,118 INFO L274 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2020-10-23 18:57:08,118 INFO L274 CegarLoopResult]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2020-10-23 18:57:08,119 INFO L274 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2020-10-23 18:57:08,119 INFO L270 CegarLoopResult]: At program point L203(line 203) the Hoare annotation is: (let ((.cse24 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse35 (= ~t1_i~0 1)) (.cse12 (<= ~local~0 ~token~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 0)) (.cse28 (<= 2 ~E_M~0))) (let ((.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse0 (let ((.cse36 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse7 .cse27 .cse11 .cse28))) (.cse17 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse25 .cse7 .cse26 .cse10 .cse35 .cse27 .cse12 .cse28)) (.cse5 (and .cse23 .cse25 .cse7 .cse35 .cse27 .cse28)) (.cse1 (not .cse29)) (.cse18 (not (<= 2 |old(~t1_st~0)|))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (<= 2 |old(~E_1~0)|))) (.cse33 (= ~local~0 |old(~local~0)|)) (.cse34 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (and .cse25 .cse24 .cse35 .cse28)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (not (<= 2 |old(~E_M~0)|))) (.cse6 (not .cse35)) (.cse32 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse16 .cse17 .cse19 (and .cse23 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse25 (not .cse7) .cse26 .cse27 .cse28) .cse20 .cse29 .cse21 (and .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15)) (let ((.cse31 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse16 .cse3 (not (<= |old(~token~0)| .cse31)) .cse18 .cse4 .cse20 .cse21 .cse5 .cse6 (not (<= .cse31 |old(~token~0)|)))) (or .cse22 .cse0 .cse1 .cse16 .cse17 .cse19 .cse4 .cse20 .cse21 .cse5 .cse6 .cse32) (or .cse1 .cse16 .cse18 .cse20 .cse21 .cse6 (and .cse33 .cse7 .cse34 .cse8 .cse13 .cse14 .cse15) .cse32) (or .cse22 .cse16 .cse20 .cse29 .cse21 .cse6 (and .cse23 .cse25 .cse7 .cse8 .cse14) (and .cse33 .cse34 .cse8 .cse30 .cse13 .cse14 .cse15) .cse32) (or .cse16 .cse2 .cse21 .cse6 .cse32) (or (not (= ~M_E~0 2)) .cse2 .cse8 .cse21 .cse6 .cse32)))) [2020-10-23 18:57:08,120 INFO L270 CegarLoopResult]: At program point L232(line 232) the Hoare annotation is: (let ((.cse14 (<= ~token~0 ~local~0)) (.cse20 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse19 (<= 2 ~m_st~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse24 (= ~t1_i~0 1)) (.cse21 (<= 2 ~E_M~0)) (.cse22 (= |old(~t1_pc~0)| 1)) (.cse25 (= ~t1_pc~0 1))) (let ((.cse12 (not .cse25)) (.cse17 (= ~E_M~0 |old(~E_M~0)|)) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= |old(~m_pc~0)| 1)) (.cse13 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse0 (not .cse22)) (.cse1 (and .cse19 .cse15 .cse24 .cse21)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (and .cse19 .cse25 .cse14 .cse20 .cse16 .cse21)) (.cse7 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not .cse24)) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse5 .cse8 .cse9 .cse10 .cse11) (or .cse2 .cse3 (and .cse12 .cse13 .cse14 .cse15 (= ~m_st~0 0) .cse16 .cse17 (= |old(~token~0)| ~token~0)) .cse10 .cse18 .cse1 .cse4 .cse7 (and .cse19 .cse14 .cse20 .cse16 .cse21) .cse8 .cse22 .cse9 (and .cse19 .cse12 .cse20 .cse21)) (or .cse18 .cse1 (and .cse19 .cse12 .cse13 .cse17) .cse8 .cse22 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse9 .cse10 .cse11) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse3 (not (<= |old(~token~0)| .cse23)) .cse5 .cse6 .cse8 .cse9 .cse10 (not (<= .cse23 |old(~token~0)|)))) (or (not (= ~M_E~0 2)) .cse2 .cse13 .cse9 .cse10 .cse11) (or .cse18 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2020-10-23 18:57:08,120 INFO L270 CegarLoopResult]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse24 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse35 (= ~t1_i~0 1)) (.cse12 (<= ~local~0 ~token~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 0)) (.cse28 (<= 2 ~E_M~0))) (let ((.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse0 (let ((.cse36 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse7 .cse27 .cse11 .cse28))) (.cse17 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse25 .cse7 .cse26 .cse10 .cse35 .cse27 .cse12 .cse28)) (.cse5 (and .cse23 .cse25 .cse7 .cse35 .cse27 .cse28)) (.cse1 (not .cse29)) (.cse18 (not (<= 2 |old(~t1_st~0)|))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (<= 2 |old(~E_1~0)|))) (.cse33 (= ~local~0 |old(~local~0)|)) (.cse34 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (and .cse25 .cse24 .cse35 .cse28)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (not (<= 2 |old(~E_M~0)|))) (.cse6 (not .cse35)) (.cse32 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse16 .cse17 .cse19 (and .cse23 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse25 (not .cse7) .cse26 .cse27 .cse28) .cse20 .cse29 .cse21 (and .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15)) (let ((.cse31 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse16 .cse3 (not (<= |old(~token~0)| .cse31)) .cse18 .cse4 .cse20 .cse21 .cse5 .cse6 (not (<= .cse31 |old(~token~0)|)))) (or .cse22 .cse0 .cse1 .cse16 .cse17 .cse19 .cse4 .cse20 .cse21 .cse5 .cse6 .cse32) (or .cse1 .cse16 .cse18 .cse20 .cse21 .cse6 (and .cse33 .cse7 .cse34 .cse8 .cse13 .cse14 .cse15) .cse32) (or .cse22 .cse16 .cse20 .cse29 .cse21 .cse6 (and .cse23 .cse25 .cse7 .cse8 .cse14) (and .cse33 .cse34 .cse8 .cse30 .cse13 .cse14 .cse15) .cse32) (or .cse16 .cse2 .cse21 .cse6 .cse32) (or (not (= ~M_E~0 2)) .cse2 .cse8 .cse21 .cse6 .cse32)))) [2020-10-23 18:57:08,120 INFO L274 CegarLoopResult]: For program point evalEXIT(lines 196 246) no Hoare annotation was computed. [2020-10-23 18:57:08,121 INFO L270 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (let ((.cse14 (= |old(~t1_pc~0)| 1)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse17 (not (= ~m_pc~0 1))) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (<= 2 ~t1_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse20 (= ~t1_i~0 1)) (.cse18 (not (= ~m_st~0 0)))) (let ((.cse1 (= |old(~m_pc~0)| 1)) (.cse2 (not (= |old(~m_st~0)| 0))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (let ((.cse22 (+ ~local~0 1))) (and .cse21 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse15 .cse20 (<= 2 ~E_1~0) (<= 2 ~E_M~0) .cse18))) (.cse10 (and .cse21 .cse15 .cse16 .cse17 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse18 .cse19 (= |old(~token~0)| ~token~0))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse0 (not .cse14)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (<= 2 |old(~E_M~0)|))) (.cse9 (not .cse20)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12) (or .cse1 .cse8 .cse9 .cse12) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse0 .cse2 (not (<= |old(~token~0)| .cse13)) .cse4 .cse6 .cse7 .cse8 .cse9 (not (<= .cse13 |old(~token~0)|)))) (or .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 (and (not .cse15) .cse16 (= ~t1_st~0 0) .cse17 .cse18 .cse19) .cse9 .cse10) (or .cse11 .cse7 .cse14 .cse8 .cse9 .cse12) (or .cse0 .cse4 .cse7 .cse8 .cse9 .cse12)))) [2020-10-23 18:57:08,121 INFO L274 CegarLoopResult]: For program point L212(lines 202 240) no Hoare annotation was computed. [2020-10-23 18:57:08,121 INFO L270 CegarLoopResult]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse24 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse35 (= ~t1_i~0 1)) (.cse12 (<= ~local~0 ~token~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 0)) (.cse28 (<= 2 ~E_M~0))) (let ((.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse0 (let ((.cse36 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse7 .cse27 .cse11 .cse28))) (.cse17 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse25 .cse7 .cse26 .cse10 .cse35 .cse27 .cse12 .cse28)) (.cse5 (and .cse23 .cse25 .cse7 .cse35 .cse27 .cse28)) (.cse1 (not .cse29)) (.cse18 (not (<= 2 |old(~t1_st~0)|))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (<= 2 |old(~E_1~0)|))) (.cse33 (= ~local~0 |old(~local~0)|)) (.cse34 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (and .cse25 .cse24 .cse35 .cse28)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (not (<= 2 |old(~E_M~0)|))) (.cse6 (not .cse35)) (.cse32 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse16 .cse17 .cse19 (and .cse23 .cse7 .cse8 .cse24 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse25 (not .cse7) .cse26 .cse27 .cse28) .cse20 .cse29 .cse21 (and .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15)) (let ((.cse31 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse16 .cse3 (not (<= |old(~token~0)| .cse31)) .cse18 .cse4 .cse20 .cse21 .cse5 .cse6 (not (<= .cse31 |old(~token~0)|)))) (or .cse22 .cse0 .cse1 .cse16 .cse17 .cse19 .cse4 .cse20 .cse21 .cse5 .cse6 .cse32) (or .cse1 .cse16 .cse18 .cse20 .cse21 .cse6 (and .cse33 .cse7 .cse34 .cse8 .cse13 .cse14 .cse15) .cse32) (or .cse22 .cse16 .cse20 .cse29 .cse21 .cse6 (and .cse23 .cse25 .cse7 .cse8 .cse14) (and .cse33 .cse34 .cse8 .cse30 .cse13 .cse14 .cse15) .cse32) (or .cse16 .cse2 .cse21 .cse6 .cse32) (or (not (= ~M_E~0 2)) .cse2 .cse8 .cse21 .cse6 .cse32)))) [2020-10-23 18:57:08,122 INFO L274 CegarLoopResult]: For program point L229(lines 229 236) no Hoare annotation was computed. [2020-10-23 18:57:08,122 INFO L270 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 247 274) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse4 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse11 (not .cse5)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse6 .cse7 .cse2 .cse3 .cse8 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse11 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) .cse7 .cse2 .cse3 .cse13 .cse9)) (or .cse0 .cse1 .cse5 .cse7 .cse2 .cse3 .cse8) (or .cse0 .cse11 .cse6 .cse7 .cse2 .cse3 .cse4 .cse13 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse7 .cse2 .cse3 .cse13)))) [2020-10-23 18:57:08,122 INFO L274 CegarLoopResult]: For program point L256-1(lines 250 273) no Hoare annotation was computed. [2020-10-23 18:57:08,122 INFO L274 CegarLoopResult]: For program point L251-1(lines 250 273) no Hoare annotation was computed. [2020-10-23 18:57:08,122 INFO L274 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 247 274) no Hoare annotation was computed. [2020-10-23 18:57:08,122 INFO L274 CegarLoopResult]: For program point L266-1(lines 247 274) no Hoare annotation was computed. [2020-10-23 18:57:08,122 INFO L274 CegarLoopResult]: For program point L261-1(lines 250 273) no Hoare annotation was computed. [2020-10-23 18:57:08,123 INFO L274 CegarLoopResult]: For program point update_channelsEXIT(lines 150 157) no Hoare annotation was computed. [2020-10-23 18:57:08,123 INFO L277 CegarLoopResult]: At program point update_channelsFINAL(lines 150 157) the Hoare annotation is: true [2020-10-23 18:57:08,123 INFO L270 CegarLoopResult]: At program point L415(line 415) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|))) (or (and (not (= ~t1_pc~0 1)) .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 (= ~m_st~0 0) (<= ~local~0 ~token~0) .cse4 .cse5 (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 18:57:08,123 INFO L270 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|))) [2020-10-23 18:57:08,123 INFO L270 CegarLoopResult]: At program point L413-1(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|))) [2020-10-23 18:57:08,124 INFO L274 CegarLoopResult]: For program point start_simulationEXIT(lines 405 463) no Hoare annotation was computed. [2020-10-23 18:57:08,124 INFO L270 CegarLoopResult]: At program point L442(line 442) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (and .cse6 .cse0 .cse2 .cse3 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (not (<= 2 |old(~E_M~0)|)) (= |old(~t1_pc~0)| 1) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,124 INFO L270 CegarLoopResult]: At program point L442-1(line 442) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,125 INFO L270 CegarLoopResult]: At program point L434(line 434) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,125 INFO L270 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,125 INFO L270 CegarLoopResult]: At program point L432-1(line 432) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,126 INFO L270 CegarLoopResult]: At program point L428(line 428) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,126 INFO L274 CegarLoopResult]: For program point L428-1(line 428) no Hoare annotation was computed. [2020-10-23 18:57:08,126 INFO L270 CegarLoopResult]: At program point L424(line 424) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,126 INFO L274 CegarLoopResult]: For program point L424-1(line 424) no Hoare annotation was computed. [2020-10-23 18:57:08,126 INFO L270 CegarLoopResult]: At program point L420-1(lines 417 457) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,127 INFO L270 CegarLoopResult]: At program point start_simulationENTRY(lines 405 463) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|))) [2020-10-23 18:57:08,127 INFO L270 CegarLoopResult]: At program point L416(line 416) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= ~t1_st~0 0)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|))) (or (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and (not (= ~t1_pc~0 1)) .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 (= ~m_st~0 0) (<= ~local~0 ~token~0) .cse5 (= |old(~token~0)| ~token~0)))) [2020-10-23 18:57:08,127 INFO L270 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|))) (or (and (not (= ~t1_pc~0 1)) .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 (= ~m_st~0 0) (<= ~local~0 ~token~0) .cse4 .cse5 (= |old(~token~0)| ~token~0)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-10-23 18:57:08,127 INFO L270 CegarLoopResult]: At program point L443(line 443) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,128 INFO L274 CegarLoopResult]: For program point L439(lines 439 448) no Hoare annotation was computed. [2020-10-23 18:57:08,128 INFO L270 CegarLoopResult]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,128 INFO L274 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2020-10-23 18:57:08,128 INFO L270 CegarLoopResult]: At program point L433(line 433) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (not .cse2)) (.cse7 (= ~t1_st~0 0)) (.cse0 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5)) (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse3 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse5) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse10 .cse7 .cse11 .cse8 .cse3 .cse4 .cse9 .cse5 .cse12) (not (= |old(~E_1~0)| |old(~M_E~0)|)) (and .cse6 .cse11 .cse5) (not (= |old(~t1_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse6 .cse10 .cse7 .cse3 .cse5) (= |old(~t1_pc~0)| 1) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse8 .cse11 .cse3 .cse4 .cse9 .cse5 .cse12)))) [2020-10-23 18:57:08,128 INFO L277 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: true [2020-10-23 18:57:08,128 INFO L274 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2020-10-23 18:57:08,129 INFO L274 CegarLoopResult]: For program point L452(lines 452 456) no Hoare annotation was computed. [2020-10-23 18:57:08,129 INFO L274 CegarLoopResult]: For program point L450(line 450) no Hoare annotation was computed. [2020-10-23 18:57:08,129 INFO L270 CegarLoopResult]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse12 (not (<= 2 ~m_st~0))) (.cse4 (= ~m_pc~0 1)) (.cse5 (not (= ~t1_st~0 0))) (.cse11 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse7 (not .cse2)) (.cse1 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse8 (not (<= ~token~0 ~local~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse6 (= ~m_st~0 0)) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse1 .cse8 .cse3 .cse4 .cse9 .cse10 .cse11) (or .cse12 .cse1 (= ~E_M~0 0) .cse3 .cse4) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse7 (not (<= ~token~0 .cse13)) .cse1 (not (<= .cse13 ~token~0)) .cse3 .cse9 (not .cse6) .cse11)) (or .cse0 .cse12 .cse1 .cse2 .cse3 .cse5 .cse11) (or .cse0 .cse12 .cse7 .cse1 .cse3 .cse9 .cse11) (or .cse0 .cse12 .cse1 .cse8 .cse3 .cse5 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse10 .cse11) (or .cse0 .cse7 .cse1 .cse8 .cse3 .cse9 .cse6 .cse10)))) [2020-10-23 18:57:08,129 INFO L274 CegarLoopResult]: For program point L117(lines 117 122) no Hoare annotation was computed. [2020-10-23 18:57:08,129 INFO L274 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 112 130) no Hoare annotation was computed. [2020-10-23 18:57:08,129 INFO L274 CegarLoopResult]: For program point L116(lines 116 125) no Hoare annotation was computed. [2020-10-23 18:57:08,129 INFO L274 CegarLoopResult]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2020-10-23 18:57:08,129 INFO L274 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 112 130) no Hoare annotation was computed. [2020-10-23 18:57:08,130 INFO L277 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 112 130) the Hoare annotation is: true [2020-10-23 18:57:08,130 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-23 18:57:08,130 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~E_1~0 ~M_E~0) (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~T1_E~0 ~M_E~0) (<= ~token~0 ~local~0) (not (= ~m_pc~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (<= ~local~0 ~token~0) (<= 2 ~E_M~0)) [2020-10-23 18:57:08,130 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 18:57:08,130 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-23 18:57:08,130 INFO L274 CegarLoopResult]: For program point L352-1(lines 351 374) no Hoare annotation was computed. [2020-10-23 18:57:08,130 INFO L274 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 348 375) no Hoare annotation was computed. [2020-10-23 18:57:08,131 INFO L270 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 348 375) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse4 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse11 (not .cse5)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse6 .cse7 .cse2 .cse3 .cse8 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse11 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) .cse7 .cse2 .cse3 .cse13 .cse9)) (or .cse0 .cse1 .cse5 .cse7 .cse2 .cse3 .cse8) (or .cse0 .cse11 .cse6 .cse7 .cse2 .cse3 .cse4 .cse13 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse7 .cse2 .cse3 .cse13)))) [2020-10-23 18:57:08,131 INFO L274 CegarLoopResult]: For program point L367-1(lines 348 375) no Hoare annotation was computed. [2020-10-23 18:57:08,131 INFO L274 CegarLoopResult]: For program point L362-1(lines 351 374) no Hoare annotation was computed. [2020-10-23 18:57:08,131 INFO L274 CegarLoopResult]: For program point L357-1(lines 351 374) no Hoare annotation was computed. [2020-10-23 18:57:08,131 INFO L274 CegarLoopResult]: For program point init_modelFINAL(lines 376 385) no Hoare annotation was computed. [2020-10-23 18:57:08,131 INFO L274 CegarLoopResult]: For program point init_modelEXIT(lines 376 385) no Hoare annotation was computed. [2020-10-23 18:57:08,131 INFO L270 CegarLoopResult]: At program point init_modelENTRY(lines 376 385) the Hoare annotation is: (or (not (<= 2 ~E_M~0)) (not (= ~M_E~0 2)) (= ~t1_pc~0 1) (not (<= ~token~0 ~local~0)) (= ~m_pc~0 1) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (= ~t1_st~0 0)) (not (= ~T1_E~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (= ~E_1~0 ~M_E~0)) (not (<= ~local~0 ~token~0)) (= |old(~t1_i~0)| 1)) [2020-10-23 18:57:08,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:57:08 BoogieIcfgContainer [2020-10-23 18:57:08,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:57:08,207 INFO L168 Benchmark]: Toolchain (without parser) took 127328.34 ms. Allocated memory was 154.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 129.9 MB in the beginning and 752.9 MB in the end (delta: -623.0 MB). Peak memory consumption was 726.9 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:08,208 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 154.1 MB. Free memory is still 128.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:57:08,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.56 ms. Allocated memory is still 154.1 MB. Free memory was 129.2 MB in the beginning and 116.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:08,208 INFO L168 Benchmark]: Boogie Preprocessor took 63.68 ms. Allocated memory is still 154.1 MB. Free memory was 116.7 MB in the beginning and 114.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:08,209 INFO L168 Benchmark]: RCFGBuilder took 921.99 ms. Allocated memory is still 154.1 MB. Free memory was 114.6 MB in the beginning and 113.6 MB in the end (delta: 933.2 kB). Peak memory consumption was 11.2 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:08,209 INFO L168 Benchmark]: TraceAbstraction took 125936.51 ms. Allocated memory was 154.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 113.6 MB in the beginning and 752.9 MB in the end (delta: -639.2 MB). Peak memory consumption was 709.4 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:08,211 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 154.1 MB. Free memory is still 128.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 388.56 ms. Allocated memory is still 154.1 MB. Free memory was 129.2 MB in the beginning and 116.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 63.68 ms. Allocated memory is still 154.1 MB. Free memory was 116.7 MB in the beginning and 114.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 921.99 ms. Allocated memory is still 154.1 MB. Free memory was 114.6 MB in the beginning and 113.6 MB in the end (delta: 933.2 kB). Peak memory consumption was 11.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 125936.51 ms. Allocated memory was 154.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 113.6 MB in the beginning and 752.9 MB in the end (delta: -639.2 MB). Peak memory consumption was 709.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= E_M) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || m_st == 0) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((!(2 <= m_st) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 0) || !(t1_i == 1)) || m_pc == 1)) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(local + 1 <= token)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || !(t1_i == 1)) || !(t1_st == 0)) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(2 <= m_st)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(2 <= E_M) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(local <= token)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(t1_pc) == 1)) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || ((((((((t1_pc == 1 && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) && (((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(\old(t1_st) == 0)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && !(m_pc == 1)) && token <= local) && m_st == 0) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || ((((2 <= m_st && !(t1_pc == 1)) && t1_st == 0) && 2 <= E_1) && 2 <= E_M)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || ((((((((E_1 == \old(E_1) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && \old(t1_pc) == t1_pc) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token))) && (((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(t1_pc) == 1)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(m_st) == 0)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(\old(local) + 1 <= \old(token)))) && (((((((((((!(\old(t1_st) == 0) || ((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M)) || !(\old(t1_pc) == 1)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && (((((((!(\old(t1_pc) == 1) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || !(t1_i == 1)) || ((((((local == \old(local) && t1_pc == 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_1 == \old(E_1)) && E_M == \old(E_M))) || ((((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st)))) && (((((((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M) || \old(m_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && (((((!(M_E == 2) || \old(m_pc) == 1) || E_1 == \old(E_1)) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st))) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: ((((((((((((2 <= m_st && !(m_pc == 1)) && 2 <= E_M) || !(\old(token) <= local)) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && token <= \old(token) + 1) && m_st == 0) && 2 <= E_M)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || (((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && 2 <= E_M)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((2 <= m_st && !(m_pc == 1)) && 2 <= E_M) || !(2 <= \old(E_M))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && ((((((((!(\old(token) <= local) || !(\old(m_st) == 0)) || ((((2 <= t1_st && t1_pc == 1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1))) && ((((((((2 <= m_st && !(m_pc == 1)) && 2 <= E_M) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == \old(E_M))) || !(2 <= E_1)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((!(\old(token) <= local) || !(\old(m_st) == 0)) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1)) && ((((\old(t1_pc) == 1 || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(\old(token) <= local) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || !(2 <= \old(E_M))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= \old(m_st))) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(T1_E) == \old(M_E))) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token) && 2 <= E_M)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(2 == \old(M_E))) || ((((((((!(t1_pc == 1) && t1_st == 0) && !(m_pc == 1)) && token <= local) && 2 <= E_1) && m_st == 0) && local <= token) && 2 <= E_M) && \old(token) == token)) || !(\old(E_1) == \old(M_E))) || ((2 <= m_st && !(m_pc == 1)) && 2 <= E_M)) || !(\old(t1_st) == 0)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((((2 <= m_st && !(t1_pc == 1)) && t1_st == 0) && 2 <= E_1) && 2 <= E_M)) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || ((((((((2 <= t1_st && t1_pc == 1) && token <= local) && !(m_pc == 1)) && 2 <= E_1) && m_st == 0) && local <= token) && 2 <= E_M) && \old(token) == token) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(t1_pc) == 1)) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || ((((((((t1_pc == 1 && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) && (((((((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(\old(t1_st) == 0)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && !(m_pc == 1)) && token <= local) && m_st == 0) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || ((((2 <= m_st && !(t1_pc == 1)) && t1_st == 0) && 2 <= E_1) && 2 <= E_M)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || ((((((((E_1 == \old(E_1) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && \old(t1_pc) == t1_pc) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token))) && (((((((((((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M) || !(\old(t1_pc) == 1)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(m_st) == 0)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(\old(local) + 1 <= \old(token)))) && (((((((((((!(\old(t1_st) == 0) || ((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && 2 <= E_M)) || !(\old(t1_pc) == 1)) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || (((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 2 <= E_M)) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && (((((((!(\old(t1_pc) == 1) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || !(t1_i == 1)) || ((((((local == \old(local) && t1_pc == 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || (((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_1 == \old(E_1)) && E_M == \old(E_M))) || ((((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st)))) && (((((((2 <= m_st && !(m_pc == 1)) && t1_i == 1) && 2 <= E_M) || \old(m_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && (((((!(M_E == 2) || \old(m_pc) == 1) || E_1 == \old(E_1)) || !(2 <= \old(E_M))) || !(t1_i == 1)) || !(2 <= \old(m_st))) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= E_M) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(local) + 1 <= \old(token))) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1))) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((local + 1 <= token && token <= local + 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(\old(local) + 1 <= \old(token)))) && ((((((!(\old(t1_st) == 0) || !(2 <= E_M)) || t1_pc == 1) || \old(m_pc) == 1) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((!(\old(t1_st) == 0) || !(2 <= E_M)) || t1_pc == 1) || \old(m_pc) == 1) || \old(m_st) == 0) || !(2 <= \old(E_1))) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && t1_st == 0) && m_pc == \old(m_pc)) && \old(token) == token)) || !(t1_i == 1)) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((local + 1 <= token && token <= local + 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(\old(local) + 1 <= \old(token)))) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((m_st == \old(m_st) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && \old(token) == token)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 0) || !(t1_i == 1)) || !(2 <= E_1)) && ((((((!(2 <= m_st) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(E_1 == M_E))) && ((((((((!(2 <= E_M) || t1_pc == 1) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && (((((((!(t1_pc == 1) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(local + 1 <= token)) || E_M == 0) || !(t1_i == 1)) || !(m_st == 0)) || !(2 <= E_1))) && (((((!(2 <= E_M) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(2 <= E_1))) && ((((((!(2 <= E_M) || t1_pc == 1) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || m_st == 0)) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(2 <= t1_st)) || !(m_st == 0)) || !(local <= token)) || !(2 <= E_1)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= E_M && \old(t1_st) == t1_st) || (t1_st == 0 && 2 <= E_M)) && t1_pc == 1) && \old(token) + 1 <= token) && token <= \old(token) + 1) && t1_i == 1) && m_st == 0) || !(\old(token) <= local)) || (((2 <= m_st && ((2 <= E_M && \old(t1_st) == t1_st) || (t1_st == 0 && 2 <= E_M))) && t1_pc == 1) && t1_i == 1)) || !(\old(t1_pc) == 1)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((!(M_E == 2) || !(2 <= \old(E_M))) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || m_pc == 1) || !(E_1 == M_E)) || !(2 <= \old(m_st)))) && ((((!(2 <= \old(E_M)) || !(t1_i == 1)) || m_pc == 1) || (2 <= m_st && ((((m_st == \old(m_st) && !(m_pc == 1)) && \old(t1_st) == t1_st) && 2 <= E_M) || ((t1_st == 0 && !(m_pc == 1)) && 2 <= E_M)))) || !(2 <= \old(m_st)))) && ((((((((((((m_st == 0 && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || !(\old(token) <= local)) || !(\old(m_st) == 0)) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1))) && ((((((((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || \old(t1_pc) == 1) || !(2 <= \old(E_M))) || !(t1_i == 1)) || (2 <= m_st && ((((m_st == \old(m_st) && !(m_pc == 1)) && \old(t1_st) == t1_st) && 2 <= E_M) || ((t1_st == 0 && !(m_pc == 1)) && 2 <= E_M)))) || !(2 <= \old(m_st))) || !(2 <= E_1)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((!(\old(t1_st) == 0) || !(2 <= E_M)) || t1_pc == 1) || \old(m_pc) == 1) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((2 <= m_st && 2 <= E_1) && \old(t1_st) == t1_st)) && ((((((((((!(2 <= E_M) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && \old(t1_st) == t1_st))) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || (((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && \old(t1_st) == t1_st)) || !(\old(local) + 1 <= \old(token))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 48.8s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 37.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 76.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2572 SDtfs, 9081 SDslu, 777 SDs, 0 SdLazy, 16591 SolverSat, 5540 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1333 GetRequests, 1041 SyntacticMatches, 6 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4770occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 4383 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 9596 PreInvPairs, 12181 NumberOfFragments, 11480 HoareAnnotationTreeSize, 9596 FomulaSimplifications, 454330554 FormulaSimplificationTreeSizeReduction, 28.5s HoareSimplificationTime, 63 FomulaSimplificationsInter, 1351444 FormulaSimplificationTreeSizeReductionInter, 47.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2208 NumberOfCodeBlocks, 2208 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2190 ConstructedInterpolants, 0 QuantifiedInterpolants, 747619 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2325 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 773/807 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...