/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:33:46,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:33:46,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-22 02:33:46,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:33:46,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:33:46,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:33:46,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:33:46,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:33:46,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:33:46,390 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:33:46,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:33:46,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:33:46,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:33:46,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:33:46,392 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:33:46,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:33:46,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:33:46,393 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:33:46,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:33:46,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:33:46,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:33:46,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:33:46,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:33:46,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:33:46,394 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:33:46,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:33:46,395 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:33:46,395 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:33:46,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:33:46,395 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:33:46,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:33:46,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:33:46,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:33:46,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:33:46,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:33:46,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:33:46,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:33:46,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:33:46,397 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:33:46,398 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:33:46,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:33:46,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:33:46,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:33:46,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:33:46,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:33:46,399 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:33:46,399 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-12-22 02:33:46,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:33:46,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:33:46,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:33:46,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:33:46,562 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:33:46,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2023-12-22 02:33:47,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:33:47,903 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:33:47,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2023-12-22 02:33:47,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50175eb8c/5e075b5aec3e4611b8e812695c2fe0eb/FLAG28560d6bc [2023-12-22 02:33:47,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50175eb8c/5e075b5aec3e4611b8e812695c2fe0eb [2023-12-22 02:33:47,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:33:47,949 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:33:47,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:33:47,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:33:47,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:33:47,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:33:47" (1/1) ... [2023-12-22 02:33:47,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7315c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:47, skipping insertion in model container [2023-12-22 02:33:47,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:33:47" (1/1) ... [2023-12-22 02:33:48,001 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:33:48,134 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2023-12-22 02:33:48,171 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2023-12-22 02:33:48,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:33:48,226 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:33:48,234 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2023-12-22 02:33:48,258 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2023-12-22 02:33:48,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:33:48,295 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:33:48,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48 WrapperNode [2023-12-22 02:33:48,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:33:48,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:33:48,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:33:48,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:33:48,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,348 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 507 [2023-12-22 02:33:48,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:33:48,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:33:48,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:33:48,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:33:48,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,373 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-22 02:33:48,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:33:48,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:33:48,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:33:48,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:33:48,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (1/1) ... [2023-12-22 02:33:48,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:33:48,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:33:48,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-22 02:33:48,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-22 02:33:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:33:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-22 02:33:48,519 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-22 02:33:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-22 02:33:48,519 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-22 02:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-22 02:33:48,520 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-22 02:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-22 02:33:48,520 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-22 02:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-22 02:33:48,520 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-22 02:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-22 02:33:48,520 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-22 02:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-22 02:33:48,520 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-22 02:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-22 02:33:48,520 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-22 02:33:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:33:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-22 02:33:48,521 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-22 02:33:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-22 02:33:48,522 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-22 02:33:48,522 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-22 02:33:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-22 02:33:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-22 02:33:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-22 02:33:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-22 02:33:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-22 02:33:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:33:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:33:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-22 02:33:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-22 02:33:48,637 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:33:48,639 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:33:49,077 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:33:49,110 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:33:49,110 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-22 02:33:49,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:33:49 BoogieIcfgContainer [2023-12-22 02:33:49,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:33:49,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:33:49,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:33:49,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:33:49,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:33:47" (1/3) ... [2023-12-22 02:33:49,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe79eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:33:49, skipping insertion in model container [2023-12-22 02:33:49,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:48" (2/3) ... [2023-12-22 02:33:49,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe79eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:33:49, skipping insertion in model container [2023-12-22 02:33:49,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:33:49" (3/3) ... [2023-12-22 02:33:49,116 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2023-12-22 02:33:49,128 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:33:49,128 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:33:49,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:33:49,176 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@624c8933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:33:49,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:33:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 184 states have (on average 1.6521739130434783) internal successors, (304), 190 states have internal predecessors, (304), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-22 02:33:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:33:49,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:49,188 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:49,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:49,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -917654171, now seen corresponding path program 1 times [2023-12-22 02:33:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:49,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391758265] [2023-12-22 02:33:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:49,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:49,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:49,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:49,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-22 02:33:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:49,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 02:33:49,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:49,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:49,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391758265] [2023-12-22 02:33:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391758265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:49,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:49,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:33:49,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352079490] [2023-12-22 02:33:49,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:49,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:49,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:49,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:49,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:49,463 INFO L87 Difference]: Start difference. First operand has 232 states, 184 states have (on average 1.6521739130434783) internal successors, (304), 190 states have internal predecessors, (304), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:50,017 INFO L93 Difference]: Finished difference Result 543 states and 857 transitions. [2023-12-22 02:33:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:50,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-22 02:33:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:50,028 INFO L225 Difference]: With dead ends: 543 [2023-12-22 02:33:50,028 INFO L226 Difference]: Without dead ends: 322 [2023-12-22 02:33:50,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:50,033 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 278 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:50,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 680 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 02:33:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-12-22 02:33:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2023-12-22 02:33:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 249 states have (on average 1.502008032128514) internal successors, (374), 255 states have internal predecessors, (374), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2023-12-22 02:33:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 461 transitions. [2023-12-22 02:33:50,081 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 461 transitions. Word has length 58 [2023-12-22 02:33:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:50,081 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 461 transitions. [2023-12-22 02:33:50,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 461 transitions. [2023-12-22 02:33:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:33:50,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:50,084 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:50,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:50,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:50,288 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:50,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2008816218, now seen corresponding path program 1 times [2023-12-22 02:33:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:50,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115710725] [2023-12-22 02:33:50,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:50,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:50,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:50,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:50,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-22 02:33:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:50,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 02:33:50,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:50,385 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:50,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115710725] [2023-12-22 02:33:50,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115710725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:50,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:50,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:33:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189120910] [2023-12-22 02:33:50,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:50,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:50,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:50,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:50,388 INFO L87 Difference]: Start difference. First operand 315 states and 461 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:50,841 INFO L93 Difference]: Finished difference Result 674 states and 982 transitions. [2023-12-22 02:33:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:50,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-22 02:33:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:50,845 INFO L225 Difference]: With dead ends: 674 [2023-12-22 02:33:50,845 INFO L226 Difference]: Without dead ends: 510 [2023-12-22 02:33:50,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:50,847 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 267 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:50,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 676 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 02:33:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-12-22 02:33:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 502. [2023-12-22 02:33:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 392 states have (on average 1.4591836734693877) internal successors, (572), 406 states have internal predecessors, (572), 64 states have call successors, (64), 35 states have call predecessors, (64), 44 states have return successors, (87), 65 states have call predecessors, (87), 62 states have call successors, (87) [2023-12-22 02:33:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 723 transitions. [2023-12-22 02:33:50,877 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 723 transitions. Word has length 58 [2023-12-22 02:33:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:50,878 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 723 transitions. [2023-12-22 02:33:50,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 723 transitions. [2023-12-22 02:33:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:33:50,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:50,880 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:50,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-22 02:33:51,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:51,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:51,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash 342158310, now seen corresponding path program 1 times [2023-12-22 02:33:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:51,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413749665] [2023-12-22 02:33:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:51,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:51,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:51,088 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:51,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-22 02:33:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:51,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:33:51,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:51,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:51,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:51,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413749665] [2023-12-22 02:33:51,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413749665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:51,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:51,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:33:51,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20993478] [2023-12-22 02:33:51,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:51,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:33:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:51,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:33:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:51,185 INFO L87 Difference]: Start difference. First operand 502 states and 723 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:51,276 INFO L93 Difference]: Finished difference Result 857 states and 1220 transitions. [2023-12-22 02:33:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:51,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-22 02:33:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:51,279 INFO L225 Difference]: With dead ends: 857 [2023-12-22 02:33:51,279 INFO L226 Difference]: Without dead ends: 520 [2023-12-22 02:33:51,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:33:51,281 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 6 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:51,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1545 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-12-22 02:33:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 510. [2023-12-22 02:33:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 398 states have (on average 1.4472361809045227) internal successors, (576), 412 states have internal predecessors, (576), 64 states have call successors, (64), 35 states have call predecessors, (64), 46 states have return successors, (89), 67 states have call predecessors, (89), 62 states have call successors, (89) [2023-12-22 02:33:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 729 transitions. [2023-12-22 02:33:51,310 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 729 transitions. Word has length 58 [2023-12-22 02:33:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:51,310 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 729 transitions. [2023-12-22 02:33:51,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 729 transitions. [2023-12-22 02:33:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:33:51,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:51,313 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:51,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:51,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:51,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:51,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1901824988, now seen corresponding path program 1 times [2023-12-22 02:33:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:51,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889209940] [2023-12-22 02:33:51,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:51,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:51,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:51,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-22 02:33:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:51,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:33:51,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:51,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:51,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:51,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889209940] [2023-12-22 02:33:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889209940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:51,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:33:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254667288] [2023-12-22 02:33:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:33:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:33:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:51,600 INFO L87 Difference]: Start difference. First operand 510 states and 729 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:51,689 INFO L93 Difference]: Finished difference Result 867 states and 1222 transitions. [2023-12-22 02:33:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:51,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-22 02:33:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:51,692 INFO L225 Difference]: With dead ends: 867 [2023-12-22 02:33:51,692 INFO L226 Difference]: Without dead ends: 522 [2023-12-22 02:33:51,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:33:51,694 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 3 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:51,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1550 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-12-22 02:33:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 518. [2023-12-22 02:33:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 404 states have (on average 1.4356435643564356) internal successors, (580), 418 states have internal predecessors, (580), 64 states have call successors, (64), 35 states have call predecessors, (64), 48 states have return successors, (91), 69 states have call predecessors, (91), 62 states have call successors, (91) [2023-12-22 02:33:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 735 transitions. [2023-12-22 02:33:51,716 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 735 transitions. Word has length 58 [2023-12-22 02:33:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:51,716 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 735 transitions. [2023-12-22 02:33:51,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 735 transitions. [2023-12-22 02:33:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:33:51,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:51,718 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:51,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:51,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:51,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:51,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1839785374, now seen corresponding path program 1 times [2023-12-22 02:33:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:51,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137978622] [2023-12-22 02:33:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:51,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:51,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:51,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:51,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-22 02:33:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:52,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:52,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:52,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:52,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:52,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137978622] [2023-12-22 02:33:52,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137978622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:52,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:52,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:52,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086552400] [2023-12-22 02:33:52,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:52,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:52,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:52,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:52,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:52,065 INFO L87 Difference]: Start difference. First operand 518 states and 735 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-22 02:33:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:52,460 INFO L93 Difference]: Finished difference Result 1216 states and 1682 transitions. [2023-12-22 02:33:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:52,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-12-22 02:33:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:52,465 INFO L225 Difference]: With dead ends: 1216 [2023-12-22 02:33:52,465 INFO L226 Difference]: Without dead ends: 867 [2023-12-22 02:33:52,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:52,466 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 436 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:52,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 366 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:33:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2023-12-22 02:33:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 863. [2023-12-22 02:33:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 659 states have (on average 1.3884673748103187) internal successors, (915), 688 states have internal predecessors, (915), 110 states have call successors, (110), 63 states have call predecessors, (110), 92 states have return successors, (176), 120 states have call predecessors, (176), 108 states have call successors, (176) [2023-12-22 02:33:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1201 transitions. [2023-12-22 02:33:52,517 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1201 transitions. Word has length 58 [2023-12-22 02:33:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:52,518 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1201 transitions. [2023-12-22 02:33:52,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-22 02:33:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1201 transitions. [2023-12-22 02:33:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-22 02:33:52,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:52,520 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:52,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:52,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:52,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:52,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1289341817, now seen corresponding path program 1 times [2023-12-22 02:33:52,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715726020] [2023-12-22 02:33:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:52,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:52,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:52,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:52,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-22 02:33:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:52,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:52,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:52,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:52,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:52,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715726020] [2023-12-22 02:33:52,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715726020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:52,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:52,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:52,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004531534] [2023-12-22 02:33:52,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:52,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:52,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:52,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:52,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:52,840 INFO L87 Difference]: Start difference. First operand 863 states and 1201 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:52,924 INFO L93 Difference]: Finished difference Result 2177 states and 2972 transitions. [2023-12-22 02:33:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:52,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-12-22 02:33:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:52,930 INFO L225 Difference]: With dead ends: 2177 [2023-12-22 02:33:52,930 INFO L226 Difference]: Without dead ends: 1495 [2023-12-22 02:33:52,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:52,932 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 275 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:52,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 417 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2023-12-22 02:33:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1451. [2023-12-22 02:33:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1099 states have (on average 1.3439490445859872) internal successors, (1477), 1150 states have internal predecessors, (1477), 176 states have call successors, (176), 119 states have call predecessors, (176), 174 states have return successors, (290), 190 states have call predecessors, (290), 174 states have call successors, (290) [2023-12-22 02:33:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1943 transitions. [2023-12-22 02:33:53,015 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1943 transitions. Word has length 59 [2023-12-22 02:33:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:53,015 INFO L495 AbstractCegarLoop]: Abstraction has 1451 states and 1943 transitions. [2023-12-22 02:33:53,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1943 transitions. [2023-12-22 02:33:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:33:53,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:53,017 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:53,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:53,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:53,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:53,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash -574964482, now seen corresponding path program 1 times [2023-12-22 02:33:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:53,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356066300] [2023-12-22 02:33:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:53,223 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:53,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-22 02:33:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:53,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:53,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:53,336 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:53,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:53,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356066300] [2023-12-22 02:33:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356066300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:53,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:53,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:53,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897840064] [2023-12-22 02:33:53,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:53,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:53,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:53,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:53,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:53,353 INFO L87 Difference]: Start difference. First operand 1451 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:53,528 INFO L93 Difference]: Finished difference Result 3867 states and 5112 transitions. [2023-12-22 02:33:53,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:53,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-12-22 02:33:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:53,536 INFO L225 Difference]: With dead ends: 3867 [2023-12-22 02:33:53,537 INFO L226 Difference]: Without dead ends: 2569 [2023-12-22 02:33:53,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:53,539 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 63 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:53,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 589 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2023-12-22 02:33:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2537. [2023-12-22 02:33:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 1917 states have (on average 1.313510693792384) internal successors, (2518), 1989 states have internal predecessors, (2518), 296 states have call successors, (296), 231 states have call predecessors, (296), 322 states have return successors, (468), 321 states have call predecessors, (468), 294 states have call successors, (468) [2023-12-22 02:33:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3282 transitions. [2023-12-22 02:33:53,699 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3282 transitions. Word has length 60 [2023-12-22 02:33:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:53,699 INFO L495 AbstractCegarLoop]: Abstraction has 2537 states and 3282 transitions. [2023-12-22 02:33:53,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3282 transitions. [2023-12-22 02:33:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-22 02:33:53,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:53,701 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:53,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-22 02:33:53,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:53,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:53,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1978334883, now seen corresponding path program 1 times [2023-12-22 02:33:53,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:53,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247902447] [2023-12-22 02:33:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:53,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:53,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:53,907 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:53,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-22 02:33:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:53,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:53,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:54,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:54,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247902447] [2023-12-22 02:33:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247902447] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:54,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70155910] [2023-12-22 02:33:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:54,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:54,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:54,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:54,053 INFO L87 Difference]: Start difference. First operand 2537 states and 3282 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:54,338 INFO L93 Difference]: Finished difference Result 5473 states and 7020 transitions. [2023-12-22 02:33:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:54,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2023-12-22 02:33:54,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:54,348 INFO L225 Difference]: With dead ends: 5473 [2023-12-22 02:33:54,349 INFO L226 Difference]: Without dead ends: 3097 [2023-12-22 02:33:54,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:54,368 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 270 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:54,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 417 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2023-12-22 02:33:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 3053. [2023-12-22 02:33:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3053 states, 2305 states have (on average 1.297180043383948) internal successors, (2990), 2385 states have internal predecessors, (2990), 360 states have call successors, (360), 287 states have call predecessors, (360), 386 states have return successors, (551), 385 states have call predecessors, (551), 358 states have call successors, (551) [2023-12-22 02:33:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 3901 transitions. [2023-12-22 02:33:54,532 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 3901 transitions. Word has length 66 [2023-12-22 02:33:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:54,532 INFO L495 AbstractCegarLoop]: Abstraction has 3053 states and 3901 transitions. [2023-12-22 02:33:54,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 3901 transitions. [2023-12-22 02:33:54,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-22 02:33:54,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:54,534 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:33:54,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:54,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:54,738 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:54,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1715112493, now seen corresponding path program 1 times [2023-12-22 02:33:54,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:54,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214230467] [2023-12-22 02:33:54,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:54,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:54,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:54,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:54,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-22 02:33:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:54,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:54,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:54,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:54,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:54,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214230467] [2023-12-22 02:33:54,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214230467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:54,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:54,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772286596] [2023-12-22 02:33:54,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:54,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:54,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:54,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:54,865 INFO L87 Difference]: Start difference. First operand 3053 states and 3901 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:55,115 INFO L93 Difference]: Finished difference Result 3673 states and 4674 transitions. [2023-12-22 02:33:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:33:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2023-12-22 02:33:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:55,128 INFO L225 Difference]: With dead ends: 3673 [2023-12-22 02:33:55,129 INFO L226 Difference]: Without dead ends: 3670 [2023-12-22 02:33:55,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:55,130 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 607 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:55,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 400 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2023-12-22 02:33:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3636. [2023-12-22 02:33:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 2743 states have (on average 1.2901932191031718) internal successors, (3539), 2837 states have internal predecessors, (3539), 425 states have call successors, (425), 343 states have call predecessors, (425), 466 states have return successors, (654), 460 states have call predecessors, (654), 424 states have call successors, (654) [2023-12-22 02:33:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 4618 transitions. [2023-12-22 02:33:55,396 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 4618 transitions. Word has length 67 [2023-12-22 02:33:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:55,396 INFO L495 AbstractCegarLoop]: Abstraction has 3636 states and 4618 transitions. [2023-12-22 02:33:55,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 4618 transitions. [2023-12-22 02:33:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-22 02:33:55,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:55,398 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:33:55,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:55,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:55,601 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:55,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1629656985, now seen corresponding path program 1 times [2023-12-22 02:33:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654737082] [2023-12-22 02:33:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:55,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:55,603 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:55,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-22 02:33:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:55,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:33:55,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:55,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:33:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:56,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654737082] [2023-12-22 02:33:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654737082] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 02:33:56,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 02:33:56,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2023-12-22 02:33:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714870962] [2023-12-22 02:33:56,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 02:33:56,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 02:33:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 02:33:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:33:56,039 INFO L87 Difference]: Start difference. First operand 3636 states and 4618 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-22 02:33:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:56,669 INFO L93 Difference]: Finished difference Result 8175 states and 10374 transitions. [2023-12-22 02:33:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:33:56,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 68 [2023-12-22 02:33:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:56,697 INFO L225 Difference]: With dead ends: 8175 [2023-12-22 02:33:56,698 INFO L226 Difference]: Without dead ends: 8172 [2023-12-22 02:33:56,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:33:56,701 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 899 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:56,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1602 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:33:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2023-12-22 02:33:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 5990. [2023-12-22 02:33:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5990 states, 4517 states have (on average 1.2882444100066415) internal successors, (5819), 4677 states have internal predecessors, (5819), 689 states have call successors, (689), 567 states have call predecessors, (689), 782 states have return successors, (1088), 750 states have call predecessors, (1088), 688 states have call successors, (1088) [2023-12-22 02:33:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5990 states to 5990 states and 7596 transitions. [2023-12-22 02:33:57,039 INFO L78 Accepts]: Start accepts. Automaton has 5990 states and 7596 transitions. Word has length 68 [2023-12-22 02:33:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:57,040 INFO L495 AbstractCegarLoop]: Abstraction has 5990 states and 7596 transitions. [2023-12-22 02:33:57,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-22 02:33:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5990 states and 7596 transitions. [2023-12-22 02:33:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:33:57,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:57,042 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-22 02:33:57,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-22 02:33:57,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:57,245 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:57,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash 228963667, now seen corresponding path program 2 times [2023-12-22 02:33:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:57,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240075264] [2023-12-22 02:33:57,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:33:57,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:57,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:57,261 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:57,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-22 02:33:57,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 02:33:57,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:33:57,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:57,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:57,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:57,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240075264] [2023-12-22 02:33:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240075264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:57,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:57,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:57,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394082313] [2023-12-22 02:33:57,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:57,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:57,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:57,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:57,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:57,335 INFO L87 Difference]: Start difference. First operand 5990 states and 7596 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:57,628 INFO L93 Difference]: Finished difference Result 8961 states and 11452 transitions. [2023-12-22 02:33:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:57,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2023-12-22 02:33:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:57,642 INFO L225 Difference]: With dead ends: 8961 [2023-12-22 02:33:57,642 INFO L226 Difference]: Without dead ends: 3658 [2023-12-22 02:33:57,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:57,654 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 306 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:57,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 475 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2023-12-22 02:33:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3634. [2023-12-22 02:33:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3634 states, 2745 states have (on average 1.2724954462659381) internal successors, (3493), 2835 states have internal predecessors, (3493), 425 states have call successors, (425), 343 states have call predecessors, (425), 462 states have return successors, (622), 460 states have call predecessors, (622), 424 states have call successors, (622) [2023-12-22 02:33:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 4540 transitions. [2023-12-22 02:33:57,866 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 4540 transitions. Word has length 71 [2023-12-22 02:33:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:57,866 INFO L495 AbstractCegarLoop]: Abstraction has 3634 states and 4540 transitions. [2023-12-22 02:33:57,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 4540 transitions. [2023-12-22 02:33:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:33:57,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:57,868 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:57,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:58,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:58,072 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:58,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1733702944, now seen corresponding path program 1 times [2023-12-22 02:33:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:58,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9603200] [2023-12-22 02:33:58,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:58,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:58,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:58,080 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:58,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-22 02:33:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:58,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:58,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:58,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:58,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:58,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9603200] [2023-12-22 02:33:58,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9603200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:58,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:58,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:58,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213628004] [2023-12-22 02:33:58,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:58,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:58,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:58,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:58,188 INFO L87 Difference]: Start difference. First operand 3634 states and 4540 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:58,746 INFO L93 Difference]: Finished difference Result 3907 states and 4963 transitions. [2023-12-22 02:33:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:58,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:33:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:58,766 INFO L225 Difference]: With dead ends: 3907 [2023-12-22 02:33:58,766 INFO L226 Difference]: Without dead ends: 3777 [2023-12-22 02:33:58,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:58,769 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 519 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:58,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 668 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:33:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2023-12-22 02:33:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3766. [2023-12-22 02:33:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 2858 states have (on average 1.2841147655703289) internal successors, (3670), 2949 states have internal predecessors, (3670), 437 states have call successors, (437), 349 states have call predecessors, (437), 469 states have return successors, (635), 472 states have call predecessors, (635), 436 states have call successors, (635) [2023-12-22 02:33:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 4742 transitions. [2023-12-22 02:33:58,990 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 4742 transitions. Word has length 71 [2023-12-22 02:33:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:58,990 INFO L495 AbstractCegarLoop]: Abstraction has 3766 states and 4742 transitions. [2023-12-22 02:33:58,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 4742 transitions. [2023-12-22 02:33:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:33:58,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:58,992 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:33:59,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-22 02:33:59,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:59,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:59,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1860015964, now seen corresponding path program 1 times [2023-12-22 02:33:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:59,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574904721] [2023-12-22 02:33:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:59,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:59,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:59,198 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:59,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-22 02:33:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:59,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:59,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:59,314 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:59,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:59,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574904721] [2023-12-22 02:33:59,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574904721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:59,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:59,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:59,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165755622] [2023-12-22 02:33:59,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:59,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:59,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:59,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:59,316 INFO L87 Difference]: Start difference. First operand 3766 states and 4742 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:59,849 INFO L93 Difference]: Finished difference Result 4028 states and 5149 transitions. [2023-12-22 02:33:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:33:59,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:33:59,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:59,858 INFO L225 Difference]: With dead ends: 4028 [2023-12-22 02:33:59,858 INFO L226 Difference]: Without dead ends: 3766 [2023-12-22 02:33:59,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:59,860 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 417 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:59,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 471 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:33:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2023-12-22 02:34:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3766. [2023-12-22 02:34:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 2858 states have (on average 1.2816655003498951) internal successors, (3663), 2949 states have internal predecessors, (3663), 437 states have call successors, (437), 349 states have call predecessors, (437), 469 states have return successors, (635), 472 states have call predecessors, (635), 436 states have call successors, (635) [2023-12-22 02:34:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 4735 transitions. [2023-12-22 02:34:00,159 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 4735 transitions. Word has length 71 [2023-12-22 02:34:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:00,159 INFO L495 AbstractCegarLoop]: Abstraction has 3766 states and 4735 transitions. [2023-12-22 02:34:00,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 4735 transitions. [2023-12-22 02:34:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:00,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:00,161 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:00,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:00,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:00,365 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:00,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:00,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1560300384, now seen corresponding path program 1 times [2023-12-22 02:34:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:00,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211119515] [2023-12-22 02:34:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:00,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:00,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:00,367 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:00,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-22 02:34:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:00,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:00,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:00,464 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:00,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:00,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211119515] [2023-12-22 02:34:00,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211119515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:00,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:00,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54685127] [2023-12-22 02:34:00,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:00,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:34:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:34:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:00,465 INFO L87 Difference]: Start difference. First operand 3766 states and 4735 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:00,951 INFO L93 Difference]: Finished difference Result 4028 states and 5135 transitions. [2023-12-22 02:34:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:34:00,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:34:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:00,967 INFO L225 Difference]: With dead ends: 4028 [2023-12-22 02:34:00,967 INFO L226 Difference]: Without dead ends: 3766 [2023-12-22 02:34:00,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:34:00,969 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 411 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:00,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 464 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:34:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2023-12-22 02:34:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3766. [2023-12-22 02:34:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 2858 states have (on average 1.2792162351294611) internal successors, (3656), 2949 states have internal predecessors, (3656), 437 states have call successors, (437), 349 states have call predecessors, (437), 469 states have return successors, (635), 472 states have call predecessors, (635), 436 states have call successors, (635) [2023-12-22 02:34:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 4728 transitions. [2023-12-22 02:34:01,224 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 4728 transitions. Word has length 71 [2023-12-22 02:34:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:01,224 INFO L495 AbstractCegarLoop]: Abstraction has 3766 states and 4728 transitions. [2023-12-22 02:34:01,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 4728 transitions. [2023-12-22 02:34:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:01,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:01,226 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:01,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:01,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:01,430 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:01,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2104821468, now seen corresponding path program 1 times [2023-12-22 02:34:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:01,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428412797] [2023-12-22 02:34:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:01,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:01,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:01,432 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:01,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-22 02:34:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:01,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:01,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:01,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:01,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428412797] [2023-12-22 02:34:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428412797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:01,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169373968] [2023-12-22 02:34:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:01,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:34:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:34:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:01,550 INFO L87 Difference]: Start difference. First operand 3766 states and 4728 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:02,085 INFO L93 Difference]: Finished difference Result 4028 states and 5121 transitions. [2023-12-22 02:34:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:34:02,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:34:02,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:02,093 INFO L225 Difference]: With dead ends: 4028 [2023-12-22 02:34:02,094 INFO L226 Difference]: Without dead ends: 3766 [2023-12-22 02:34:02,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:34:02,096 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 405 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:02,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 457 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:34:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2023-12-22 02:34:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3766. [2023-12-22 02:34:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 2858 states have (on average 1.2767669699090274) internal successors, (3649), 2949 states have internal predecessors, (3649), 437 states have call successors, (437), 349 states have call predecessors, (437), 469 states have return successors, (635), 472 states have call predecessors, (635), 436 states have call successors, (635) [2023-12-22 02:34:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 4721 transitions. [2023-12-22 02:34:02,334 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 4721 transitions. Word has length 71 [2023-12-22 02:34:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:02,335 INFO L495 AbstractCegarLoop]: Abstraction has 3766 states and 4721 transitions. [2023-12-22 02:34:02,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 4721 transitions. [2023-12-22 02:34:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:02,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:02,338 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:02,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-22 02:34:02,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:02,542 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:02,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1845292000, now seen corresponding path program 1 times [2023-12-22 02:34:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769668211] [2023-12-22 02:34:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:02,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:02,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:02,544 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:02,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-22 02:34:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:02,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:02,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:02,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:02,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:02,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769668211] [2023-12-22 02:34:02,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769668211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:02,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:02,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:02,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615043064] [2023-12-22 02:34:02,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:02,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:34:02,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:02,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:34:02,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:02,659 INFO L87 Difference]: Start difference. First operand 3766 states and 4721 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:03,327 INFO L93 Difference]: Finished difference Result 4086 states and 5199 transitions. [2023-12-22 02:34:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:34:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:34:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:03,337 INFO L225 Difference]: With dead ends: 4086 [2023-12-22 02:34:03,337 INFO L226 Difference]: Without dead ends: 3824 [2023-12-22 02:34:03,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:34:03,339 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 432 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:03,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 451 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:34:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3824 states. [2023-12-22 02:34:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3824. [2023-12-22 02:34:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 2910 states have (on average 1.276975945017182) internal successors, (3716), 3001 states have internal predecessors, (3716), 439 states have call successors, (439), 353 states have call predecessors, (439), 473 states have return successors, (637), 474 states have call predecessors, (637), 438 states have call successors, (637) [2023-12-22 02:34:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4792 transitions. [2023-12-22 02:34:03,635 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4792 transitions. Word has length 71 [2023-12-22 02:34:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:03,635 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 4792 transitions. [2023-12-22 02:34:03,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4792 transitions. [2023-12-22 02:34:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:03,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:03,637 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:03,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:03,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:03,841 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:03,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash -35804764, now seen corresponding path program 1 times [2023-12-22 02:34:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520596872] [2023-12-22 02:34:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:03,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:03,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:03,843 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:03,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-22 02:34:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:03,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:03,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:03,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:03,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520596872] [2023-12-22 02:34:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520596872] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:03,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339521983] [2023-12-22 02:34:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:03,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:34:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:34:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:03,954 INFO L87 Difference]: Start difference. First operand 3824 states and 4792 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:04,528 INFO L93 Difference]: Finished difference Result 4202 states and 5341 transitions. [2023-12-22 02:34:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:34:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:34:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:04,539 INFO L225 Difference]: With dead ends: 4202 [2023-12-22 02:34:04,539 INFO L226 Difference]: Without dead ends: 3882 [2023-12-22 02:34:04,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:34:04,541 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 425 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:04,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 444 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:34:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2023-12-22 02:34:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3882. [2023-12-22 02:34:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3882 states, 2962 states have (on average 1.2758271438217421) internal successors, (3779), 3053 states have internal predecessors, (3779), 441 states have call successors, (441), 357 states have call predecessors, (441), 477 states have return successors, (639), 476 states have call predecessors, (639), 440 states have call successors, (639) [2023-12-22 02:34:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 4859 transitions. [2023-12-22 02:34:04,821 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 4859 transitions. Word has length 71 [2023-12-22 02:34:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:04,821 INFO L495 AbstractCegarLoop]: Abstraction has 3882 states and 4859 transitions. [2023-12-22 02:34:04,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 4859 transitions. [2023-12-22 02:34:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:04,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:04,823 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:04,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:05,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:05,047 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:05,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2132948609, now seen corresponding path program 1 times [2023-12-22 02:34:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207410540] [2023-12-22 02:34:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:05,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:05,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:05,050 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:05,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-22 02:34:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:05,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:05,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:05,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:05,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:05,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207410540] [2023-12-22 02:34:05,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207410540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:05,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:05,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285090461] [2023-12-22 02:34:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:34:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:05,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:34:05,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:05,149 INFO L87 Difference]: Start difference. First operand 3882 states and 4859 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:05,720 INFO L93 Difference]: Finished difference Result 4318 states and 5475 transitions. [2023-12-22 02:34:05,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:34:05,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:34:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:05,730 INFO L225 Difference]: With dead ends: 4318 [2023-12-22 02:34:05,730 INFO L226 Difference]: Without dead ends: 3940 [2023-12-22 02:34:05,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:34:05,732 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 418 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:05,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 437 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:34:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2023-12-22 02:34:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3940. [2023-12-22 02:34:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3940 states, 3014 states have (on average 1.2733908427339085) internal successors, (3838), 3105 states have internal predecessors, (3838), 443 states have call successors, (443), 361 states have call predecessors, (443), 481 states have return successors, (641), 478 states have call predecessors, (641), 442 states have call successors, (641) [2023-12-22 02:34:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 4922 transitions. [2023-12-22 02:34:06,131 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 4922 transitions. Word has length 71 [2023-12-22 02:34:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:06,131 INFO L495 AbstractCegarLoop]: Abstraction has 3940 states and 4922 transitions. [2023-12-22 02:34:06,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 4922 transitions. [2023-12-22 02:34:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:06,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:06,133 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:06,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-22 02:34:06,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:06,338 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:06,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:06,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1669778662, now seen corresponding path program 1 times [2023-12-22 02:34:06,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:06,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389826996] [2023-12-22 02:34:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:06,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:06,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:06,339 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:06,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-22 02:34:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:06,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:06,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:06,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:06,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:06,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389826996] [2023-12-22 02:34:06,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389826996] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:06,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:06,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:06,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7205514] [2023-12-22 02:34:06,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:06,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:34:06,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:06,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:34:06,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:06,434 INFO L87 Difference]: Start difference. First operand 3940 states and 4922 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:06,754 INFO L93 Difference]: Finished difference Result 4419 states and 5580 transitions. [2023-12-22 02:34:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:34:06,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:34:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:06,765 INFO L225 Difference]: With dead ends: 4419 [2023-12-22 02:34:06,766 INFO L226 Difference]: Without dead ends: 3984 [2023-12-22 02:34:06,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:06,768 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 29 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:06,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 866 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2023-12-22 02:34:07,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3944. [2023-12-22 02:34:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3018 states have (on average 1.271040424121935) internal successors, (3836), 3109 states have internal predecessors, (3836), 443 states have call successors, (443), 361 states have call predecessors, (443), 481 states have return successors, (641), 478 states have call predecessors, (641), 442 states have call successors, (641) [2023-12-22 02:34:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 4920 transitions. [2023-12-22 02:34:07,203 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 4920 transitions. Word has length 71 [2023-12-22 02:34:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:07,203 INFO L495 AbstractCegarLoop]: Abstraction has 3944 states and 4920 transitions. [2023-12-22 02:34:07,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 4920 transitions. [2023-12-22 02:34:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:07,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:07,205 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:07,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-22 02:34:07,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:07,409 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:07,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash 575800792, now seen corresponding path program 1 times [2023-12-22 02:34:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:07,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679183141] [2023-12-22 02:34:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:07,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:07,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:07,411 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:07,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-22 02:34:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:07,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:07,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:07,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:07,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:07,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679183141] [2023-12-22 02:34:07,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679183141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:07,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:07,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:07,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731078429] [2023-12-22 02:34:07,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:07,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:34:07,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:07,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:34:07,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:07,487 INFO L87 Difference]: Start difference. First operand 3944 states and 4920 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:07,885 INFO L93 Difference]: Finished difference Result 4415 states and 5560 transitions. [2023-12-22 02:34:07,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:34:07,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:34:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:07,894 INFO L225 Difference]: With dead ends: 4415 [2023-12-22 02:34:07,895 INFO L226 Difference]: Without dead ends: 3976 [2023-12-22 02:34:07,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:07,896 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 20 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:07,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 870 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:34:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3976 states. [2023-12-22 02:34:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3976 to 3948. [2023-12-22 02:34:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3022 states have (on average 1.2686962276637987) internal successors, (3834), 3113 states have internal predecessors, (3834), 443 states have call successors, (443), 361 states have call predecessors, (443), 481 states have return successors, (641), 478 states have call predecessors, (641), 442 states have call successors, (641) [2023-12-22 02:34:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 4918 transitions. [2023-12-22 02:34:08,192 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 4918 transitions. Word has length 71 [2023-12-22 02:34:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:08,192 INFO L495 AbstractCegarLoop]: Abstraction has 3948 states and 4918 transitions. [2023-12-22 02:34:08,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 4918 transitions. [2023-12-22 02:34:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:08,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:08,195 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:08,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-22 02:34:08,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:08,401 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:08,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1269566374, now seen corresponding path program 1 times [2023-12-22 02:34:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769017127] [2023-12-22 02:34:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:08,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:08,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:08,403 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:08,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-22 02:34:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:08,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:08,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:08,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:08,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769017127] [2023-12-22 02:34:08,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769017127] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:08,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:08,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276901429] [2023-12-22 02:34:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:08,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:34:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:08,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:34:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:08,475 INFO L87 Difference]: Start difference. First operand 3948 states and 4918 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:08,838 INFO L93 Difference]: Finished difference Result 4471 states and 5622 transitions. [2023-12-22 02:34:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:34:08,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:34:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:08,849 INFO L225 Difference]: With dead ends: 4471 [2023-12-22 02:34:08,850 INFO L226 Difference]: Without dead ends: 4028 [2023-12-22 02:34:08,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:08,852 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 11 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:08,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 868 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2023-12-22 02:34:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 3964. [2023-12-22 02:34:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3038 states have (on average 1.2672811059907834) internal successors, (3850), 3129 states have internal predecessors, (3850), 443 states have call successors, (443), 361 states have call predecessors, (443), 481 states have return successors, (641), 478 states have call predecessors, (641), 442 states have call successors, (641) [2023-12-22 02:34:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 4934 transitions. [2023-12-22 02:34:09,193 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 4934 transitions. Word has length 71 [2023-12-22 02:34:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:09,193 INFO L495 AbstractCegarLoop]: Abstraction has 3964 states and 4934 transitions. [2023-12-22 02:34:09,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 4934 transitions. [2023-12-22 02:34:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:09,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:09,197 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:09,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:09,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:09,401 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:09,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash 781417624, now seen corresponding path program 1 times [2023-12-22 02:34:09,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:09,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314895923] [2023-12-22 02:34:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:09,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:09,403 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:09,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-22 02:34:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:09,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:09,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:09,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:09,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:09,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314895923] [2023-12-22 02:34:09,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314895923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:09,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:09,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:09,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623220421] [2023-12-22 02:34:09,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:09,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:34:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:34:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:09,475 INFO L87 Difference]: Start difference. First operand 3964 states and 4934 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:09,784 INFO L93 Difference]: Finished difference Result 4431 states and 5554 transitions. [2023-12-22 02:34:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:34:09,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2023-12-22 02:34:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:09,792 INFO L225 Difference]: With dead ends: 4431 [2023-12-22 02:34:09,792 INFO L226 Difference]: Without dead ends: 3972 [2023-12-22 02:34:09,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:09,794 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 2 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:09,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 868 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2023-12-22 02:34:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 3968. [2023-12-22 02:34:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3042 states have (on average 1.264957264957265) internal successors, (3848), 3133 states have internal predecessors, (3848), 443 states have call successors, (443), 361 states have call predecessors, (443), 481 states have return successors, (641), 478 states have call predecessors, (641), 442 states have call successors, (641) [2023-12-22 02:34:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 4932 transitions. [2023-12-22 02:34:10,149 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 4932 transitions. Word has length 71 [2023-12-22 02:34:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:10,149 INFO L495 AbstractCegarLoop]: Abstraction has 3968 states and 4932 transitions. [2023-12-22 02:34:10,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:34:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 4932 transitions. [2023-12-22 02:34:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:34:10,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:10,151 INFO L195 NwaCegarLoop]: 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] [2023-12-22 02:34:10,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:10,352 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:10,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2127346278, now seen corresponding path program 1 times [2023-12-22 02:34:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156959614] [2023-12-22 02:34:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:10,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:10,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:10,355 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:10,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-22 02:34:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:10,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:10,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:10,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:10,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:10,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156959614] [2023-12-22 02:34:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156959614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:10,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:34:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113485627] [2023-12-22 02:34:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:10,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:10,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:10,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:10,494 INFO L87 Difference]: Start difference. First operand 3968 states and 4932 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-22 02:34:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:10,841 INFO L93 Difference]: Finished difference Result 4873 states and 6099 transitions. [2023-12-22 02:34:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:10,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 71 [2023-12-22 02:34:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:10,850 INFO L225 Difference]: With dead ends: 4873 [2023-12-22 02:34:10,850 INFO L226 Difference]: Without dead ends: 4410 [2023-12-22 02:34:10,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:10,852 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 238 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:10,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 481 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2023-12-22 02:34:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4408. [2023-12-22 02:34:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 3426 states have (on average 1.2644483362521892) internal successors, (4332), 3520 states have internal predecessors, (4332), 474 states have call successors, (474), 385 states have call predecessors, (474), 506 states have return successors, (673), 507 states have call predecessors, (673), 473 states have call successors, (673) [2023-12-22 02:34:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5479 transitions. [2023-12-22 02:34:11,188 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5479 transitions. Word has length 71 [2023-12-22 02:34:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:11,188 INFO L495 AbstractCegarLoop]: Abstraction has 4408 states and 5479 transitions. [2023-12-22 02:34:11,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-22 02:34:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5479 transitions. [2023-12-22 02:34:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-22 02:34:11,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:11,190 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:34:11,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:11,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:11,406 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:11,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:11,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1810871584, now seen corresponding path program 1 times [2023-12-22 02:34:11,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:11,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174444290] [2023-12-22 02:34:11,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:11,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:11,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:11,407 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:11,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-22 02:34:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:11,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:11,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:34:11,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:11,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:11,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174444290] [2023-12-22 02:34:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174444290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:11,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:34:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726135408] [2023-12-22 02:34:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:11,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:11,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:11,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:11,495 INFO L87 Difference]: Start difference. First operand 4408 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:34:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:12,132 INFO L93 Difference]: Finished difference Result 10845 states and 13438 transitions. [2023-12-22 02:34:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:12,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2023-12-22 02:34:12,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:12,142 INFO L225 Difference]: With dead ends: 10845 [2023-12-22 02:34:12,143 INFO L226 Difference]: Without dead ends: 6056 [2023-12-22 02:34:12,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:12,148 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 84 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:12,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 648 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2023-12-22 02:34:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2023-12-22 02:34:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6056 states, 4636 states have (on average 1.2512942191544434) internal successors, (5801), 4775 states have internal predecessors, (5801), 672 states have call successors, (672), 553 states have call predecessors, (672), 746 states have return successors, (997), 732 states have call predecessors, (997), 671 states have call successors, (997) [2023-12-22 02:34:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 7470 transitions. [2023-12-22 02:34:12,693 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 7470 transitions. Word has length 76 [2023-12-22 02:34:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:12,693 INFO L495 AbstractCegarLoop]: Abstraction has 6056 states and 7470 transitions. [2023-12-22 02:34:12,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:34:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 7470 transitions. [2023-12-22 02:34:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-22 02:34:12,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:12,696 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-22 02:34:12,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:12,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:12,900 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:12,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash -246838170, now seen corresponding path program 1 times [2023-12-22 02:34:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686689399] [2023-12-22 02:34:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:12,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:12,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:12,906 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:12,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-22 02:34:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:12,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:12,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-22 02:34:13,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:13,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:13,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686689399] [2023-12-22 02:34:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686689399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:13,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:13,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:13,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153041424] [2023-12-22 02:34:13,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:13,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:34:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:13,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:34:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:13,019 INFO L87 Difference]: Start difference. First operand 6056 states and 7470 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:34:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:13,764 INFO L93 Difference]: Finished difference Result 11203 states and 13802 transitions. [2023-12-22 02:34:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:34:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2023-12-22 02:34:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:13,776 INFO L225 Difference]: With dead ends: 11203 [2023-12-22 02:34:13,777 INFO L226 Difference]: Without dead ends: 6086 [2023-12-22 02:34:13,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:13,785 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 386 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:13,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 335 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:34:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2023-12-22 02:34:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 6086. [2023-12-22 02:34:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 4651 states have (on average 1.2362932702644593) internal successors, (5750), 4805 states have internal predecessors, (5750), 672 states have call successors, (672), 553 states have call predecessors, (672), 761 states have return successors, (997), 732 states have call predecessors, (997), 671 states have call successors, (997) [2023-12-22 02:34:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 7419 transitions. [2023-12-22 02:34:14,305 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 7419 transitions. Word has length 85 [2023-12-22 02:34:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:14,306 INFO L495 AbstractCegarLoop]: Abstraction has 6086 states and 7419 transitions. [2023-12-22 02:34:14,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:34:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 7419 transitions. [2023-12-22 02:34:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-22 02:34:14,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:14,308 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-22 02:34:14,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:14,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:14,512 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:14,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash -826737294, now seen corresponding path program 1 times [2023-12-22 02:34:14,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:14,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743491869] [2023-12-22 02:34:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:14,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:14,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:14,514 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:14,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-22 02:34:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:14,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:14,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-22 02:34:14,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:14,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743491869] [2023-12-22 02:34:14,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743491869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:14,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:14,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:34:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819807061] [2023-12-22 02:34:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:14,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:14,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:14,607 INFO L87 Difference]: Start difference. First operand 6086 states and 7419 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:34:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:15,196 INFO L93 Difference]: Finished difference Result 10992 states and 13357 transitions. [2023-12-22 02:34:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:15,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2023-12-22 02:34:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:15,210 INFO L225 Difference]: With dead ends: 10992 [2023-12-22 02:34:15,210 INFO L226 Difference]: Without dead ends: 5835 [2023-12-22 02:34:15,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:15,219 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 95 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:15,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 639 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2023-12-22 02:34:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5832. [2023-12-22 02:34:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5832 states, 4467 states have (on average 1.2249832102081935) internal successors, (5472), 4615 states have internal predecessors, (5472), 634 states have call successors, (634), 525 states have call predecessors, (634), 729 states have return successors, (880), 694 states have call predecessors, (880), 633 states have call successors, (880) [2023-12-22 02:34:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5832 states to 5832 states and 6986 transitions. [2023-12-22 02:34:15,727 INFO L78 Accepts]: Start accepts. Automaton has 5832 states and 6986 transitions. Word has length 86 [2023-12-22 02:34:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:15,727 INFO L495 AbstractCegarLoop]: Abstraction has 5832 states and 6986 transitions. [2023-12-22 02:34:15,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:34:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5832 states and 6986 transitions. [2023-12-22 02:34:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-22 02:34:15,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:15,730 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:15,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-22 02:34:15,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:15,933 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:15,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1054771960, now seen corresponding path program 1 times [2023-12-22 02:34:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:15,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52235323] [2023-12-22 02:34:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:15,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:15,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:15,935 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:15,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-22 02:34:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:16,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:16,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-22 02:34:16,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:16,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:16,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52235323] [2023-12-22 02:34:16,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52235323] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:16,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:34:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349620663] [2023-12-22 02:34:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:16,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:16,088 INFO L87 Difference]: Start difference. First operand 5832 states and 6986 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:34:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:16,734 INFO L93 Difference]: Finished difference Result 7585 states and 9217 transitions. [2023-12-22 02:34:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:16,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2023-12-22 02:34:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:16,746 INFO L225 Difference]: With dead ends: 7585 [2023-12-22 02:34:16,746 INFO L226 Difference]: Without dead ends: 6682 [2023-12-22 02:34:16,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:16,749 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 232 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:16,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 449 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2023-12-22 02:34:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 6676. [2023-12-22 02:34:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6676 states, 5211 states have (on average 1.2285549798503166) internal successors, (6402), 5363 states have internal predecessors, (6402), 688 states have call successors, (688), 569 states have call predecessors, (688), 775 states have return successors, (936), 746 states have call predecessors, (936), 687 states have call successors, (936) [2023-12-22 02:34:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6676 states to 6676 states and 8026 transitions. [2023-12-22 02:34:17,305 INFO L78 Accepts]: Start accepts. Automaton has 6676 states and 8026 transitions. Word has length 115 [2023-12-22 02:34:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:17,305 INFO L495 AbstractCegarLoop]: Abstraction has 6676 states and 8026 transitions. [2023-12-22 02:34:17,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:34:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6676 states and 8026 transitions. [2023-12-22 02:34:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-22 02:34:17,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:17,308 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:17,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:17,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:17,512 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:17,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1375456791, now seen corresponding path program 1 times [2023-12-22 02:34:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:17,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478879265] [2023-12-22 02:34:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:17,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:17,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:17,514 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:17,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-22 02:34:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:17,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:34:17,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:34:17,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:17,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:17,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478879265] [2023-12-22 02:34:17,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478879265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:17,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:17,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:17,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064605050] [2023-12-22 02:34:17,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:17,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:34:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:17,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:34:17,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:17,688 INFO L87 Difference]: Start difference. First operand 6676 states and 8026 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:34:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:18,534 INFO L93 Difference]: Finished difference Result 10178 states and 12415 transitions. [2023-12-22 02:34:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:34:18,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 115 [2023-12-22 02:34:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:18,562 INFO L225 Difference]: With dead ends: 10178 [2023-12-22 02:34:18,566 INFO L226 Difference]: Without dead ends: 8432 [2023-12-22 02:34:18,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:18,571 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 375 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:18,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 507 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:34:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8432 states. [2023-12-22 02:34:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8432 to 8430. [2023-12-22 02:34:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8430 states, 6754 states have (on average 1.2317145395321292) internal successors, (8319), 6919 states have internal predecessors, (8319), 799 states have call successors, (799), 657 states have call predecessors, (799), 875 states have return successors, (1083), 857 states have call predecessors, (1083), 798 states have call successors, (1083) [2023-12-22 02:34:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8430 states to 8430 states and 10201 transitions. [2023-12-22 02:34:19,291 INFO L78 Accepts]: Start accepts. Automaton has 8430 states and 10201 transitions. Word has length 115 [2023-12-22 02:34:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:19,291 INFO L495 AbstractCegarLoop]: Abstraction has 8430 states and 10201 transitions. [2023-12-22 02:34:19,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:34:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 8430 states and 10201 transitions. [2023-12-22 02:34:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-22 02:34:19,295 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:19,295 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:19,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:19,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:19,499 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:19,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash 946345127, now seen corresponding path program 1 times [2023-12-22 02:34:19,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:19,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945296089] [2023-12-22 02:34:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:19,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:19,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:19,501 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:19,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-22 02:34:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:19,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:19,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-22 02:34:19,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:19,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945296089] [2023-12-22 02:34:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945296089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:19,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:19,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:34:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180267420] [2023-12-22 02:34:19,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:19,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:19,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:19,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:19,607 INFO L87 Difference]: Start difference. First operand 8430 states and 10201 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:34:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:20,293 INFO L93 Difference]: Finished difference Result 11092 states and 13502 transitions. [2023-12-22 02:34:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:20,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2023-12-22 02:34:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:20,306 INFO L225 Difference]: With dead ends: 11092 [2023-12-22 02:34:20,306 INFO L226 Difference]: Without dead ends: 7592 [2023-12-22 02:34:20,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:20,312 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 188 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:20,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 399 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7592 states. [2023-12-22 02:34:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7592 to 7592. [2023-12-22 02:34:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7592 states, 6019 states have (on average 1.2292739657750458) internal successors, (7399), 6179 states have internal predecessors, (7399), 742 states have call successors, (742), 613 states have call predecessors, (742), 829 states have return successors, (1012), 802 states have call predecessors, (1012), 741 states have call successors, (1012) [2023-12-22 02:34:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7592 states to 7592 states and 9153 transitions. [2023-12-22 02:34:20,931 INFO L78 Accepts]: Start accepts. Automaton has 7592 states and 9153 transitions. Word has length 115 [2023-12-22 02:34:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:20,931 INFO L495 AbstractCegarLoop]: Abstraction has 7592 states and 9153 transitions. [2023-12-22 02:34:20,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:34:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 7592 states and 9153 transitions. [2023-12-22 02:34:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-22 02:34:20,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:20,935 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:20,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:21,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:21,139 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:21,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash -540066076, now seen corresponding path program 1 times [2023-12-22 02:34:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116075151] [2023-12-22 02:34:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:21,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:21,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:21,141 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:21,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-22 02:34:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:21,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:34:21,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:34:21,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:21,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:21,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116075151] [2023-12-22 02:34:21,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116075151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:21,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:21,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:21,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768001173] [2023-12-22 02:34:21,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:21,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:34:21,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:21,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:34:21,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:21,369 INFO L87 Difference]: Start difference. First operand 7592 states and 9153 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:34:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:22,522 INFO L93 Difference]: Finished difference Result 12999 states and 15827 transitions. [2023-12-22 02:34:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:34:22,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 117 [2023-12-22 02:34:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:22,550 INFO L225 Difference]: With dead ends: 12999 [2023-12-22 02:34:22,551 INFO L226 Difference]: Without dead ends: 10337 [2023-12-22 02:34:22,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:22,571 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 368 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:22,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 539 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:34:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10337 states. [2023-12-22 02:34:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10337 to 10167. [2023-12-22 02:34:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10167 states, 8247 states have (on average 1.2271128895355887) internal successors, (10120), 8464 states have internal predecessors, (10120), 891 states have call successors, (891), 725 states have call predecessors, (891), 1027 states have return successors, (1282), 981 states have call predecessors, (1282), 890 states have call successors, (1282) [2023-12-22 02:34:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10167 states to 10167 states and 12293 transitions. [2023-12-22 02:34:23,415 INFO L78 Accepts]: Start accepts. Automaton has 10167 states and 12293 transitions. Word has length 117 [2023-12-22 02:34:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:23,415 INFO L495 AbstractCegarLoop]: Abstraction has 10167 states and 12293 transitions. [2023-12-22 02:34:23,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:34:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 10167 states and 12293 transitions. [2023-12-22 02:34:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-22 02:34:23,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:23,420 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:23,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:23,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:23,624 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:23,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1578650650, now seen corresponding path program 1 times [2023-12-22 02:34:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:23,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114741591] [2023-12-22 02:34:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:23,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:23,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:23,626 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:23,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-22 02:34:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:23,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:23,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-22 02:34:23,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:23,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:23,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114741591] [2023-12-22 02:34:23,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114741591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:23,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:23,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:34:23,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729209735] [2023-12-22 02:34:23,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:23,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:23,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:23,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:23,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:23,718 INFO L87 Difference]: Start difference. First operand 10167 states and 12293 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:34:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:24,436 INFO L93 Difference]: Finished difference Result 15400 states and 18726 transitions. [2023-12-22 02:34:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:24,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2023-12-22 02:34:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:24,453 INFO L225 Difference]: With dead ends: 15400 [2023-12-22 02:34:24,453 INFO L226 Difference]: Without dead ends: 10162 [2023-12-22 02:34:24,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:24,459 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 186 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:24,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 398 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10162 states. [2023-12-22 02:34:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10162 to 10162. [2023-12-22 02:34:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10162 states, 8245 states have (on average 1.2269254093389934) internal successors, (10116), 8461 states have internal predecessors, (10116), 888 states have call successors, (888), 725 states have call predecessors, (888), 1027 states have return successors, (1278), 978 states have call predecessors, (1278), 887 states have call successors, (1278) [2023-12-22 02:34:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10162 states to 10162 states and 12282 transitions. [2023-12-22 02:34:25,216 INFO L78 Accepts]: Start accepts. Automaton has 10162 states and 12282 transitions. Word has length 117 [2023-12-22 02:34:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:25,216 INFO L495 AbstractCegarLoop]: Abstraction has 10162 states and 12282 transitions. [2023-12-22 02:34:25,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:34:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 10162 states and 12282 transitions. [2023-12-22 02:34:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-22 02:34:25,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:25,220 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:25,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:25,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:25,424 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:25,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1822408937, now seen corresponding path program 1 times [2023-12-22 02:34:25,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:25,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117171746] [2023-12-22 02:34:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:25,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:25,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:25,426 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:25,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-22 02:34:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:25,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:34:25,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:34:25,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:25,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:25,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117171746] [2023-12-22 02:34:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117171746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:25,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:25,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578767392] [2023-12-22 02:34:25,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:25,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:34:25,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:25,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:34:25,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:25,638 INFO L87 Difference]: Start difference. First operand 10162 states and 12282 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:34:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:26,939 INFO L93 Difference]: Finished difference Result 19642 states and 23955 transitions. [2023-12-22 02:34:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:34:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 119 [2023-12-22 02:34:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:26,973 INFO L225 Difference]: With dead ends: 19642 [2023-12-22 02:34:26,974 INFO L226 Difference]: Without dead ends: 14410 [2023-12-22 02:34:26,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:26,984 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 357 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:26,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 492 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:34:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14410 states. [2023-12-22 02:34:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14410 to 14408. [2023-12-22 02:34:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14408 states, 11920 states have (on average 1.226258389261745) internal successors, (14617), 12209 states have internal predecessors, (14617), 1159 states have call successors, (1159), 925 states have call predecessors, (1159), 1327 states have return successors, (1707), 1277 states have call predecessors, (1707), 1158 states have call successors, (1707) [2023-12-22 02:34:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14408 states to 14408 states and 17483 transitions. [2023-12-22 02:34:28,011 INFO L78 Accepts]: Start accepts. Automaton has 14408 states and 17483 transitions. Word has length 119 [2023-12-22 02:34:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:28,013 INFO L495 AbstractCegarLoop]: Abstraction has 14408 states and 17483 transitions. [2023-12-22 02:34:28,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:34:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 14408 states and 17483 transitions. [2023-12-22 02:34:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-22 02:34:28,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:28,019 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:28,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:28,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:28,223 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:28,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:28,224 INFO L85 PathProgramCache]: Analyzing trace with hash -308941785, now seen corresponding path program 1 times [2023-12-22 02:34:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:28,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408839068] [2023-12-22 02:34:28,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:28,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:28,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:28,225 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:28,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-22 02:34:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:28,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:28,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-22 02:34:28,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:28,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408839068] [2023-12-22 02:34:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408839068] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:34:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409400245] [2023-12-22 02:34:28,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:28,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:28,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:28,310 INFO L87 Difference]: Start difference. First operand 14408 states and 17483 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:34:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:29,271 INFO L93 Difference]: Finished difference Result 23882 states and 29108 transitions. [2023-12-22 02:34:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 119 [2023-12-22 02:34:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:29,300 INFO L225 Difference]: With dead ends: 23882 [2023-12-22 02:34:29,300 INFO L226 Difference]: Without dead ends: 14404 [2023-12-22 02:34:29,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:29,314 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 184 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:29,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 397 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14404 states. [2023-12-22 02:34:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14404 to 14404. [2023-12-22 02:34:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14404 states, 11919 states have (on average 1.2261934726067623) internal successors, (14615), 12207 states have internal predecessors, (14615), 1156 states have call successors, (1156), 925 states have call predecessors, (1156), 1327 states have return successors, (1704), 1274 states have call predecessors, (1704), 1155 states have call successors, (1704) [2023-12-22 02:34:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14404 states to 14404 states and 17475 transitions. [2023-12-22 02:34:30,420 INFO L78 Accepts]: Start accepts. Automaton has 14404 states and 17475 transitions. Word has length 119 [2023-12-22 02:34:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:30,420 INFO L495 AbstractCegarLoop]: Abstraction has 14404 states and 17475 transitions. [2023-12-22 02:34:30,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:34:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14404 states and 17475 transitions. [2023-12-22 02:34:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-22 02:34:30,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:30,426 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:30,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:30,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:30,630 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:30,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:30,631 INFO L85 PathProgramCache]: Analyzing trace with hash -343544668, now seen corresponding path program 1 times [2023-12-22 02:34:30,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:30,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748643916] [2023-12-22 02:34:30,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:30,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:30,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:30,633 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:30,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-12-22 02:34:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:30,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:30,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:34:30,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:30,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:30,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748643916] [2023-12-22 02:34:30,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748643916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:30,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:30,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:34:30,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251059152] [2023-12-22 02:34:30,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:30,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:30,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:30,733 INFO L87 Difference]: Start difference. First operand 14404 states and 17475 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:34:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:32,068 INFO L93 Difference]: Finished difference Result 30925 states and 37954 transitions. [2023-12-22 02:34:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:32,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 121 [2023-12-22 02:34:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:32,119 INFO L225 Difference]: With dead ends: 30925 [2023-12-22 02:34:32,119 INFO L226 Difference]: Without dead ends: 17972 [2023-12-22 02:34:32,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:32,138 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 150 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:32,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 711 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17972 states. [2023-12-22 02:34:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17972 to 17972. [2023-12-22 02:34:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17972 states, 15015 states have (on average 1.2247752247752248) internal successors, (18390), 15339 states have internal predecessors, (18390), 1400 states have call successors, (1400), 1101 states have call predecessors, (1400), 1555 states have return successors, (2088), 1534 states have call predecessors, (2088), 1399 states have call successors, (2088) [2023-12-22 02:34:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17972 states to 17972 states and 21878 transitions. [2023-12-22 02:34:33,539 INFO L78 Accepts]: Start accepts. Automaton has 17972 states and 21878 transitions. Word has length 121 [2023-12-22 02:34:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:33,540 INFO L495 AbstractCegarLoop]: Abstraction has 17972 states and 21878 transitions. [2023-12-22 02:34:33,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:34:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 17972 states and 21878 transitions. [2023-12-22 02:34:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-22 02:34:33,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:33,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:33,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:33,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:33,752 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:33,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:33,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1710456963, now seen corresponding path program 1 times [2023-12-22 02:34:33,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:33,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392502077] [2023-12-22 02:34:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:33,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:33,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:33,755 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:33,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-22 02:34:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:33,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:33,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-22 02:34:33,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:33,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:33,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392502077] [2023-12-22 02:34:33,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392502077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:33,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:33,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376606532] [2023-12-22 02:34:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:33,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:34:33,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:33,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:34:33,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:33,889 INFO L87 Difference]: Start difference. First operand 17972 states and 21878 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-22 02:34:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:36,127 INFO L93 Difference]: Finished difference Result 25223 states and 30564 transitions. [2023-12-22 02:34:36,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:34:36,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 145 [2023-12-22 02:34:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:36,164 INFO L225 Difference]: With dead ends: 25223 [2023-12-22 02:34:36,165 INFO L226 Difference]: Without dead ends: 20115 [2023-12-22 02:34:36,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:34:36,175 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 421 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:36,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 452 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 02:34:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20115 states. [2023-12-22 02:34:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20115 to 19795. [2023-12-22 02:34:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19795 states, 16349 states have (on average 1.224233898097743) internal successors, (20015), 16709 states have internal predecessors, (20015), 1620 states have call successors, (1620), 1290 states have call predecessors, (1620), 1824 states have return successors, (2382), 1797 states have call predecessors, (2382), 1619 states have call successors, (2382) [2023-12-22 02:34:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19795 states to 19795 states and 24017 transitions. [2023-12-22 02:34:37,701 INFO L78 Accepts]: Start accepts. Automaton has 19795 states and 24017 transitions. Word has length 145 [2023-12-22 02:34:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:37,701 INFO L495 AbstractCegarLoop]: Abstraction has 19795 states and 24017 transitions. [2023-12-22 02:34:37,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-22 02:34:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 19795 states and 24017 transitions. [2023-12-22 02:34:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-22 02:34:37,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:37,710 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:37,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:37,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:37,914 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:37,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash 998967662, now seen corresponding path program 1 times [2023-12-22 02:34:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:37,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344363676] [2023-12-22 02:34:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:37,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:37,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:37,916 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:37,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-22 02:34:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:38,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:38,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:34:38,128 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:38,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:38,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344363676] [2023-12-22 02:34:38,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344363676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:38,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:34:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452169454] [2023-12-22 02:34:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:38,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:38,130 INFO L87 Difference]: Start difference. First operand 19795 states and 24017 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-22 02:34:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:39,831 INFO L93 Difference]: Finished difference Result 36412 states and 44557 transitions. [2023-12-22 02:34:39,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:39,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 152 [2023-12-22 02:34:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:39,873 INFO L225 Difference]: With dead ends: 36412 [2023-12-22 02:34:39,874 INFO L226 Difference]: Without dead ends: 23369 [2023-12-22 02:34:39,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:39,892 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 204 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:39,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 440 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23369 states. [2023-12-22 02:34:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23369 to 23333. [2023-12-22 02:34:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23333 states, 19415 states have (on average 1.2183878444501675) internal successors, (23655), 19811 states have internal predecessors, (23655), 1864 states have call successors, (1864), 1466 states have call predecessors, (1864), 2052 states have return successors, (2724), 2057 states have call predecessors, (2724), 1863 states have call successors, (2724) [2023-12-22 02:34:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23333 states to 23333 states and 28243 transitions. [2023-12-22 02:34:41,717 INFO L78 Accepts]: Start accepts. Automaton has 23333 states and 28243 transitions. Word has length 152 [2023-12-22 02:34:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:41,718 INFO L495 AbstractCegarLoop]: Abstraction has 23333 states and 28243 transitions. [2023-12-22 02:34:41,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-22 02:34:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 23333 states and 28243 transitions. [2023-12-22 02:34:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-22 02:34:41,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:41,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-22 02:34:41,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:41,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:41,935 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:41,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1595896207, now seen corresponding path program 1 times [2023-12-22 02:34:41,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:41,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370181556] [2023-12-22 02:34:41,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:41,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:41,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:41,937 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:41,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-22 02:34:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:42,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:42,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-22 02:34:42,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:42,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:42,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370181556] [2023-12-22 02:34:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370181556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:42,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:42,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:34:42,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168946043] [2023-12-22 02:34:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:42,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:34:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:42,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:34:42,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:34:42,120 INFO L87 Difference]: Start difference. First operand 23333 states and 28243 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:34:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:44,131 INFO L93 Difference]: Finished difference Result 40167 states and 48924 transitions. [2023-12-22 02:34:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:34:44,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 173 [2023-12-22 02:34:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:44,182 INFO L225 Difference]: With dead ends: 40167 [2023-12-22 02:34:44,182 INFO L226 Difference]: Without dead ends: 23587 [2023-12-22 02:34:44,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:44,203 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 378 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:44,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 432 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:34:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23587 states. [2023-12-22 02:34:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23587 to 23587. [2023-12-22 02:34:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23587 states, 19633 states have (on average 1.2112769316966332) internal successors, (23781), 20047 states have internal predecessors, (23781), 1864 states have call successors, (1864), 1466 states have call predecessors, (1864), 2088 states have return successors, (2622), 2075 states have call predecessors, (2622), 1863 states have call successors, (2622) [2023-12-22 02:34:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23587 states to 23587 states and 28267 transitions. [2023-12-22 02:34:46,567 INFO L78 Accepts]: Start accepts. Automaton has 23587 states and 28267 transitions. Word has length 173 [2023-12-22 02:34:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:46,567 INFO L495 AbstractCegarLoop]: Abstraction has 23587 states and 28267 transitions. [2023-12-22 02:34:46,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:34:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 23587 states and 28267 transitions. [2023-12-22 02:34:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-22 02:34:46,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:46,580 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-22 02:34:46,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:46,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:46,785 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:46,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1476393510, now seen corresponding path program 1 times [2023-12-22 02:34:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645732849] [2023-12-22 02:34:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:46,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:46,787 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:46,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-22 02:34:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:46,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:46,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-22 02:34:46,900 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:46,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:46,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645732849] [2023-12-22 02:34:46,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645732849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:46,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:46,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:34:46,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523734051] [2023-12-22 02:34:46,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:46,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:46,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:46,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:46,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:46,901 INFO L87 Difference]: Start difference. First operand 23587 states and 28267 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:34:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:48,690 INFO L93 Difference]: Finished difference Result 36903 states and 44387 transitions. [2023-12-22 02:34:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:48,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 174 [2023-12-22 02:34:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:48,730 INFO L225 Difference]: With dead ends: 36903 [2023-12-22 02:34:48,731 INFO L226 Difference]: Without dead ends: 23589 [2023-12-22 02:34:48,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:48,745 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 143 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:48,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 701 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23589 states. [2023-12-22 02:34:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23589 to 23587. [2023-12-22 02:34:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23587 states, 19633 states have (on average 1.2093414149646005) internal successors, (23743), 20047 states have internal predecessors, (23743), 1864 states have call successors, (1864), 1466 states have call predecessors, (1864), 2088 states have return successors, (2616), 2075 states have call predecessors, (2616), 1863 states have call successors, (2616) [2023-12-22 02:34:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23587 states to 23587 states and 28223 transitions. [2023-12-22 02:34:50,757 INFO L78 Accepts]: Start accepts. Automaton has 23587 states and 28223 transitions. Word has length 174 [2023-12-22 02:34:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:50,757 INFO L495 AbstractCegarLoop]: Abstraction has 23587 states and 28223 transitions. [2023-12-22 02:34:50,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:34:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 23587 states and 28223 transitions. [2023-12-22 02:34:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-22 02:34:50,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:50,770 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:50,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:50,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:50,974 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:50,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:50,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1072823416, now seen corresponding path program 1 times [2023-12-22 02:34:50,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:50,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328718965] [2023-12-22 02:34:50,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:50,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:50,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:50,977 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:50,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-12-22 02:34:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:51,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:34:51,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-12-22 02:34:51,106 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:51,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328718965] [2023-12-22 02:34:51,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328718965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:51,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:51,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:34:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269815075] [2023-12-22 02:34:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:51,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:34:51,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:51,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:34:51,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:34:51,109 INFO L87 Difference]: Start difference. First operand 23587 states and 28223 transitions. Second operand has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-22 02:34:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:52,662 INFO L93 Difference]: Finished difference Result 27419 states and 32892 transitions. [2023-12-22 02:34:52,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:34:52,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 217 [2023-12-22 02:34:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:52,706 INFO L225 Difference]: With dead ends: 27419 [2023-12-22 02:34:52,706 INFO L226 Difference]: Without dead ends: 20686 [2023-12-22 02:34:52,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:34:52,722 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 32 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:52,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1399 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:34:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20686 states. [2023-12-22 02:34:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20686 to 19794. [2023-12-22 02:34:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19794 states, 16928 states have (on average 1.2075850661625709) internal successors, (20442), 17218 states have internal predecessors, (20442), 1369 states have call successors, (1369), 1027 states have call predecessors, (1369), 1495 states have return successors, (1937), 1549 states have call predecessors, (1937), 1368 states have call successors, (1937) [2023-12-22 02:34:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19794 states to 19794 states and 23748 transitions. [2023-12-22 02:34:54,175 INFO L78 Accepts]: Start accepts. Automaton has 19794 states and 23748 transitions. Word has length 217 [2023-12-22 02:34:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:54,175 INFO L495 AbstractCegarLoop]: Abstraction has 19794 states and 23748 transitions. [2023-12-22 02:34:54,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-22 02:34:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19794 states and 23748 transitions. [2023-12-22 02:34:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-22 02:34:54,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:54,186 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:54,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:54,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:54,391 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:54,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash -826233885, now seen corresponding path program 1 times [2023-12-22 02:34:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:54,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689479114] [2023-12-22 02:34:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:54,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:54,393 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:54,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-12-22 02:34:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:54,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:54,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-22 02:34:54,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:54,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:54,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689479114] [2023-12-22 02:34:54,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689479114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:54,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:54,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:34:54,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300443553] [2023-12-22 02:34:54,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:54,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:54,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:54,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:54,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:54,664 INFO L87 Difference]: Start difference. First operand 19794 states and 23748 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-22 02:34:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:56,194 INFO L93 Difference]: Finished difference Result 39545 states and 47486 transitions. [2023-12-22 02:34:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:56,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 205 [2023-12-22 02:34:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:56,236 INFO L225 Difference]: With dead ends: 39545 [2023-12-22 02:34:56,236 INFO L226 Difference]: Without dead ends: 22710 [2023-12-22 02:34:56,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:56,257 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 186 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:56,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 470 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22710 states. [2023-12-22 02:34:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22710 to 22662. [2023-12-22 02:34:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22662 states, 19404 states have (on average 1.199443413729128) internal successors, (23274), 19710 states have internal predecessors, (23274), 1589 states have call successors, (1589), 1179 states have call predecessors, (1589), 1667 states have return successors, (2189), 1773 states have call predecessors, (2189), 1588 states have call successors, (2189) [2023-12-22 02:34:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22662 states to 22662 states and 27052 transitions. [2023-12-22 02:34:57,909 INFO L78 Accepts]: Start accepts. Automaton has 22662 states and 27052 transitions. Word has length 205 [2023-12-22 02:34:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:57,910 INFO L495 AbstractCegarLoop]: Abstraction has 22662 states and 27052 transitions. [2023-12-22 02:34:57,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-22 02:34:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 22662 states and 27052 transitions. [2023-12-22 02:34:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-22 02:34:57,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:57,924 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:34:57,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-12-22 02:34:58,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:58,129 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:58,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1704115649, now seen corresponding path program 1 times [2023-12-22 02:34:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355580564] [2023-12-22 02:34:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:58,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:58,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:58,132 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:58,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-22 02:34:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:58,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:58,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-22 02:34:58,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:58,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:58,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355580564] [2023-12-22 02:34:58,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355580564] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:58,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:58,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:34:58,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160736692] [2023-12-22 02:34:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:58,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:58,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:58,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:58,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:58,286 INFO L87 Difference]: Start difference. First operand 22662 states and 27052 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:34:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:59,860 INFO L93 Difference]: Finished difference Result 39498 states and 47288 transitions. [2023-12-22 02:34:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 208 [2023-12-22 02:34:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:59,910 INFO L225 Difference]: With dead ends: 39498 [2023-12-22 02:34:59,910 INFO L226 Difference]: Without dead ends: 22664 [2023-12-22 02:34:59,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:59,929 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 140 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:59,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 687 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22664 states. [2023-12-22 02:35:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22664 to 22662. [2023-12-22 02:35:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22662 states, 19404 states have (on average 1.1966604823747682) internal successors, (23220), 19710 states have internal predecessors, (23220), 1589 states have call successors, (1589), 1179 states have call predecessors, (1589), 1667 states have return successors, (2171), 1773 states have call predecessors, (2171), 1588 states have call successors, (2171) [2023-12-22 02:35:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22662 states to 22662 states and 26980 transitions. [2023-12-22 02:35:01,512 INFO L78 Accepts]: Start accepts. Automaton has 22662 states and 26980 transitions. Word has length 208 [2023-12-22 02:35:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:01,512 INFO L495 AbstractCegarLoop]: Abstraction has 22662 states and 26980 transitions. [2023-12-22 02:35:01,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:35:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 22662 states and 26980 transitions. [2023-12-22 02:35:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-22 02:35:01,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:01,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:01,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:01,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:01,732 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:01,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash -281946990, now seen corresponding path program 1 times [2023-12-22 02:35:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688872951] [2023-12-22 02:35:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:01,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:01,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:01,737 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:01,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-12-22 02:35:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:01,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 02:35:01,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-22 02:35:01,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:01,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:01,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688872951] [2023-12-22 02:35:01,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688872951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:01,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:01,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906895383] [2023-12-22 02:35:01,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:01,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:35:01,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:35:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:35:01,971 INFO L87 Difference]: Start difference. First operand 22662 states and 26980 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-22 02:35:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:03,569 INFO L93 Difference]: Finished difference Result 38102 states and 46041 transitions. [2023-12-22 02:35:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:35:03,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 209 [2023-12-22 02:35:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:03,605 INFO L225 Difference]: With dead ends: 38102 [2023-12-22 02:35:03,605 INFO L226 Difference]: Without dead ends: 18398 [2023-12-22 02:35:03,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:35:03,624 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 335 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:03,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 278 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:35:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18398 states. [2023-12-22 02:35:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18398 to 18398. [2023-12-22 02:35:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18398 states, 15768 states have (on average 1.1575342465753424) internal successors, (18252), 15948 states have internal predecessors, (18252), 1321 states have call successors, (1321), 1011 states have call predecessors, (1321), 1307 states have return successors, (1671), 1439 states have call predecessors, (1671), 1320 states have call successors, (1671) [2023-12-22 02:35:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18398 states to 18398 states and 21244 transitions. [2023-12-22 02:35:05,040 INFO L78 Accepts]: Start accepts. Automaton has 18398 states and 21244 transitions. Word has length 209 [2023-12-22 02:35:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:05,041 INFO L495 AbstractCegarLoop]: Abstraction has 18398 states and 21244 transitions. [2023-12-22 02:35:05,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-22 02:35:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 18398 states and 21244 transitions. [2023-12-22 02:35:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-22 02:35:05,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:05,054 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:05,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:05,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:05,260 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:05,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash 541754172, now seen corresponding path program 1 times [2023-12-22 02:35:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967123690] [2023-12-22 02:35:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:05,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:05,262 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:05,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-12-22 02:35:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:05,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:35:05,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-12-22 02:35:05,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:05,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:05,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967123690] [2023-12-22 02:35:05,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967123690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:05,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502120186] [2023-12-22 02:35:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:05,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:35:05,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:35:05,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:05,494 INFO L87 Difference]: Start difference. First operand 18398 states and 21244 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-22 02:35:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:07,134 INFO L93 Difference]: Finished difference Result 23168 states and 27027 transitions. [2023-12-22 02:35:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:35:07,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 229 [2023-12-22 02:35:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:07,171 INFO L225 Difference]: With dead ends: 23168 [2023-12-22 02:35:07,171 INFO L226 Difference]: Without dead ends: 18465 [2023-12-22 02:35:07,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:07,183 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 226 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:07,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 399 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:35:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18465 states. [2023-12-22 02:35:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18465 to 18398. [2023-12-22 02:35:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18398 states, 15768 states have (on average 1.155568239472349) internal successors, (18221), 15948 states have internal predecessors, (18221), 1321 states have call successors, (1321), 1011 states have call predecessors, (1321), 1307 states have return successors, (1671), 1439 states have call predecessors, (1671), 1320 states have call successors, (1671) [2023-12-22 02:35:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18398 states to 18398 states and 21213 transitions. [2023-12-22 02:35:08,761 INFO L78 Accepts]: Start accepts. Automaton has 18398 states and 21213 transitions. Word has length 229 [2023-12-22 02:35:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:08,763 INFO L495 AbstractCegarLoop]: Abstraction has 18398 states and 21213 transitions. [2023-12-22 02:35:08,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-22 02:35:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 18398 states and 21213 transitions. [2023-12-22 02:35:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-22 02:35:08,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:08,773 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:08,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:08,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:08,977 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:08,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash 598245815, now seen corresponding path program 1 times [2023-12-22 02:35:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:08,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683761031] [2023-12-22 02:35:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:08,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:08,979 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:09,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-22 02:35:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:09,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:35:09,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-22 02:35:09,154 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:09,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683761031] [2023-12-22 02:35:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683761031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:09,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:09,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:35:09,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101694166] [2023-12-22 02:35:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:09,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:35:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:35:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:35:09,156 INFO L87 Difference]: Start difference. First operand 18398 states and 21213 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 3 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-22 02:35:10,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:10,673 INFO L93 Difference]: Finished difference Result 19862 states and 22941 transitions. [2023-12-22 02:35:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:35:10,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 3 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 230 [2023-12-22 02:35:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:10,706 INFO L225 Difference]: With dead ends: 19862 [2023-12-22 02:35:10,707 INFO L226 Difference]: Without dead ends: 16983 [2023-12-22 02:35:10,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:35:10,713 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 144 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:10,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 482 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:35:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16983 states. [2023-12-22 02:35:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16983 to 16787. [2023-12-22 02:35:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16787 states, 14491 states have (on average 1.1500241529225037) internal successors, (16665), 14637 states have internal predecessors, (16665), 1174 states have call successors, (1174), 906 states have call predecessors, (1174), 1120 states have return successors, (1462), 1244 states have call predecessors, (1462), 1173 states have call successors, (1462) [2023-12-22 02:35:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16787 states to 16787 states and 19301 transitions. [2023-12-22 02:35:11,972 INFO L78 Accepts]: Start accepts. Automaton has 16787 states and 19301 transitions. Word has length 230 [2023-12-22 02:35:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:11,972 INFO L495 AbstractCegarLoop]: Abstraction has 16787 states and 19301 transitions. [2023-12-22 02:35:11,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 3 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-22 02:35:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 16787 states and 19301 transitions. [2023-12-22 02:35:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-22 02:35:11,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:11,982 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:11,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:12,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:12,187 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:12,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1603682527, now seen corresponding path program 1 times [2023-12-22 02:35:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:12,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191927056] [2023-12-22 02:35:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:12,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:12,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:12,189 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:12,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-12-22 02:35:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:12,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:35:12,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-12-22 02:35:12,319 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:12,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:12,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191927056] [2023-12-22 02:35:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191927056] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:12,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107888384] [2023-12-22 02:35:12,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:12,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:35:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:35:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:12,321 INFO L87 Difference]: Start difference. First operand 16787 states and 19301 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:35:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:13,538 INFO L93 Difference]: Finished difference Result 18019 states and 20779 transitions. [2023-12-22 02:35:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:35:13,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 231 [2023-12-22 02:35:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:13,571 INFO L225 Difference]: With dead ends: 18019 [2023-12-22 02:35:13,571 INFO L226 Difference]: Without dead ends: 16769 [2023-12-22 02:35:13,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:13,577 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 71 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:13,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 550 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:35:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16769 states. [2023-12-22 02:35:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16769 to 16766. [2023-12-22 02:35:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16766 states, 14473 states have (on average 1.1487597595522698) internal successors, (16626), 14619 states have internal predecessors, (16626), 1174 states have call successors, (1174), 906 states have call predecessors, (1174), 1117 states have return successors, (1459), 1241 states have call predecessors, (1459), 1173 states have call successors, (1459) [2023-12-22 02:35:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16766 states to 16766 states and 19259 transitions. [2023-12-22 02:35:14,852 INFO L78 Accepts]: Start accepts. Automaton has 16766 states and 19259 transitions. Word has length 231 [2023-12-22 02:35:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:14,852 INFO L495 AbstractCegarLoop]: Abstraction has 16766 states and 19259 transitions. [2023-12-22 02:35:14,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:35:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 16766 states and 19259 transitions. [2023-12-22 02:35:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-22 02:35:14,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:14,863 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:14,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:15,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:15,067 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:15,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1141287993, now seen corresponding path program 1 times [2023-12-22 02:35:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:15,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303181346] [2023-12-22 02:35:15,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:15,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:15,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:15,071 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:15,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-12-22 02:35:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:15,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:35:15,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2023-12-22 02:35:15,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:15,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303181346] [2023-12-22 02:35:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303181346] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:15,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:15,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:35:15,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324682988] [2023-12-22 02:35:15,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:15,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:35:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:15,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:35:15,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:35:15,224 INFO L87 Difference]: Start difference. First operand 16766 states and 19259 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:35:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:16,611 INFO L93 Difference]: Finished difference Result 17115 states and 19646 transitions. [2023-12-22 02:35:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:35:16,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 233 [2023-12-22 02:35:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:16,647 INFO L225 Difference]: With dead ends: 17115 [2023-12-22 02:35:16,647 INFO L226 Difference]: Without dead ends: 15450 [2023-12-22 02:35:16,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:35:16,655 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 133 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:16,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 472 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:35:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15450 states. [2023-12-22 02:35:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15450 to 15450. [2023-12-22 02:35:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15450 states, 13469 states have (on average 1.148934590541243) internal successors, (15475), 13594 states have internal predecessors, (15475), 1028 states have call successors, (1028), 784 states have call predecessors, (1028), 952 states have return successors, (1244), 1072 states have call predecessors, (1244), 1028 states have call successors, (1244) [2023-12-22 02:35:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15450 states to 15450 states and 17747 transitions. [2023-12-22 02:35:17,808 INFO L78 Accepts]: Start accepts. Automaton has 15450 states and 17747 transitions. Word has length 233 [2023-12-22 02:35:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:17,809 INFO L495 AbstractCegarLoop]: Abstraction has 15450 states and 17747 transitions. [2023-12-22 02:35:17,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:35:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 15450 states and 17747 transitions. [2023-12-22 02:35:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-22 02:35:17,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:17,821 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:17,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:18,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:18,028 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:18,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1020685493, now seen corresponding path program 1 times [2023-12-22 02:35:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:18,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294579365] [2023-12-22 02:35:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:18,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:18,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:18,030 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:18,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-12-22 02:35:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:18,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:35:18,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-22 02:35:18,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:18,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294579365] [2023-12-22 02:35:18,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294579365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:18,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:18,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064450582] [2023-12-22 02:35:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:18,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:35:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:35:18,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:18,192 INFO L87 Difference]: Start difference. First operand 15450 states and 17747 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:18,667 INFO L93 Difference]: Finished difference Result 19710 states and 22614 transitions. [2023-12-22 02:35:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:35:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 242 [2023-12-22 02:35:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:18,676 INFO L225 Difference]: With dead ends: 19710 [2023-12-22 02:35:18,676 INFO L226 Difference]: Without dead ends: 3734 [2023-12-22 02:35:18,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:18,692 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 135 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:18,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 394 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:35:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2023-12-22 02:35:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3734. [2023-12-22 02:35:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3241 states have (on average 1.097500771366862) internal successors, (3557), 3260 states have internal predecessors, (3557), 280 states have call successors, (280), 196 states have call predecessors, (280), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-22 02:35:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4133 transitions. [2023-12-22 02:35:18,994 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4133 transitions. Word has length 242 [2023-12-22 02:35:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:18,994 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4133 transitions. [2023-12-22 02:35:18,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4133 transitions. [2023-12-22 02:35:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-22 02:35:18,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:18,999 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:19,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:19,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:19,206 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:19,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash -571347970, now seen corresponding path program 1 times [2023-12-22 02:35:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127322642] [2023-12-22 02:35:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:19,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:19,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:19,208 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:19,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2023-12-22 02:35:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:19,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:35:19,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-22 02:35:19,395 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:19,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:19,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127322642] [2023-12-22 02:35:19,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127322642] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:19,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:19,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:19,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238336164] [2023-12-22 02:35:19,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:19,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:35:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:19,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:35:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:19,396 INFO L87 Difference]: Start difference. First operand 3734 states and 4133 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:19,907 INFO L93 Difference]: Finished difference Result 8374 states and 9395 transitions. [2023-12-22 02:35:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:35:19,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 243 [2023-12-22 02:35:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:19,915 INFO L225 Difference]: With dead ends: 8374 [2023-12-22 02:35:19,915 INFO L226 Difference]: Without dead ends: 4208 [2023-12-22 02:35:19,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:19,921 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 137 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:19,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 326 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:35:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2023-12-22 02:35:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 4175. [2023-12-22 02:35:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4175 states, 3622 states have (on average 1.0916620651573716) internal successors, (3954), 3643 states have internal predecessors, (3954), 314 states have call successors, (314), 220 states have call predecessors, (314), 238 states have return successors, (342), 312 states have call predecessors, (342), 314 states have call successors, (342) [2023-12-22 02:35:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 4610 transitions. [2023-12-22 02:35:20,237 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 4610 transitions. Word has length 243 [2023-12-22 02:35:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:20,237 INFO L495 AbstractCegarLoop]: Abstraction has 4175 states and 4610 transitions. [2023-12-22 02:35:20,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 4610 transitions. [2023-12-22 02:35:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-22 02:35:20,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:20,241 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:20,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:20,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:20,446 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:20,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:20,446 INFO L85 PathProgramCache]: Analyzing trace with hash -652923275, now seen corresponding path program 1 times [2023-12-22 02:35:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:20,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428717760] [2023-12-22 02:35:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:20,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:20,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:20,448 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:20,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2023-12-22 02:35:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:20,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:35:20,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-22 02:35:20,627 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:20,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:20,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428717760] [2023-12-22 02:35:20,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428717760] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:20,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:20,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:20,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428710919] [2023-12-22 02:35:20,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:20,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:35:20,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:20,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:35:20,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:20,628 INFO L87 Difference]: Start difference. First operand 4175 states and 4610 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:21,217 INFO L93 Difference]: Finished difference Result 9151 states and 10256 transitions. [2023-12-22 02:35:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:35:21,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 244 [2023-12-22 02:35:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:21,225 INFO L225 Difference]: With dead ends: 9151 [2023-12-22 02:35:21,225 INFO L226 Difference]: Without dead ends: 4584 [2023-12-22 02:35:21,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:21,228 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 123 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:21,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 325 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:35:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2023-12-22 02:35:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4537. [2023-12-22 02:35:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 3932 states have (on average 1.0859613428280772) internal successors, (4270), 3955 states have internal predecessors, (4270), 344 states have call successors, (344), 240 states have call predecessors, (344), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-22 02:35:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 5000 transitions. [2023-12-22 02:35:21,578 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 5000 transitions. Word has length 244 [2023-12-22 02:35:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:21,578 INFO L495 AbstractCegarLoop]: Abstraction has 4537 states and 5000 transitions. [2023-12-22 02:35:21,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 5000 transitions. [2023-12-22 02:35:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-22 02:35:21,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:21,582 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:21,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:21,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:21,788 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:21,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash -847080543, now seen corresponding path program 1 times [2023-12-22 02:35:21,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:21,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225947157] [2023-12-22 02:35:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:21,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:21,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:21,790 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:21,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2023-12-22 02:35:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:21,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:35:21,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-22 02:35:21,975 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:21,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225947157] [2023-12-22 02:35:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225947157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:21,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:21,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:21,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862242363] [2023-12-22 02:35:21,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:21,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:35:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:21,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:35:21,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:21,977 INFO L87 Difference]: Start difference. First operand 4537 states and 5000 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-22 02:35:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:22,391 INFO L93 Difference]: Finished difference Result 7296 states and 8136 transitions. [2023-12-22 02:35:22,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:35:22,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 246 [2023-12-22 02:35:22,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:22,399 INFO L225 Difference]: With dead ends: 7296 [2023-12-22 02:35:22,399 INFO L226 Difference]: Without dead ends: 4539 [2023-12-22 02:35:22,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:22,406 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 123 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:22,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 387 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:35:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2023-12-22 02:35:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 4537. [2023-12-22 02:35:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 3932 states have (on average 1.0768056968463886) internal successors, (4234), 3955 states have internal predecessors, (4234), 344 states have call successors, (344), 240 states have call predecessors, (344), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-22 02:35:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 4964 transitions. [2023-12-22 02:35:22,760 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 4964 transitions. Word has length 246 [2023-12-22 02:35:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:22,761 INFO L495 AbstractCegarLoop]: Abstraction has 4537 states and 4964 transitions. [2023-12-22 02:35:22,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-22 02:35:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 4964 transitions. [2023-12-22 02:35:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-22 02:35:22,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:22,765 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:22,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:22,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:22,970 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:22,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash 696765613, now seen corresponding path program 1 times [2023-12-22 02:35:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:22,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040723328] [2023-12-22 02:35:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:22,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:22,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:22,972 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:22,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2023-12-22 02:35:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:23,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:35:23,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-12-22 02:35:23,125 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:23,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:23,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040723328] [2023-12-22 02:35:23,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040723328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:23,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:23,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527616597] [2023-12-22 02:35:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:23,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:35:23,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:35:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:23,127 INFO L87 Difference]: Start difference. First operand 4537 states and 4964 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:23,537 INFO L93 Difference]: Finished difference Result 8254 states and 9122 transitions. [2023-12-22 02:35:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:35:23,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 248 [2023-12-22 02:35:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:23,546 INFO L225 Difference]: With dead ends: 8254 [2023-12-22 02:35:23,546 INFO L226 Difference]: Without dead ends: 4537 [2023-12-22 02:35:23,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:23,551 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 129 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:23,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 349 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:35:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2023-12-22 02:35:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 4537. [2023-12-22 02:35:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 3932 states have (on average 1.0661241098677519) internal successors, (4192), 3955 states have internal predecessors, (4192), 344 states have call successors, (344), 240 states have call predecessors, (344), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-22 02:35:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 4922 transitions. [2023-12-22 02:35:23,914 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 4922 transitions. Word has length 248 [2023-12-22 02:35:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:23,914 INFO L495 AbstractCegarLoop]: Abstraction has 4537 states and 4922 transitions. [2023-12-22 02:35:23,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 4922 transitions. [2023-12-22 02:35:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-22 02:35:23,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:23,919 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:23,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:24,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:24,124 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:24,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:24,124 INFO L85 PathProgramCache]: Analyzing trace with hash -439116417, now seen corresponding path program 1 times [2023-12-22 02:35:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:24,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5751196] [2023-12-22 02:35:24,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:35:24,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:24,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:24,126 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:24,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2023-12-22 02:35:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:35:24,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:35:24,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-22 02:35:24,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:24,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:24,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5751196] [2023-12-22 02:35:24,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5751196] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:24,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:24,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:24,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572654315] [2023-12-22 02:35:24,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:24,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:35:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:24,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:35:24,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:24,279 INFO L87 Difference]: Start difference. First operand 4537 states and 4922 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:24,619 INFO L93 Difference]: Finished difference Result 5754 states and 6257 transitions. [2023-12-22 02:35:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:35:24,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 251 [2023-12-22 02:35:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:24,626 INFO L225 Difference]: With dead ends: 5754 [2023-12-22 02:35:24,626 INFO L226 Difference]: Without dead ends: 3919 [2023-12-22 02:35:24,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:24,629 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 149 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:24,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 392 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:35:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2023-12-22 02:35:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2023-12-22 02:35:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3400 states have (on average 1.0626470588235295) internal successors, (3613), 3420 states have internal predecessors, (3613), 295 states have call successors, (295), 206 states have call predecessors, (295), 223 states have return successors, (315), 293 states have call predecessors, (315), 295 states have call successors, (315) [2023-12-22 02:35:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4223 transitions. [2023-12-22 02:35:24,970 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4223 transitions. Word has length 251 [2023-12-22 02:35:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:24,971 INFO L495 AbstractCegarLoop]: Abstraction has 3919 states and 4223 transitions. [2023-12-22 02:35:24,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-22 02:35:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4223 transitions. [2023-12-22 02:35:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-22 02:35:24,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:24,975 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:24,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:25,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:25,182 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:25,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 792065813, now seen corresponding path program 2 times [2023-12-22 02:35:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398053717] [2023-12-22 02:35:25,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:35:25,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:25,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:25,193 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:25,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2023-12-22 02:35:25,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 02:35:25,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:35:25,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:35:25,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-22 02:35:25,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:35:25,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:25,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398053717] [2023-12-22 02:35:25,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398053717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:35:25,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:35:25,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:35:25,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921021076] [2023-12-22 02:35:25,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:25,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:35:25,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:25,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:35:25,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:25,362 INFO L87 Difference]: Start difference. First operand 3919 states and 4223 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:35:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:25,692 INFO L93 Difference]: Finished difference Result 4951 states and 5331 transitions. [2023-12-22 02:35:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:35:25,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 253 [2023-12-22 02:35:25,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:25,698 INFO L225 Difference]: With dead ends: 4951 [2023-12-22 02:35:25,698 INFO L226 Difference]: Without dead ends: 3734 [2023-12-22 02:35:25,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:35:25,700 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 144 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:25,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 435 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:35:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2023-12-22 02:35:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3734. [2023-12-22 02:35:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3241 states have (on average 1.0610922554767048) internal successors, (3439), 3260 states have internal predecessors, (3439), 280 states have call successors, (280), 196 states have call predecessors, (280), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-22 02:35:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4015 transitions. [2023-12-22 02:35:26,022 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4015 transitions. Word has length 253 [2023-12-22 02:35:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:26,022 INFO L495 AbstractCegarLoop]: Abstraction has 3734 states and 4015 transitions. [2023-12-22 02:35:26,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:35:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4015 transitions. [2023-12-22 02:35:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-12-22 02:35:26,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:35:26,026 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:26,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:26,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:26,227 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:35:26,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:35:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1460015475, now seen corresponding path program 3 times [2023-12-22 02:35:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:35:26,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716759351] [2023-12-22 02:35:26,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-22 02:35:26,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:26,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:35:26,229 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:35:26,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2023-12-22 02:35:26,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-22 02:35:26,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:35:26,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:35:26,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:35:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 124 proven. 159 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 02:35:26,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:35:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-12-22 02:35:26,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:35:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716759351] [2023-12-22 02:35:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716759351] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:35:26,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:35:26,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2023-12-22 02:35:26,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407803548] [2023-12-22 02:35:26,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:35:26,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:35:26,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:35:26,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:35:26,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:35:26,756 INFO L87 Difference]: Start difference. First operand 3734 states and 4015 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-22 02:35:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:35:27,493 INFO L93 Difference]: Finished difference Result 3734 states and 4015 transitions. [2023-12-22 02:35:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:35:27,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 254 [2023-12-22 02:35:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:35:27,494 INFO L225 Difference]: With dead ends: 3734 [2023-12-22 02:35:27,494 INFO L226 Difference]: Without dead ends: 0 [2023-12-22 02:35:27,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:35:27,498 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 465 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 02:35:27,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1576 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 02:35:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-22 02:35:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-22 02:35:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:35:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-22 02:35:27,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2023-12-22 02:35:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:35:27,503 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-22 02:35:27,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-22 02:35:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-22 02:35:27,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-22 02:35:27,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 02:35:27,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 02:35:27,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Forceful destruction successful, exit code 0 [2023-12-22 02:35:27,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:35:27,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-22 02:36:04,513 WARN L293 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 189 DAG size of output: 119 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:36:10,533 WARN L293 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 189 DAG size of output: 119 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:36:27,337 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 189 DAG size of output: 119 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:36:45,193 WARN L293 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 503 DAG size of output: 193 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:36:57,467 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 189 DAG size of output: 119 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:37:10,915 WARN L293 SmtUtils]: Spent 6.99s on a formula simplification. DAG size of input: 304 DAG size of output: 174 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:37:25,063 WARN L293 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 376 DAG size of output: 142 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:37:31,110 WARN L293 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 189 DAG size of output: 119 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:37:44,446 WARN L293 SmtUtils]: Spent 13.30s on a formula simplification. DAG size of input: 352 DAG size of output: 176 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:37:59,225 WARN L293 SmtUtils]: Spent 12.88s on a formula simplification. DAG size of input: 352 DAG size of output: 176 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:38:13,598 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 189 DAG size of output: 119 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:38:20,554 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 134 DAG size of output: 119 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-22 02:38:30,451 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 1040 1050) no Hoare annotation was computed. [2023-12-22 02:38:30,451 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 1040 1050) no Hoare annotation was computed. [2023-12-22 02:38:30,457 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1040 1050) the Hoare annotation is: (let ((.cse46 (= ~t2_st~0 (_ bv0 32))) (.cse35 (= ~t3_st~0 (_ bv2 32))) (.cse22 (= |old(~t3_st~0)| ~t3_st~0)) (.cse55 (= |old(~t2_st~0)| ~t2_st~0)) (.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse33 (= |old(~m_st~0)| ~m_st~0)) (.cse25 (= ~t1_st~0 (_ bv2 32))) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse45 (= ~t3_st~0 (_ bv0 32))) (.cse48 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse24 (= (_ bv2 32) ~m_st~0))) (let ((.cse50 (and .cse23 .cse45 .cse48 .cse24)) (.cse30 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse34 (= ~t1_st~0 (_ bv0 32))) (.cse37 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse40 (and .cse33 .cse23 .cse45 .cse25)) (.cse12 (not .cse38)) (.cse49 (and .cse22 .cse48 .cse24 .cse55)) (.cse43 (and .cse23 .cse48 .cse24 .cse35)) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse51 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse16 (not (= |old(~t2_st~0)| (_ bv2 32)))) (.cse39 (and .cse33 .cse23 .cse25 .cse35)) (.cse44 (not (= |old(~t2_st~0)| (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) ~E_3~0))) (.cse8 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse47 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse52 (not (= ~local~0 ~token~0))) (.cse31 (not (= (_ bv0 32) ~m_pc~0))) (.cse53 (and .cse33 .cse46 .cse25 .cse35)) (.cse41 (not (= |old(~t3_st~0)| (_ bv0 32)))) (.cse42 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse2 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse4 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse5 (not (= (_ bv2 32) ~T3_E~0))) (.cse6 (not (= (_ bv2 32) ~T1_E~0))) (.cse7 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse9 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse10 (not (= (_ bv1 32) ~t1_i~0))) (.cse54 (and .cse24 .cse25 .cse55 .cse35)) (.cse11 (not (= ~q_free~0 (_ bv0 32)))) (.cse32 (not (= |old(~t3_st~0)| (_ bv2 32)))) (.cse13 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse14 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse15 (not (= (_ bv2 32) ~T2_E~0))) (.cse17 (not (= (_ bv2 32) ~E_1~0))) (.cse36 (not (= (_ bv2 32) ~E_M~0))) (.cse20 (not (= (_ bv1 32) ~t2_i~0))) (.cse21 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse26 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse27 (not (= (_ bv1 32) ~t3_i~0))) (.cse28 (not (= (_ bv2 32) ~E_2~0))) (.cse29 (not (= ~p_last_write~0 ~c_last_read~0))) (.cse18 (= ~t3_pc~0 (_ bv1 32)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= (bvadd ~local~0 (_ bv3 32)) ~token~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not .cse18) .cse19 .cse20 .cse21 (and .cse22 .cse23 .cse24 .cse25) .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 .cse31 .cse11 .cse32 (and .cse33 .cse23 .cse34 .cse35) .cse14 .cse15 .cse16 .cse36 .cse20 .cse21 .cse37 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse2 .cse38 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse13 .cse14 .cse15 .cse16 .cse36 .cse20 .cse21 .cse39 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse2 .cse38 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse40 .cse31 .cse11 .cse13 .cse14 .cse41 .cse15 .cse16 .cse36 .cse20 .cse21 .cse42 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse14 .cse15 .cse43 .cse16 .cse17 .cse36 .cse20 .cse21 .cse26 .cse27 .cse29 .cse18) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse13 .cse14 .cse15 .cse16 .cse36 .cse20 .cse21 .cse39 .cse26 .cse27 .cse28 .cse29 .cse18) (or .cse0 .cse2 .cse44 .cse3 .cse4 (and .cse33 .cse34 .cse45 .cse46) .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 .cse47 .cse31 .cse11 .cse14 .cse41 .cse15 .cse36 .cse20 .cse21 .cse42 .cse37 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse44 .cse3 .cse4 (and .cse45 .cse48 .cse46 .cse24) .cse5 .cse6 .cse7 .cse9 .cse10 .cse47 .cse11 .cse14 .cse41 .cse15 .cse17 .cse36 .cse20 .cse21 .cse42 .cse26 .cse27 .cse29) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse31 .cse11 .cse49 .cse14 .cse15 .cse17 .cse20 .cse21 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse2 .cse44 .cse3 .cse4 (and .cse48 .cse46 .cse24 .cse35) .cse5 .cse6 .cse7 .cse9 .cse10 .cse47 .cse11 .cse32 .cse14 .cse15 .cse17 .cse36 .cse20 .cse21 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse2 .cse38 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse32 .cse14 .cse15 .cse43 .cse16 .cse17 .cse36 .cse20 .cse21 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse2 .cse38 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse41 .cse15 .cse16 .cse17 .cse36 .cse20 .cse21 .cse42 .cse26 .cse27 .cse29 .cse50) (or .cse0 .cse2 .cse44 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 (and .cse33 .cse34 .cse46 .cse35) .cse47 .cse31 .cse11 .cse32 .cse14 .cse15 .cse36 .cse20 .cse21 .cse37 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse41 .cse15 .cse16 .cse17 .cse19 .cse36 .cse20 .cse21 .cse42 .cse51 .cse26 .cse27 .cse29 .cse50) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 .cse31 .cse11 (and .cse33 .cse23 .cse34 .cse45) .cse14 .cse41 .cse15 .cse16 .cse36 .cse20 .cse21 .cse42 .cse37 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse40 .cse52 .cse31 .cse11 .cse13 .cse14 .cse41 .cse15 .cse16 .cse36 .cse20 .cse21 .cse42 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse52 .cse11 .cse32 .cse13 .cse14 .cse15 .cse16 .cse19 .cse36 .cse20 .cse21 .cse39 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse2 .cse44 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse47 .cse31 .cse11 .cse32 .cse13 .cse14 .cse15 .cse53 .cse36 .cse20 .cse21 .cse26 .cse27 .cse28 .cse29 .cse18) (or .cse0 .cse2 .cse44 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse47 .cse52 (and .cse33 .cse45 .cse46 .cse25) .cse31 .cse11 .cse13 .cse14 .cse41 .cse15 .cse36 .cse20 .cse21 .cse42 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse54 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse17 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse19 .cse36 .cse20 .cse21 .cse26 .cse27 .cse28 .cse29) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse31 .cse11 .cse49 .cse14 .cse15 .cse17 .cse36 .cse20 .cse21 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse32 .cse14 .cse15 .cse43 .cse16 .cse17 .cse19 .cse36 .cse20 .cse21 .cse51 .cse26 .cse27 .cse29) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse52 .cse31 .cse11 .cse32 .cse13 .cse14 .cse15 .cse16 .cse36 .cse20 .cse21 .cse39 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse2 .cse44 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse47 .cse52 .cse31 .cse11 .cse32 .cse13 .cse14 .cse15 .cse53 .cse36 .cse20 .cse21 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse41 .cse15 .cse17 (and .cse45 .cse24 .cse25 .cse55) .cse36 .cse20 .cse21 .cse42 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse54 .cse11 .cse32 .cse13 .cse14 .cse15 .cse17 .cse36 .cse20 .cse21 .cse26 .cse27 .cse28 .cse29 .cse18)))) [2023-12-22 02:38:30,457 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2023-12-22 02:38:30,457 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2023-12-22 02:38:30,458 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse25 (= ~p_last_write~0 ~c_last_read~0)) (.cse26 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= (_ bv2 32) |old(~q_read_ev~0)|)) (.cse21 (= (_ bv2 32) ~q_read_ev~0)) (.cse38 (= ~q_req_up~0 (_ bv0 32))) (.cse23 (= |old(~q_write_ev~0)| (_ bv2 32))) (.cse20 (= (_ bv2 32) ~q_write_ev~0)) (.cse27 (= ~p_num_write~0 ~c_num_read~0)) (.cse22 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse48 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse41 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse34 (and .cse22 .cse48 .cse41)) (.cse36 (= ~c_dr_pc~0 (_ bv1 32))) (.cse1 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse37 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse35 (not (= ~q_free~0 (_ bv0 32)))) (.cse6 (not .cse27)) (.cse29 (not (= ~p_dw_st~0 (_ bv2 32)))) (.cse3 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse47 (and .cse20 .cse41)) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse42 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (not (= (_ bv2 32) ~E_3~0))) (.cse4 (not (= (_ bv0 32) ~m_st~0))) (.cse5 (not .cse23)) (.cse7 (not (= (_ bv2 32) ~T3_E~0))) (.cse8 (not (= (_ bv2 32) ~T1_E~0))) (.cse43 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse44 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse9 (not (= ~t3_st~0 (_ bv0 32)))) (.cse40 (and .cse20 .cse21 .cse38)) (.cse39 (not (= |old(~q_req_up~0)| (_ bv0 32)))) (.cse10 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse11 (not (= (_ bv0 32) ~m_pc~0))) (.cse12 (not .cse24)) (.cse45 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse13 (not (= (_ bv2 32) ~T2_E~0))) (.cse14 (not (= ~t1_st~0 (_ bv0 32)))) (.cse15 (not (= (_ bv2 32) ~E_1~0))) (.cse16 (not (= ~t2_st~0 (_ bv0 32)))) (.cse17 (not (= (_ bv2 32) ~E_M~0))) (.cse46 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse18 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse28 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse30 (not .cse19)) (.cse31 (not (= (_ bv2 32) ~E_2~0))) (.cse32 (not .cse26)) (.cse33 (not .cse25))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (or .cse0 .cse2 .cse3 .cse4 .cse34 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse36 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse30 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (and .cse20 .cse21 .cse22) .cse10 .cse11 .cse12 .cse35 .cse13 .cse37 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse30 .cse31) (or .cse0 (and .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse38 .cse26 .cse27) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse39 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse29 .cse30 .cse32 .cse33) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse40 .cse39 .cse11 .cse12 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse20 .cse41 .cse38) .cse6 .cse7 .cse8 .cse9 .cse39 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (or .cse0 .cse2 .cse3 .cse4 .cse34 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse36 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (or .cse0 .cse42 .cse2 .cse5 .cse7 .cse8 .cse43 .cse44 .cse11 .cse45 .cse13 .cse15 .cse17 .cse46 .cse29 .cse30 .cse47 .cse32 .cse33) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse39 .cse10 .cse11 .cse12 .cse35 (and .cse21 .cse48 .cse38) .cse13 .cse37 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse30 .cse31) (or .cse0 .cse2 .cse3 .cse7 .cse8 .cse11 .cse35 .cse13 (and .cse48 .cse41) .cse15 .cse17 .cse46 .cse30) (or .cse0 .cse42 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse13 .cse15 .cse17 .cse29 .cse30 .cse47 .cse32 .cse33) (or .cse0 .cse42 .cse2 .cse3 .cse5 .cse7 .cse8 .cse44 .cse11 .cse45 .cse13 .cse15 .cse17 .cse46 .cse30 .cse47 .cse32 .cse33) (or .cse0 .cse42 .cse2 .cse4 .cse5 (not (= ~p_dw_st~0 (_ bv0 32))) .cse7 .cse8 .cse43 .cse44 .cse9 .cse40 .cse39 .cse10 .cse11 .cse12 .cse45 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46 .cse18 .cse28 .cse30 .cse31 .cse32 .cse33)))) [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L733(lines 721 735) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 693) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L684-2(lines 684 693) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 747) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L1031-2(lines 997 1039) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L1023(lines 1023 1027) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L1023-2(lines 1023 1027) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L1015(lines 1015 1019) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L1015-2(lines 1015 1019) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2023-12-22 02:38:30,459 INFO L899 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2023-12-22 02:38:30,460 INFO L899 garLoopResultBuilder]: For program point L1007(lines 1007 1011) no Hoare annotation was computed. [2023-12-22 02:38:30,460 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 690) no Hoare annotation was computed. [2023-12-22 02:38:30,460 INFO L899 garLoopResultBuilder]: For program point L1007-2(lines 1007 1011) no Hoare annotation was computed. [2023-12-22 02:38:30,461 INFO L899 garLoopResultBuilder]: For program point L714(lines 702 716) no Hoare annotation was computed. [2023-12-22 02:38:30,461 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2023-12-22 02:38:30,461 INFO L899 garLoopResultBuilder]: For program point L752(lines 740 754) no Hoare annotation was computed. [2023-12-22 02:38:30,465 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 997 1039) the Hoare annotation is: (let ((.cse39 (= ~t1_st~0 (_ bv0 32))) (.cse23 (= |old(~t3_st~0)| ~t3_st~0)) (.cse61 (= |old(~t2_st~0)| ~t2_st~0)) (.cse41 (= ~t2_pc~0 (_ bv1 32))) (.cse38 (= |old(~m_st~0)| ~m_st~0)) (.cse48 (= ~t2_st~0 (_ bv0 32))) (.cse26 (= ~t1_st~0 (_ bv2 32))) (.cse35 (= ~t3_st~0 (_ bv2 32))) (.cse24 (= ~t2_st~0 (_ bv2 32))) (.cse47 (= ~t3_st~0 (_ bv0 32))) (.cse52 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse25 (= (_ bv2 32) ~m_st~0))) (let ((.cse11 (not (= (bvadd ~local~0 (_ bv3 32)) ~token~0))) (.cse54 (and .cse24 .cse47 .cse52 .cse25)) (.cse50 (and .cse48 .cse25 .cse26 .cse35)) (.cse43 (and .cse38 .cse24 .cse47 .cse26)) (.cse33 (and .cse24 .cse47 .cse25 .cse26)) (.cse13 (not .cse41)) (.cse57 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32))))) (.cse53 (and .cse23 .cse52 .cse25 .cse61)) (.cse55 (and .cse24 .cse39 .cse47 .cse25)) (.cse40 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse60 (and .cse24 .cse39 .cse25 .cse35)) (.cse36 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse45 (and .cse24 .cse52 .cse25 .cse35)) (.cse20 (not (= (_ bv1 32) ~m_pc~0))) (.cse51 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse17 (not (= |old(~t2_st~0)| (_ bv2 32)))) (.cse42 (and .cse38 .cse24 .cse26 .cse35)) (.cse46 (not (= |old(~t2_st~0)| (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) ~E_3~0))) (.cse8 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse49 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse56 (not (= ~local~0 ~token~0))) (.cse37 (not (= (_ bv0 32) ~m_pc~0))) (.cse58 (and .cse38 .cse48 .cse26 .cse35)) (.cse31 (not (= |old(~t3_st~0)| (_ bv0 32)))) (.cse44 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse2 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse4 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse5 (not (= (_ bv2 32) ~T3_E~0))) (.cse6 (not (= (_ bv2 32) ~T1_E~0))) (.cse7 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse9 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse10 (not (= (_ bv1 32) ~t1_i~0))) (.cse59 (and .cse25 .cse26 .cse61 .cse35)) (.cse12 (not (= ~q_free~0 (_ bv0 32)))) (.cse34 (not (= |old(~t3_st~0)| (_ bv2 32)))) (.cse14 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse15 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse16 (not (= (_ bv2 32) ~T2_E~0))) (.cse18 (not (= (_ bv2 32) ~E_1~0))) (.cse32 (not (= (_ bv2 32) ~E_M~0))) (.cse21 (not (= (_ bv1 32) ~t2_i~0))) (.cse22 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse27 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse28 (not (= (_ bv1 32) ~t3_i~0))) (.cse29 (not (= (_ bv2 32) ~E_2~0))) (.cse30 (not (= ~p_last_write~0 ~c_last_read~0))) (.cse19 (= ~t3_pc~0 (_ bv1 32)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not .cse19) .cse20 .cse21 .cse22 (and .cse23 .cse24 .cse25 .cse26) .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse31 .cse16 .cse17 .cse18 .cse32 .cse21 .cse22 .cse27 .cse33 .cse28 .cse29 .cse30 .cse19) (or .cse0 (not (= |old(~m_st~0)| (_ bv0 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse34 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse32 .cse21 (and .cse24 (= (_ bv0 32) ~m_st~0) .cse26 .cse35) .cse22 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse36 .cse7 .cse9 .cse10 .cse37 .cse12 .cse34 (and .cse38 .cse24 .cse39 .cse35) .cse15 .cse16 .cse17 .cse32 .cse21 .cse22 .cse40 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse2 .cse41 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse34 .cse14 .cse15 .cse16 .cse17 .cse32 .cse21 .cse22 .cse42 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse2 .cse41 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse43 .cse37 .cse12 .cse14 .cse15 .cse31 .cse16 .cse17 .cse32 .cse21 .cse22 .cse44 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse34 .cse15 .cse16 .cse45 .cse17 .cse18 .cse32 .cse21 .cse22 .cse27 .cse28 .cse30 .cse19) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse34 .cse14 .cse15 .cse16 .cse17 .cse32 .cse21 .cse22 .cse42 .cse27 .cse28 .cse29 .cse30 .cse19) (or .cse0 .cse2 .cse46 .cse3 .cse4 (and .cse38 .cse39 .cse47 .cse48) .cse5 .cse6 .cse36 .cse7 .cse9 .cse10 .cse49 .cse37 .cse12 .cse15 .cse31 .cse16 .cse32 .cse21 .cse22 .cse44 .cse40 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse46 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse50 .cse34 .cse14 .cse15 .cse16 .cse18 .cse20 .cse32 .cse21 .cse22 .cse51 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse46 .cse3 .cse4 (and .cse47 .cse52 .cse48 .cse25) .cse5 .cse6 .cse7 .cse9 .cse10 .cse49 .cse12 .cse15 .cse31 .cse16 .cse18 .cse32 .cse21 .cse22 .cse44 .cse27 .cse28 .cse30) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse37 .cse12 .cse53 .cse15 .cse16 .cse18 .cse21 .cse22 .cse27 .cse28 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse34 .cse14 .cse15 .cse16 .cse17 (and .cse24 .cse25 .cse26 .cse35) .cse18 .cse32 .cse21 .cse22 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse46 .cse3 .cse4 (and .cse52 .cse48 .cse25 .cse35) .cse5 .cse6 .cse7 .cse9 .cse10 .cse49 .cse12 .cse34 .cse15 .cse16 .cse18 .cse32 .cse21 .cse22 .cse27 .cse28 .cse30) (or .cse0 .cse1 .cse2 .cse41 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse34 .cse15 .cse16 .cse45 .cse17 .cse18 .cse32 .cse21 .cse22 .cse27 .cse28 .cse30) (or .cse0 .cse1 .cse2 .cse41 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse31 .cse16 .cse17 .cse18 .cse32 .cse21 .cse22 .cse44 .cse27 .cse28 .cse30 .cse54) (or .cse0 .cse1 .cse2 .cse3 .cse55 .cse4 .cse5 .cse6 .cse36 .cse7 .cse9 .cse10 .cse12 .cse15 .cse31 .cse16 .cse17 .cse18 .cse32 .cse21 .cse22 .cse44 .cse40 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse2 .cse46 .cse3 .cse4 .cse5 .cse6 .cse36 .cse7 .cse9 .cse10 (and .cse38 .cse39 .cse48 .cse35) .cse49 .cse37 .cse12 .cse34 .cse15 .cse16 .cse32 .cse21 .cse22 .cse40 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse15 .cse31 .cse16 .cse17 .cse18 .cse20 .cse32 .cse21 .cse22 .cse44 .cse51 .cse27 .cse28 .cse30 .cse54) (or .cse0 .cse1 .cse2 .cse46 .cse41 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse50 .cse34 .cse14 .cse15 .cse16 .cse18 .cse32 .cse21 .cse22 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse36 .cse7 .cse9 .cse10 .cse37 .cse12 (and .cse38 .cse24 .cse39 .cse47) .cse15 .cse31 .cse16 .cse17 .cse32 .cse21 .cse22 .cse44 .cse40 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse43 .cse56 .cse37 .cse12 .cse14 .cse15 .cse31 .cse16 .cse17 .cse32 .cse21 .cse22 .cse44 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse31 .cse16 .cse17 .cse18 .cse57 .cse20 .cse32 .cse21 .cse22 .cse27 .cse33 .cse28 .cse29 .cse30) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse56 .cse12 .cse34 .cse14 .cse15 .cse16 .cse17 .cse20 .cse32 .cse21 .cse22 .cse42 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse2 .cse46 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse49 .cse37 .cse12 .cse34 .cse14 .cse15 .cse16 .cse58 .cse32 .cse21 .cse22 .cse27 .cse28 .cse29 .cse30 .cse19) (or .cse0 .cse2 .cse46 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse49 .cse56 (and .cse38 .cse47 .cse48 .cse26) .cse37 .cse12 .cse14 .cse15 .cse31 .cse16 .cse32 .cse21 .cse22 .cse44 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse59 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse18 .cse57 .cse20 .cse32 .cse21 .cse22 .cse27 .cse28 .cse29 .cse30) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse37 .cse12 .cse53 .cse15 .cse16 .cse18 .cse32 .cse21 .cse22 .cse27 .cse28 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse55 .cse4 .cse5 .cse6 .cse36 .cse7 .cse8 .cse9 .cse10 .cse56 .cse12 .cse15 .cse31 .cse16 .cse17 .cse18 .cse20 .cse32 .cse21 .cse22 .cse44 .cse27 .cse28 .cse29 .cse30) (or .cse60 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse36 .cse7 .cse9 .cse10 .cse12 .cse34 .cse15 .cse16 .cse17 .cse18 .cse32 .cse21 .cse22 .cse40 .cse27 .cse28 .cse29 .cse30) (or .cse60 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse36 .cse7 .cse8 .cse9 .cse10 .cse56 .cse12 .cse34 .cse15 .cse16 .cse17 .cse18 .cse20 .cse32 .cse21 .cse22 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse34 .cse15 .cse16 .cse45 .cse17 .cse18 .cse20 .cse32 .cse21 .cse22 .cse51 .cse27 .cse28 .cse30) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse56 .cse37 .cse12 .cse34 .cse14 .cse15 .cse16 .cse17 .cse32 .cse21 .cse22 .cse42 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse2 .cse46 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse49 .cse56 .cse37 .cse12 .cse34 .cse14 .cse15 .cse16 .cse58 .cse32 .cse21 .cse22 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14 .cse15 .cse31 .cse16 .cse18 (and .cse47 .cse25 .cse26 .cse61) .cse32 .cse21 .cse22 .cse44 .cse27 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse59 .cse12 .cse34 .cse14 .cse15 .cse16 .cse18 .cse32 .cse21 .cse22 .cse27 .cse28 .cse29 .cse30 .cse19)))) [2023-12-22 02:38:30,466 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2023-12-22 02:38:30,466 INFO L899 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2023-12-22 02:38:30,466 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 997 1039) no Hoare annotation was computed. [2023-12-22 02:38:30,466 INFO L899 garLoopResultBuilder]: For program point L695(lines 683 697) no Hoare annotation was computed. [2023-12-22 02:38:30,467 INFO L899 garLoopResultBuilder]: For program point L741(lines 741 750) no Hoare annotation was computed. [2023-12-22 02:38:30,467 INFO L899 garLoopResultBuilder]: For program point L741-2(lines 741 750) no Hoare annotation was computed. [2023-12-22 02:38:30,467 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse35 (= ~p_dw_st~0 (_ bv2 32))) (.cse38 (= (_ bv2 32) ~c_dr_st~0))) (let ((.cse30 (and (= ~p_dw_st~0 |old(~p_dw_st~0)|) .cse38)) (.cse28 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse33 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse37 (not (= |old(~c_dr_st~0)| (_ bv0 32)))) (.cse34 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse36 (= ~c_dr_st~0 (_ bv0 32))) (.cse31 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse27 (not (= ~q_free~0 (_ bv0 32)))) (.cse29 (= ~c_dr_pc~0 (_ bv1 32))) (.cse3 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse5 (not (= (_ bv0 32) ~m_st~0))) (.cse9 (not (= ~t3_st~0 (_ bv0 32)))) (.cse10 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse13 (not (= ~t1_st~0 (_ bv0 32)))) (.cse15 (not (= ~t2_st~0 (_ bv0 32)))) (.cse26 (not (= (_ bv2 32) ~q_read_ev~0))) (.cse19 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse20 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse22 (not (= (_ bv2 32) ~E_2~0))) (.cse1 (and .cse35 .cse38)) (.cse2 (not (= (_ bv2 32) ~M_E~0))) (.cse32 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse4 (not (= (_ bv2 32) ~E_3~0))) (.cse6 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (= (_ bv2 32) ~T3_E~0))) (.cse8 (not (= (_ bv2 32) ~T1_E~0))) (.cse11 (not (= (_ bv0 32) ~m_pc~0))) (.cse12 (not (= (_ bv2 32) ~T2_E~0))) (.cse14 (not (= (_ bv2 32) ~E_1~0))) (.cse16 (not (= (_ bv2 32) ~E_M~0))) (.cse17 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse18 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse21 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse24 (not (= ~q_free~0 (_ bv1 32)))) (.cse25 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse28 .cse13 .cse14 .cse15 .cse26 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse2 .cse4 .cse7 .cse8 .cse30 .cse11 .cse27 .cse12 .cse14 .cse16 .cse31 .cse18 .cse21) (or .cse2 .cse32 .cse4 .cse7 .cse8 .cse33 .cse30 .cse11 .cse34 .cse12 .cse14 .cse16 .cse17 .cse31 .cse18 .cse21 .cse24 .cse25) (or .cse2 .cse32 .cse4 .cse7 .cse8 (and .cse35 .cse36) .cse33 .cse37 .cse11 .cse34 .cse12 .cse14 .cse16 .cse17 .cse31 .cse21 .cse23 .cse24 .cse25) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse28 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse32 .cse4 .cse5 (not (= |old(~p_dw_st~0)| (_ bv0 32))) .cse7 .cse8 .cse33 .cse37 .cse9 .cse10 .cse11 .cse34 .cse12 (and (= ~p_dw_st~0 (_ bv0 32)) .cse36) .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse31 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse7 .cse8 .cse9 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse1 .cse2 .cse32 .cse4 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse21 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,468 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse48 (= ~p_last_write~0 ~q_buf_0~0)) (.cse49 (= (_ bv2 32) ~q_write_ev~0)) (.cse51 (= (_ bv2 32) ~q_read_ev~0)) (.cse46 (= ~p_last_write~0 ~c_last_read~0)) (.cse47 (= ~q_free~0 (_ bv1 32))) (.cse50 (= ~p_num_write~0 ~c_num_read~0)) (.cse24 (= ~p_dw_st~0 (_ bv0 32))) (.cse3 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse45 (= (_ bv2 32) ~c_dr_st~0)) (.cse2 (= activate_threads1_~tmp~1 (_ bv0 32))) (.cse44 (= ~p_dw_st~0 (_ bv2 32)))) (let ((.cse35 (and .cse2 .cse44)) (.cse41 (and .cse3 .cse45)) (.cse40 (and .cse24 .cse45)) (.cse34 (= ~c_dr_pc~0 (_ bv1 32))) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse18 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse19 (not (= |old(~c_dr_st~0)| (_ bv0 32)))) (.cse22 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse12 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse37 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse17 (not (= (_ bv0 32) ~m_st~0))) (.cse21 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse7 (not (= ~q_free~0 (_ bv0 32)))) (.cse42 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse28 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse43 (and .cse2 .cse44 .cse45)) (.cse30 (not (= (_ bv2 32) ~E_2~0))) (.cse15 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse38 (and .cse48 .cse49 .cse51 .cse2 .cse44 .cse46 .cse47 .cse45 .cse50)) (.cse20 (not (= ~t3_st~0 (_ bv0 32)))) (.cse23 (not (= ~t1_st~0 (_ bv0 32)))) (.cse26 (not (= ~t2_st~0 (_ bv0 32)))) (.cse10 (not .cse51)) (.cse29 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse39 (and .cse44 .cse45)) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse16 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) ~E_3~0))) (.cse33 (not .cse50)) (.cse4 (not (= (_ bv2 32) ~T3_E~0))) (.cse5 (not (= (_ bv2 32) ~T1_E~0))) (.cse6 (not (= (_ bv0 32) ~m_pc~0))) (.cse8 (not (= (_ bv2 32) ~T2_E~0))) (.cse9 (not (= (_ bv2 32) ~E_1~0))) (.cse11 (not (= (_ bv2 32) ~E_M~0))) (.cse27 (not .cse49)) (.cse13 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse14 (not .cse48)) (.cse36 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse31 (not .cse47)) (.cse32 (not .cse46))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse0 .cse16 .cse1 .cse17 (not (= |old(~p_dw_st~0)| (_ bv0 32))) .cse4 .cse5 .cse18 .cse19 .cse20 .cse21 .cse6 .cse22 .cse8 .cse23 (and .cse2 .cse24 .cse25) .cse9 .cse26 .cse10 .cse11 .cse27 .cse12 .cse28 .cse29 .cse14 .cse30 .cse31 .cse32) (or .cse0 .cse1 .cse17 .cse33 .cse4 .cse5 .cse20 .cse21 .cse6 .cse8 .cse34 .cse23 .cse9 .cse26 .cse10 .cse11 .cse35 .cse13 .cse28 .cse29 .cse14 .cse30 .cse36 .cse31 .cse32) (or .cse0 .cse1 .cse17 .cse4 .cse5 .cse20 .cse21 .cse6 .cse7 .cse8 .cse34 .cse23 .cse9 .cse26 .cse10 .cse11 .cse35 .cse13 .cse28 .cse29 .cse14 .cse30 .cse36) (or .cse0 .cse37 .cse1 .cse17 .cse38 .cse33 .cse4 .cse5 .cse20 .cse21 .cse6 .cse8 .cse23 .cse9 .cse26 .cse10 .cse11 .cse27 .cse13 .cse28 .cse29 .cse14 .cse30 .cse36 .cse31 .cse32) (or .cse0 .cse16 .cse1 .cse4 .cse5 .cse18 .cse19 .cse2 .cse6 .cse22 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse36 .cse31 .cse32) (or .cse39 .cse0 .cse1 .cse17 .cse33 .cse40 .cse4 .cse5 .cse20 .cse21 .cse6 .cse8 .cse34 .cse23 .cse9 .cse26 .cse11 .cse13 .cse28 .cse29 .cse14 .cse30 .cse36 .cse31 .cse32) (or .cse0 .cse1 .cse40 .cse4 .cse5 .cse41 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse16 .cse1 .cse4 .cse5 .cse18 .cse2 .cse6 .cse22 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse31 .cse32) (or .cse0 .cse37 .cse1 .cse17 .cse4 .cse5 .cse20 .cse21 .cse6 .cse7 .cse8 .cse42 .cse23 .cse9 .cse26 .cse10 .cse11 .cse27 .cse13 .cse28 .cse29 .cse14 .cse43 .cse30 .cse36) (or .cse0 .cse16 .cse1 .cse4 .cse5 .cse18 .cse41 .cse6 .cse22 .cse8 .cse9 .cse11 .cse27 .cse12 .cse13 .cse14 .cse31 .cse32) (or .cse15 .cse0 .cse1 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse23 .cse9 .cse26 .cse10 .cse11 .cse27 .cse13 .cse29 .cse14 .cse43 .cse36) (or .cse0 .cse16 .cse1 .cse33 .cse4 .cse5 .cse2 .cse6 .cse8 .cse9 .cse10 .cse11 .cse27 .cse13 .cse14 .cse36 .cse31 .cse32) (or .cse39 .cse0 .cse1 .cse17 .cse40 .cse4 .cse5 .cse20 .cse21 .cse6 .cse7 .cse8 .cse34 .cse23 .cse9 .cse26 .cse11 .cse13 .cse28 .cse29 .cse14 .cse30 .cse36) (or .cse0 .cse16 .cse1 .cse4 .cse5 (and .cse44 .cse25) .cse18 .cse19 .cse6 .cse22 .cse8 .cse9 .cse11 .cse27 .cse12 .cse14 .cse36 .cse31 .cse32) (or .cse15 .cse39 .cse0 .cse37 .cse1 .cse17 .cse33 .cse4 .cse5 .cse20 .cse21 .cse6 .cse8 (and .cse24 .cse45 (= (_ bv1 32) ~q_read_ev~0)) .cse23 .cse9 .cse26 .cse11 .cse27 .cse13 .cse28 .cse29 .cse14 .cse30 .cse36 .cse31 .cse32) (or .cse15 .cse0 .cse37 .cse1 .cse17 .cse4 .cse5 .cse20 .cse21 .cse6 .cse7 .cse8 .cse42 .cse23 .cse9 .cse26 .cse10 .cse11 .cse13 .cse28 .cse29 .cse14 .cse43 .cse30 .cse36) (or .cse15 .cse0 .cse1 .cse38 .cse33 .cse4 .cse5 .cse20 .cse6 .cse8 .cse23 .cse9 .cse26 .cse10 .cse11 .cse27 .cse13 .cse29 .cse14 .cse36 .cse31 .cse32) (or .cse39 .cse0 .cse16 .cse1 .cse33 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse27 .cse13 .cse14 .cse36 .cse31 .cse32)))) [2023-12-22 02:38:30,468 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2023-12-22 02:38:30,468 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2023-12-22 02:38:30,468 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2023-12-22 02:38:30,468 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse35 (= ~p_dw_st~0 (_ bv2 32))) (.cse38 (= (_ bv2 32) ~c_dr_st~0))) (let ((.cse30 (and (= ~p_dw_st~0 |old(~p_dw_st~0)|) .cse38)) (.cse28 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse33 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse37 (not (= |old(~c_dr_st~0)| (_ bv0 32)))) (.cse34 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse36 (= ~c_dr_st~0 (_ bv0 32))) (.cse31 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse27 (not (= ~q_free~0 (_ bv0 32)))) (.cse29 (= ~c_dr_pc~0 (_ bv1 32))) (.cse3 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse5 (not (= (_ bv0 32) ~m_st~0))) (.cse9 (not (= ~t3_st~0 (_ bv0 32)))) (.cse10 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse13 (not (= ~t1_st~0 (_ bv0 32)))) (.cse15 (not (= ~t2_st~0 (_ bv0 32)))) (.cse26 (not (= (_ bv2 32) ~q_read_ev~0))) (.cse19 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse20 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse22 (not (= (_ bv2 32) ~E_2~0))) (.cse1 (and .cse35 .cse38)) (.cse2 (not (= (_ bv2 32) ~M_E~0))) (.cse32 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse4 (not (= (_ bv2 32) ~E_3~0))) (.cse6 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (= (_ bv2 32) ~T3_E~0))) (.cse8 (not (= (_ bv2 32) ~T1_E~0))) (.cse11 (not (= (_ bv0 32) ~m_pc~0))) (.cse12 (not (= (_ bv2 32) ~T2_E~0))) (.cse14 (not (= (_ bv2 32) ~E_1~0))) (.cse16 (not (= (_ bv2 32) ~E_M~0))) (.cse17 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse18 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse21 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse24 (not (= ~q_free~0 (_ bv1 32)))) (.cse25 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse28 .cse13 .cse14 .cse15 .cse26 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse2 .cse4 .cse7 .cse8 .cse30 .cse11 .cse27 .cse12 .cse14 .cse16 .cse31 .cse18 .cse21) (or .cse2 .cse32 .cse4 .cse7 .cse8 .cse33 .cse30 .cse11 .cse34 .cse12 .cse14 .cse16 .cse17 .cse31 .cse18 .cse21 .cse24 .cse25) (or .cse2 .cse32 .cse4 .cse7 .cse8 (and .cse35 .cse36) .cse33 .cse37 .cse11 .cse34 .cse12 .cse14 .cse16 .cse17 .cse31 .cse21 .cse23 .cse24 .cse25) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse28 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse2 .cse32 .cse4 .cse5 (not (= |old(~p_dw_st~0)| (_ bv0 32))) .cse7 .cse8 .cse33 .cse37 .cse9 .cse10 .cse11 .cse34 .cse12 (and (= ~p_dw_st~0 (_ bv0 32)) .cse36) .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse31 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse4 .cse7 .cse8 .cse9 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse1 .cse2 .cse32 .cse4 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse21 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,468 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2023-12-22 02:38:30,468 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2023-12-22 02:38:30,468 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-12-22 02:38:30,469 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 756 763) no Hoare annotation was computed. [2023-12-22 02:38:30,469 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 756 763) the Hoare annotation is: true [2023-12-22 02:38:30,469 INFO L899 garLoopResultBuilder]: For program point L925-1(lines 904 947) no Hoare annotation was computed. [2023-12-22 02:38:30,469 INFO L899 garLoopResultBuilder]: For program point L915-1(lines 904 947) no Hoare annotation was computed. [2023-12-22 02:38:30,469 INFO L899 garLoopResultBuilder]: For program point L940-1(lines 901 948) no Hoare annotation was computed. [2023-12-22 02:38:30,476 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 901 948) the Hoare annotation is: (let ((.cse39 (= (_ bv2 32) ~E_M~0)) (.cse40 (= (_ bv2 32) ~T2_E~0)) (.cse41 (= (_ bv2 32) ~T3_E~0)) (.cse42 (= (_ bv2 32) ~T1_E~0)) (.cse43 (= |old(~M_E~0)| ~M_E~0)) (.cse44 (= (_ bv2 32) ~E_1~0)) (.cse45 (= (_ bv2 32) ~E_3~0)) (.cse2 (= ~t2_pc~0 (_ bv1 32)))) (let ((.cse46 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse37 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse38 (not .cse2)) (.cse36 (not (= (_ bv1 32) ~m_pc~0))) (.cse34 (not (= ~t3_st~0 (_ bv0 32)))) (.cse19 (not (= (_ bv2 32) ~m_st~0))) (.cse31 (= ~t3_pc~0 (_ bv1 32))) (.cse14 (not (= ~t1_st~0 (_ bv0 32)))) (.cse30 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse6 (not (= ~t2_st~0 (_ bv2 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse26 (not (= (_ bv0 32) ~m_st~0))) (.cse3 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse4 (and .cse39 .cse40 .cse41 (= (_ bv2 32) ~E_2~0) .cse42 .cse43 .cse44 .cse45)) (.cse5 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse7 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse33 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse9 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse10 (not (= (_ bv1 32) ~t1_i~0))) (.cse11 (not (= (_ bv2 32) |old(~E_2~0)|))) (.cse27 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse35 (not (= ~local~0 ~token~0))) (.cse28 (not (= (_ bv0 32) ~m_pc~0))) (.cse12 (not (= ~q_free~0 (_ bv0 32)))) (.cse13 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse15 (not (= (_ bv2 32) |old(~E_3~0)|))) (.cse16 (not (= (_ bv2 32) |old(~T2_E~0)|))) (.cse17 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse29 (not (= ~t2_st~0 (_ bv0 32)))) (.cse18 (not (= (_ bv1 32) ~t2_i~0))) (.cse32 (not (= ~t1_st~0 (_ bv2 32)))) (.cse20 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse21 (not (= ~t3_st~0 (_ bv2 32)))) (.cse22 (not (= (_ bv2 32) |old(~T3_E~0)|))) (.cse23 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (= (_ bv1 32) ~t3_i~0))) (.cse25 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse27 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse18 .cse19 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse35 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse35 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse19 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse27 .cse35 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse12 .cse38 .cse13 .cse15 .cse16 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse17 .cse36 .cse18 .cse32 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse27 .cse35 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse35 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse27 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 (and .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse36 .cse18 .cse32 .cse19 .cse20 .cse21 .cse46 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse36 .cse18 .cse32 .cse19 .cse20 .cse37 .cse46 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 (not (= (bvadd ~local~0 (_ bv3 32)) ~token~0)) .cse12 .cse38 .cse13 .cse15 .cse16 .cse17 (not .cse31) .cse36 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse35 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse27 .cse35 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point L905-1(lines 904 947) no Hoare annotation was computed. [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point L930-1(lines 904 947) no Hoare annotation was computed. [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point L920-1(lines 904 947) no Hoare annotation was computed. [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point L910-1(lines 904 947) no Hoare annotation was computed. [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point L935-1(lines 904 947) no Hoare annotation was computed. [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 901 948) no Hoare annotation was computed. [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2023-12-22 02:38:30,477 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse38 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse43 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse42 (= ~p_last_write~0 ~q_buf_0~0)) (.cse46 (= (_ bv2 32) ~q_write_ev~0)) (.cse37 (= (_ bv2 32) ~q_read_ev~0)) (.cse47 (= |old(~q_write_ev~0)| (_ bv2 32))) (.cse45 (= (_ bv2 32) |old(~q_read_ev~0)|)) (.cse40 (= ~p_last_write~0 ~c_last_read~0)) (.cse41 (= ~q_free~0 (_ bv1 32))) (.cse44 (= ~p_num_write~0 ~c_num_read~0))) (let ((.cse33 (and .cse42 .cse46 .cse37 .cse47 .cse45 .cse40 .cse41 .cse44)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse2 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse9 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse14 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse21 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse32 (and .cse46 .cse43)) (.cse5 (not .cse47)) (.cse16 (and .cse46 .cse37)) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse28 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse13 (not .cse45)) (.cse36 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse34 (not (= ~q_free~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) ~M_E~0))) (.cse3 (not (= (_ bv2 32) ~E_3~0))) (.cse29 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse4 (not (= (_ bv0 32) ~m_st~0))) (.cse30 (not .cse44)) (.cse6 (not (= (_ bv2 32) ~T3_E~0))) (.cse7 (not (= (_ bv2 32) ~T1_E~0))) (.cse10 (not (= ~t3_st~0 (_ bv0 32)))) (.cse11 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse12 (not (= (_ bv0 32) ~m_pc~0))) (.cse15 (not (= (_ bv2 32) ~T2_E~0))) (.cse39 (= ~c_dr_pc~0 (_ bv1 32))) (.cse35 (and .cse38 .cse43)) (.cse17 (not (= ~t1_st~0 (_ bv0 32)))) (.cse18 (not (= (_ bv2 32) ~E_1~0))) (.cse19 (not (= ~t2_st~0 (_ bv0 32)))) (.cse20 (not (= (_ bv2 32) ~E_M~0))) (.cse22 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse23 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse31 (not (= ~p_dw_st~0 (_ bv2 32)))) (.cse24 (not .cse42)) (.cse25 (not (= (_ bv2 32) ~E_2~0))) (.cse26 (not .cse41)) (.cse27 (not .cse40))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~p_dw_st~0 (_ bv0 32))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse28 .cse3 .cse29 .cse4 .cse5 .cse30 .cse6 .cse7 .cse10 .cse11 .cse12 .cse15 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse31 .cse24 .cse32 .cse25 .cse26 .cse27) (or .cse1 .cse28 .cse3 .cse29 .cse4 .cse5 .cse30 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse31 .cse24 .cse33 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse3 .cse29 .cse5 .cse30 .cse6 .cse7 .cse10 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse23 .cse31 .cse24 .cse33 .cse26 .cse27) (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse18 .cse20 .cse21 .cse31 .cse24 .cse32 .cse26 .cse27) (or .cse1 .cse3 .cse29 .cse6 .cse7 .cse12 .cse34 .cse15 .cse35 .cse18 .cse20 .cse21 .cse24) (or .cse1 .cse2 .cse3 .cse29 .cse5 .cse30 .cse6 .cse7 .cse12 .cse15 .cse18 .cse20 .cse31 .cse24 .cse32 .cse26 .cse27) (or .cse1 .cse2 .cse3 .cse29 .cse5 .cse6 .cse7 .cse9 .cse12 .cse14 .cse15 .cse18 .cse20 .cse21 .cse24 .cse32 .cse26 .cse27) (or .cse1 .cse28 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse34 .cse15 .cse16 .cse36 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse31 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse29 .cse5 .cse6 .cse7 .cse10 .cse12 .cse13 .cse34 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse31 .cse24) (or .cse0 .cse1 .cse28 .cse3 .cse29 .cse4 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse34 (and .cse37 .cse38) .cse15 .cse36 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse31 .cse24 .cse25) (or .cse1 .cse3 .cse29 .cse4 .cse6 .cse7 .cse10 .cse11 .cse12 .cse34 .cse15 .cse39 .cse35 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse31 .cse24 .cse25) (or .cse1 .cse3 .cse29 .cse4 .cse30 .cse6 .cse7 .cse10 .cse11 .cse12 .cse15 .cse39 .cse35 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse31 .cse24 .cse25 .cse26 .cse27)))) [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2023-12-22 02:38:30,477 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2023-12-22 02:38:30,478 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2023-12-22 02:38:30,478 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2023-12-22 02:38:30,478 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2023-12-22 02:38:30,478 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2023-12-22 02:38:30,478 INFO L899 garLoopResultBuilder]: For program point L103(lines 91 105) no Hoare annotation was computed. [2023-12-22 02:38:30,478 INFO L895 garLoopResultBuilder]: At program point L597(line 597) the Hoare annotation is: (let ((.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse24 (= ~t2_st~0 (_ bv0 32))) (.cse25 (= ~t2_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse26 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse14 (= ~p_last_write~0 ~c_last_read~0)) (.cse15 (= ~p_dw_st~0 (_ bv0 32))) (.cse27 (= (_ bv1 32) ~m_pc~0)) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= ~c_dr_pc~0 (_ bv0 32))) (.cse18 (= ~q_req_up~0 (_ bv0 32))) (.cse19 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv2 32) ~E_3~0)) (.cse28 (= ~t1_pc~0 (_ bv1 32))) (.cse21 (= (_ bv1 32) ~t1_i~0)) (.cse22 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~p_dw_pc~0 (_ bv0 32))) (.cse29 (= ~t3_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse24 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (= ~t3_pc~0 (_ bv1 32))) .cse20 .cse21 .cse22 .cse23 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 (= (_ bv0 32) ~m_pc~0) .cse17 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse24 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse29))) [2023-12-22 02:38:30,478 INFO L899 garLoopResultBuilder]: For program point L597-1(line 597) no Hoare annotation was computed. [2023-12-22 02:38:30,478 INFO L895 garLoopResultBuilder]: At program point L1126(line 1126) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,479 INFO L899 garLoopResultBuilder]: For program point L1126-1(line 1126) no Hoare annotation was computed. [2023-12-22 02:38:30,479 INFO L895 garLoopResultBuilder]: At program point L829(line 829) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,479 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 132 171) no Hoare annotation was computed. [2023-12-22 02:38:30,479 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 540) no Hoare annotation was computed. [2023-12-22 02:38:30,479 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse28 (= ~p_dw_st~0 (_ bv0 32))) (.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse31 (= ~c_num_read~0 (_ bv0 32))) (.cse32 (= ~p_num_write~0 (_ bv0 32))) (.cse30 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32))) (.cse33 (= ~c_dr_pc~0 (_ bv0 32))) (.cse26 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= (_ bv2 32) ~E_2~0)) (.cse29 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse21 (= (_ bv2 32) ~q_write_ev~0)) (.cse27 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_st~0 (_ bv2 32))) (.cse22 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse34 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_3~0)) (.cse23 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse24 (= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse31 .cse32 .cse7 .cse12 .cse22 .cse16 .cse17 .cse33 .cse18 .cse23 .cse19 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse31 .cse32 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse33 .cse18 .cse23 .cse30 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9 .cse12 .cse16 .cse17 .cse33 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse34 .cse18 .cse19 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse34 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse34 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse34 .cse18 .cse23 .cse19 .cse24 .cse20))) [2023-12-22 02:38:30,479 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2023-12-22 02:38:30,479 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2023-12-22 02:38:30,480 INFO L899 garLoopResultBuilder]: For program point L1094-1(lines 1063 1106) no Hoare annotation was computed. [2023-12-22 02:38:30,480 INFO L899 garLoopResultBuilder]: For program point L1128(lines 1128 1133) no Hoare annotation was computed. [2023-12-22 02:38:30,480 INFO L899 garLoopResultBuilder]: For program point L831(line 831) no Hoare annotation was computed. [2023-12-22 02:38:30,480 INFO L895 garLoopResultBuilder]: At program point L633(line 633) the Hoare annotation is: (let ((.cse21 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~E_1~0)) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse15 (= ~q_req_up~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~m_st~0)) (.cse17 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= (_ bv1 32) ~t1_i~0)) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse20 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ~t3_pc~0 (_ bv1 32))) .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 (= ~t2_pc~0 (_ bv1 32)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (_ bv1 32) ~m_pc~0) .cse13 .cse14 .cse15 .cse16 .cse17 (= ~t1_pc~0 (_ bv1 32)) .cse18 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (_ bv0 32) ~m_pc~0) .cse14 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~t3_st~0 (_ bv0 32)) .cse9 (= ~t3_pc~0 (_ bv0 32)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2023-12-22 02:38:30,480 INFO L899 garLoopResultBuilder]: For program point L633-1(line 633) no Hoare annotation was computed. [2023-12-22 02:38:30,480 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse28 (= ~c_num_read~0 (_ bv0 32))) (.cse29 (= ~p_num_write~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32))) (.cse30 (= ~c_dr_pc~0 (_ bv0 32))) (.cse26 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= (_ bv2 32) ~E_2~0)) (.cse31 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse21 (= (_ bv2 32) ~q_write_ev~0)) (.cse27 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_st~0 (_ bv2 32))) (.cse22 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse32 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_3~0)) (.cse23 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse24 (= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse28 .cse29 .cse7 .cse12 .cse22 .cse16 .cse17 .cse30 .cse18 .cse23 .cse19 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse28 .cse29 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse30 .cse18 .cse23 (= ~c_dr_st~0 (_ bv0 32)) .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9 .cse12 .cse16 .cse17 .cse30 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20))) [2023-12-22 02:38:30,480 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2023-12-22 02:38:30,480 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L895 garLoopResultBuilder]: At program point L1162(line 1162) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L1162-1(line 1162) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 572 607) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L1064(lines 1064 1068) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L1064-2(lines 1063 1106) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L833(lines 833 837) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L866-1(lines 828 894) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L833-1(lines 828 894) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 1139 1197) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L768(lines 768 772) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 767 790) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 528 571) no Hoare annotation was computed. [2023-12-22 02:38:30,481 INFO L895 garLoopResultBuilder]: At program point L669(line 669) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~T2_E~0)) (.cse2 (= (_ bv2 32) ~T3_E~0)) (.cse3 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= (_ bv1 32) ~t2_i~0)) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv1 32) ~t3_i~0)) (.cse7 (= ~q_free~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~m_st~0)) (.cse14 (= (_ bv2 32) ~E_3~0)) (.cse15 (= (_ bv1 32) ~t1_i~0)) (.cse16 (= ~c_dr_st~0 (_ bv0 32))) (.cse17 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= ~t2_pc~0 (_ bv1 32)) .cse3 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse4 .cse5 (= (_ bv2 32) ~E_2~0) (= ~t2_st~0 (_ bv2 32)) .cse6 .cse7 .cse8 .cse9 .cse10 (= (_ bv1 32) ~m_pc~0) .cse11 .cse12 (= ~q_req_up~0 (_ bv0 32)) .cse13 (= ~t1_st~0 (_ bv2 32)) .cse14 (= ~t1_pc~0 (_ bv1 32)) .cse15 .cse16 .cse17 (= ~t3_pc~0 (_ bv1 32))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (_ bv0 32) ~m_pc~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-22 02:38:30,481 INFO L899 garLoopResultBuilder]: For program point L669-1(line 669) no Hoare annotation was computed. [2023-12-22 02:38:30,482 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse29 (= ~c_num_read~0 (_ bv0 32))) (.cse30 (= ~p_num_write~0 (_ bv0 32))) (.cse33 (= ~c_dr_st~0 (_ bv0 32))) (.cse31 (= ~c_dr_pc~0 (_ bv0 32))) (.cse28 (= ~p_dw_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32))) (.cse26 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= (_ bv2 32) ~E_2~0)) (.cse34 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse21 (= (_ bv2 32) ~q_write_ev~0)) (.cse27 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_st~0 (_ bv2 32))) (.cse22 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse32 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_3~0)) (.cse23 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse24 (= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse29 .cse30 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse31 .cse32 .cse18 .cse23 .cse20 .cse33 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse33) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse30 .cse7 .cse12 .cse22 .cse16 .cse17 .cse31 .cse18 .cse23 .cse19 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse30 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse31 .cse18 .cse23 .cse33 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9 .cse12 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20 .cse25 (= |ULTIMATE.start_eval1_~tmp___1~0#1| (_ bv1 32))) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20))) [2023-12-22 02:38:30,482 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2023-12-22 02:38:30,482 INFO L899 garLoopResultBuilder]: For program point L1099-1(lines 1060 1107) no Hoare annotation was computed. [2023-12-22 02:38:30,482 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse28 (= ~c_num_read~0 (_ bv0 32))) (.cse29 (= ~p_num_write~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32))) (.cse30 (= ~c_dr_pc~0 (_ bv0 32))) (.cse26 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= (_ bv2 32) ~E_2~0)) (.cse31 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse21 (= (_ bv2 32) ~q_write_ev~0)) (.cse27 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_st~0 (_ bv2 32))) (.cse22 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse32 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_3~0)) (.cse23 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse24 (= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse28 .cse29 .cse7 .cse12 .cse22 .cse16 .cse17 .cse30 .cse18 .cse23 .cse19 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse28 .cse29 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse30 .cse18 .cse23 (= ~c_dr_st~0 (_ bv0 32)) .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9 .cse12 .cse16 .cse17 .cse30 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20))) [2023-12-22 02:38:30,482 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse28 (= ~c_num_read~0 (_ bv0 32))) (.cse29 (= ~p_num_write~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32))) (.cse30 (= ~c_dr_pc~0 (_ bv0 32))) (.cse26 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= (_ bv2 32) ~E_2~0)) (.cse31 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse21 (= (_ bv2 32) ~q_write_ev~0)) (.cse27 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_st~0 (_ bv2 32))) (.cse22 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse32 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_3~0)) (.cse23 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse24 (= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse28 .cse29 .cse7 .cse12 .cse22 .cse16 .cse17 .cse30 .cse18 .cse23 .cse19 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse28 .cse29 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse30 .cse18 .cse23 (= ~c_dr_st~0 (_ bv0 32)) .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9 .cse12 .cse16 .cse17 .cse30 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20))) [2023-12-22 02:38:30,482 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 413 455) no Hoare annotation was computed. [2023-12-22 02:38:30,483 INFO L895 garLoopResultBuilder]: At program point L1166(line 1166) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,483 INFO L895 garLoopResultBuilder]: At program point L1166-1(line 1166) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,483 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 876) no Hoare annotation was computed. [2023-12-22 02:38:30,483 INFO L899 garLoopResultBuilder]: For program point L869-2(lines 869 876) no Hoare annotation was computed. [2023-12-22 02:38:30,483 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse33 (= ~c_num_read~0 (_ bv0 32))) (.cse34 (= ~p_num_write~0 (_ bv0 32))) (.cse32 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32))) (.cse35 (= ~c_dr_pc~0 (_ bv0 32))) (.cse31 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse29 (= (_ bv2 32) ~q_read_ev~0)) (.cse14 (= ~p_dw_st~0 (_ bv2 32))) (.cse26 (= ~q_req_up~0 (_ bv0 32))) (.cse28 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse21 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= (_ bv2 32) ~E_2~0)) (.cse6 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse22 (= ~p_last_write~0 ~c_last_read~0)) (.cse30 (= ~p_dw_st~0 (_ bv0 32))) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= (_ bv2 32) ~E_3~0)) (.cse23 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse24 (= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= (_ bv1 32) ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse26 .cse18 .cse23 .cse19 .cse24 .cse20 .cse27) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse30 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse29 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= (_ bv1 32) ~q_write_ev~0) .cse18 .cse20 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse33 .cse34 .cse7 .cse12 .cse22 .cse16 .cse17 .cse35 .cse18 .cse23 .cse19 .cse25) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse33 .cse34 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse35 .cse18 .cse23 .cse32 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9 .cse12 .cse16 .cse17 .cse35 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse26 .cse18 .cse19 .cse20) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse26 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse29 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse26 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse30 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20 .cse27))) [2023-12-22 02:38:30,484 INFO L895 garLoopResultBuilder]: At program point L1167(line 1167) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,484 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 822 900) no Hoare annotation was computed. [2023-12-22 02:38:30,484 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2023-12-22 02:38:30,484 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2023-12-22 02:38:30,484 INFO L899 garLoopResultBuilder]: For program point transmit3_returnLabel#1(lines 644 679) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L895 garLoopResultBuilder]: At program point L1168(line 1168) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L1135(lines 1124 1137) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L1069-1(lines 1063 1106) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L838-1(lines 828 894) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 173 225) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L409(lines 398 411) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L773-1(lines 767 790) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 608 643) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 340 393) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 584) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L899 garLoopResultBuilder]: For program point L1171(line 1171) no Hoare annotation was computed. [2023-12-22 02:38:30,485 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse23 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse24 (= ~c_num_read~0 (_ bv0 32))) (.cse25 (= ~p_num_write~0 (_ bv0 32))) (.cse26 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= ~q_req_up~0 (_ bv0 32))) (.cse29 (= ~c_dr_st~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= (_ bv2 32) ~q_read_ev~0)) (.cse18 (= (_ bv2 32) ~E_2~0)) (.cse6 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= ~t3_st~0 (_ bv0 32))) (.cse19 (= ~t3_pc~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse21 (= ~t2_pc~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~E_1~0)) (.cse13 (= (_ bv0 32) ~m_pc~0)) (.cse15 (= (_ bv2 32) ~E_3~0)) (.cse27 (= ~q_free~0 (_ bv1 32))) (.cse16 (= (_ bv2 32) ~c_dr_st~0)) (.cse28 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~t1_pc~0 (_ bv0 32))) (.cse22 (= |ULTIMATE.start_eval1_~tmp___1~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse21 .cse12 .cse13 .cse15 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse18 .cse6 .cse7 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse21 .cse12 .cse13 .cse15 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse25 .cse7 .cse10 .cse12 .cse13 .cse26 .cse15 .cse27 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse18 .cse6 .cse7 .cse8 .cse19 .cse20 .cse10 .cse11 .cse21 .cse12 .cse13 .cse15 .cse27 .cse16 .cse28 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9 .cse10 .cse12 .cse13 .cse26 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_num_write~0 (_ bv1 32)) .cse5 .cse24 .cse18 .cse6 .cse7 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse21 .cse12 .cse13 .cse26 .cse15 .cse17 .cse29 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse25 .cse18 .cse6 .cse7 .cse8 .cse19 .cse20 .cse10 .cse11 .cse21 .cse12 .cse13 .cse26 .cse14 .cse15 .cse27 .cse17 .cse29 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse19 .cse20 .cse10 .cse11 .cse21 .cse12 .cse13 .cse15 .cse27 .cse16 .cse28 .cse17 .cse22))) [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L841(lines 841 848) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L841-2(lines 841 848) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L1173(lines 1173 1182) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L1173-2(lines 1173 1182) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L1074-1(lines 1063 1106) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L612(lines 612 620) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 583) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse29 (= ~c_num_read~0 (_ bv0 32))) (.cse30 (= ~p_num_write~0 (_ bv0 32))) (.cse33 (= ~c_dr_st~0 (_ bv0 32))) (.cse31 (= ~c_dr_pc~0 (_ bv0 32))) (.cse28 (= ~p_dw_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32))) (.cse26 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= (_ bv2 32) ~E_2~0)) (.cse34 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse21 (= (_ bv2 32) ~q_write_ev~0)) (.cse27 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_st~0 (_ bv2 32))) (.cse22 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse32 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_3~0)) (.cse23 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse24 (= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse29 .cse30 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse31 .cse32 .cse18 .cse23 .cse20 .cse33 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse33) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse30 .cse7 .cse12 .cse22 .cse16 .cse17 .cse31 .cse18 .cse23 .cse19 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse30 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse31 .cse18 .cse23 .cse33 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9 .cse12 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20 .cse25 (= |ULTIMATE.start_eval1_~tmp___1~0#1| (_ bv1 32))) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20))) [2023-12-22 02:38:30,486 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2023-12-22 02:38:30,486 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse26 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse8 (= (_ bv2 32) ~E_2~0)) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse13 (= (_ bv0 32) ~m_st~0)) (.cse17 (= ~t2_pc~0 (_ bv0 32))) (.cse22 (= |ULTIMATE.start_eval1_~tmp___1~0#1| (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (_ bv2 32) ~E_M~0)) (.cse3 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= (_ bv2 32) ~T3_E~0)) (.cse5 (= (_ bv2 32) ~q_write_ev~0)) (.cse6 (= (_ bv2 32) ~q_read_ev~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~M_E~0)) (.cse11 (= ~t3_st~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_st~0 (_ bv2 32))) (.cse23 (= ~p_last_write~0 ~c_last_read~0)) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse27 (= ~q_req_up~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~E_3~0)) (.cse24 (= ~q_free~0 (_ bv1 32))) (.cse25 (= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 (= ~q_free~0 (_ bv0 32)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse14 .cse16 .cse23 .cse18 .cse19 .cse20 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 (= ~p_dw_st~0 (_ bv0 32)) .cse17 .cse18 .cse19 .cse27 .cse20 .cse24 .cse25 .cse21 .cse26 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse23 .cse18 .cse19 .cse27 .cse20 .cse24 .cse25 .cse21))) [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L778-1(lines 767 790) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L250-1(lines 241 258) no Hoare annotation was computed. [2023-12-22 02:38:30,486 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2023-12-22 02:38:30,487 INFO L899 garLoopResultBuilder]: For program point L648(lines 648 656) no Hoare annotation was computed. [2023-12-22 02:38:30,487 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 619) no Hoare annotation was computed. [2023-12-22 02:38:30,487 INFO L895 garLoopResultBuilder]: At program point L549(line 549) the Hoare annotation is: (let ((.cse25 (= ~t1_st~0 (_ bv0 32))) (.cse29 (= ~t1_pc~0 (_ bv0 32))) (.cse11 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse26 (= ~t3_st~0 (_ bv0 32))) (.cse27 (= ~t3_pc~0 (_ bv0 32))) (.cse30 (= ~t2_st~0 (_ bv0 32))) (.cse31 (= ~t2_pc~0 (_ bv0 32))) (.cse28 (= (_ bv0 32) ~m_pc~0)) (.cse23 (= ~local~0 ~token~0)) (.cse24 (= ~t1_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse14 (= ~p_dw_st~0 (_ bv0 32))) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse32 (not (= ~t3_pc~0 (_ bv1 32)))) (.cse17 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= (_ bv2 32) ~E_3~0)) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~p_dw_pc~0 (_ bv0 32))) (.cse22 (= ~t3_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 (= (_ bv1 32) ~m_pc~0) .cse15 .cse16 .cse23 .cse17 .cse18 .cse24 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse26 .cse10 .cse27 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse18 .cse19 .cse29 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse23 .cse17 .cse18 .cse24 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse27 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse23 .cse17 .cse18 .cse24 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse27 .cse12 .cse30 .cse13 .cse14 .cse31 .cse28 .cse15 .cse16 .cse18 .cse19 .cse29 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse10 .cse12 .cse30 .cse13 .cse14 .cse31 .cse28 .cse15 .cse16 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse30 .cse13 .cse14 .cse31 .cse28 .cse15 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse30 .cse13 .cse14 .cse31 .cse28 .cse15 .cse16 .cse23 .cse17 .cse18 .cse24 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10 .cse27 .cse12 .cse30 .cse13 .cse14 .cse31 .cse28 .cse15 .cse16 .cse23 .cse17 .cse18 .cse24 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) [2023-12-22 02:38:30,487 INFO L899 garLoopResultBuilder]: For program point L549-1(line 549) no Hoare annotation was computed. [2023-12-22 02:38:30,487 INFO L899 garLoopResultBuilder]: For program point L1210(lines 1210 1216) no Hoare annotation was computed. [2023-12-22 02:38:30,487 INFO L895 garLoopResultBuilder]: At program point L1177(line 1177) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,487 INFO L899 garLoopResultBuilder]: For program point L1177-1(line 1177) no Hoare annotation was computed. [2023-12-22 02:38:30,488 INFO L895 garLoopResultBuilder]: At program point L880-1(lines 828 894) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,488 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2023-12-22 02:38:30,488 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2023-12-22 02:38:30,488 INFO L899 garLoopResultBuilder]: For program point L1079-1(lines 1063 1106) no Hoare annotation was computed. [2023-12-22 02:38:30,488 INFO L899 garLoopResultBuilder]: For program point L1212(lines 1212 1215) no Hoare annotation was computed. [2023-12-22 02:38:30,488 INFO L899 garLoopResultBuilder]: For program point L783-1(lines 764 791) no Hoare annotation was computed. [2023-12-22 02:38:30,488 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 655) no Hoare annotation was computed. [2023-12-22 02:38:30,488 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~T3_E~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~t3_st~0 (_ bv0 32)) (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~t2_st~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~t2_pc~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= (_ bv2 32) ~E_3~0) (= ~q_free~0 (_ bv1 32)) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:38:30,488 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2023-12-22 02:38:30,488 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2023-12-22 02:38:30,489 INFO L895 garLoopResultBuilder]: At program point L1147(line 1147) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~T3_E~0) (= ~c_num_read~0 (_ bv0 32)) (= (_ bv1 32) ~t2_i~0) (= ~p_num_write~0 (_ bv0 32)) (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= (_ bv1 32) ~t3_i~0) (= ~t3_st~0 (_ bv0 32)) (= ~q_free~0 (_ bv0 32)) (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~t2_st~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~t2_pc~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv2 32) ~E_3~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:38:30,489 INFO L899 garLoopResultBuilder]: For program point L1147-1(line 1147) no Hoare annotation was computed. [2023-12-22 02:38:30,489 INFO L899 garLoopResultBuilder]: For program point L883(lines 883 890) no Hoare annotation was computed. [2023-12-22 02:38:30,489 INFO L899 garLoopResultBuilder]: For program point L883-2(lines 883 890) no Hoare annotation was computed. [2023-12-22 02:38:30,489 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-22 02:38:30,489 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2023-12-22 02:38:30,489 INFO L895 garLoopResultBuilder]: At program point L587-1(lines 587 600) the Hoare annotation is: (let ((.cse31 (= ~t2_pc~0 (_ bv1 32)))) (let ((.cse30 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse32 (= (_ bv1 32) ~m_pc~0)) (.cse33 (= ~t1_pc~0 (_ bv1 32))) (.cse35 (not .cse31)) (.cse28 (not (= ~t3_pc~0 (_ bv1 32)))) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse11 (= ~t3_pc~0 (_ bv0 32))) (.cse27 (= (_ bv2 32) ~m_st~0)) (.cse34 (= ~t2_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= ~t2_pc~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_1~0)) (.cse19 (= (_ bv0 32) ~m_pc~0)) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse21 (= ~q_req_up~0 (_ bv0 32))) (.cse22 (= ~local~0 ~token~0)) (.cse23 (= (_ bv2 32) ~E_3~0)) (.cse24 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~c_dr_st~0 (_ bv0 32))) (.cse26 (= ~p_dw_pc~0 (_ bv0 32))) (.cse29 (= ~t3_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse27 .cse28 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse30 .cse31 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse21 .cse27 .cse23 .cse33 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse30 .cse31 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse32 .cse18 .cse20 .cse21 .cse27 .cse23 .cse33 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse27 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse10 .cse35 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse10 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse28 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse27 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse10 .cse13 .cse15 .cse16 .cse18 .cse20 .cse21 .cse27 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse27 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse18 .cse20 .cse21 .cse27 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse10 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse29)))) [2023-12-22 02:38:30,489 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= (_ bv0 32) ~m_pc~0)) (.cse12 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~E_3~0)) (.cse14 (= ~q_free~0 (_ bv1 32))) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ~q_read_ev~0) .cse5 .cse6 (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) .cse7 (= ~t3_st~0 (_ bv0 32)) (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) .cse8 (= ~t2_st~0 (_ bv0 32)) .cse9 (= ~p_dw_st~0 (_ bv0 32)) (= ~t2_pc~0 (_ bv0 32)) .cse10 .cse11 .cse12 (= ~q_req_up~0 (_ bv0 32)) .cse13 .cse14 (= ~t1_pc~0 (_ bv0 32)) .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (_ bv2 32) ~c_dr_st~0) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_dw_st~0 (_ bv2 32)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-22 02:38:30,489 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= (_ bv0 32) ~m_pc~0)) (.cse12 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~E_3~0)) (.cse14 (= ~q_free~0 (_ bv1 32))) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ~q_read_ev~0) .cse5 .cse6 (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) .cse7 (= ~t3_st~0 (_ bv0 32)) (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) .cse8 (= ~t2_st~0 (_ bv0 32)) .cse9 (= ~p_dw_st~0 (_ bv0 32)) (= ~t2_pc~0 (_ bv0 32)) .cse10 .cse11 .cse12 (= ~q_req_up~0 (_ bv0 32)) .cse13 .cse14 (= ~t1_pc~0 (_ bv0 32)) .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (_ bv2 32) ~c_dr_st~0) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_dw_st~0 (_ bv2 32)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-22 02:38:30,489 INFO L895 garLoopResultBuilder]: At program point L1149(line 1149) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~t3_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_last_write~0 ~c_last_read~0)) (.cse15 (= ~p_dw_st~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= (_ bv2 32) ~E_3~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse22 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv2 32) ~E_2~0) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) .cse12 .cse13 .cse14 .cse15 (= ~t2_pc~0 (_ bv0 32)) .cse16 .cse17 .cse18 (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= (_ bv2 32) ~m_st~0) .cse19 .cse20 .cse21 .cse22 .cse23))) [2023-12-22 02:38:30,490 INFO L895 garLoopResultBuilder]: At program point L1149-1(line 1149) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~t3_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_last_write~0 ~c_last_read~0)) (.cse15 (= ~p_dw_st~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= (_ bv2 32) ~E_3~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse22 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv2 32) ~E_2~0) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) .cse12 .cse13 .cse14 .cse15 (= ~t2_pc~0 (_ bv0 32)) .cse16 .cse17 .cse18 (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= (_ bv2 32) ~m_st~0) .cse19 .cse20 .cse21 .cse22 .cse23))) [2023-12-22 02:38:30,490 INFO L899 garLoopResultBuilder]: For program point L852-1(lines 828 894) no Hoare annotation was computed. [2023-12-22 02:38:30,490 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= (_ bv0 32) ~m_pc~0)) (.cse12 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~E_3~0)) (.cse14 (= ~q_free~0 (_ bv1 32))) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ~q_read_ev~0) .cse5 .cse6 (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) .cse7 (= ~t3_st~0 (_ bv0 32)) (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) .cse8 (= ~t2_st~0 (_ bv0 32)) .cse9 (= ~p_dw_st~0 (_ bv0 32)) (= ~t2_pc~0 (_ bv0 32)) .cse10 .cse11 .cse12 (= ~q_req_up~0 (_ bv0 32)) .cse13 .cse14 (= ~t1_pc~0 (_ bv0 32)) .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (_ bv2 32) ~c_dr_st~0) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_dw_st~0 (_ bv2 32)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-22 02:38:30,490 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2023-12-22 02:38:30,490 INFO L895 garLoopResultBuilder]: At program point L1150(line 1150) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~t3_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_last_write~0 ~c_last_read~0)) (.cse15 (= ~p_dw_st~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= (_ bv2 32) ~E_3~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32))) (.cse22 (= ~c_dr_st~0 (_ bv0 32))) (.cse23 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv2 32) ~E_2~0) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t3_pc~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) .cse12 .cse13 .cse14 .cse15 (= ~t2_pc~0 (_ bv0 32)) .cse16 .cse17 .cse18 (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= (_ bv2 32) ~m_st~0) .cse19 .cse20 .cse21 .cse22 .cse23))) [2023-12-22 02:38:30,490 INFO L899 garLoopResultBuilder]: For program point L1084-1(lines 1063 1106) no Hoare annotation was computed. [2023-12-22 02:38:30,490 INFO L895 garLoopResultBuilder]: At program point L623-1(lines 623 636) the Hoare annotation is: (let ((.cse33 (= ~t2_pc~0 (_ bv1 32))) (.cse35 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse22 (= ~t1_st~0 (_ bv2 32))) (.cse28 (not .cse35)) (.cse13 (= (_ bv0 32) ~m_st~0)) (.cse18 (= (_ bv0 32) ~m_pc~0)) (.cse32 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse31 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse11 (not .cse33)) (.cse14 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse34 (= (_ bv1 32) ~m_pc~0)) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse19 (= ~c_dr_pc~0 (_ bv0 32))) (.cse20 (= ~q_req_up~0 (_ bv0 32))) (.cse30 (= (_ bv2 32) ~m_st~0)) (.cse21 (= ~local~0 ~token~0)) (.cse23 (= (_ bv2 32) ~E_3~0)) (.cse24 (= ~t1_pc~0 (_ bv1 32))) (.cse25 (= (_ bv1 32) ~t1_i~0)) (.cse26 (= ~c_dr_st~0 (_ bv0 32))) (.cse27 (= ~p_dw_pc~0 (_ bv0 32))) (.cse29 (= ~t3_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse22 .cse23 .cse25 .cse26 .cse27 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse30 .cse23 .cse25 .cse32 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15 .cse16 .cse34 .cse17 .cse19 .cse20 .cse30 .cse22 .cse23 .cse24 .cse25 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse26 .cse27 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse34 .cse17 .cse19 .cse20 .cse30 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse30 .cse28 .cse23 .cse25 .cse26 .cse27 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse25 .cse32 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse30 .cse22 .cse23 .cse25 .cse26 .cse27 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse23 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse23 .cse25 .cse32 .cse26 .cse27 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse10 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse30 .cse23 .cse25 .cse32 .cse26 .cse27 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse25 .cse32 .cse26 .cse27 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse10 .cse11 .cse14 .cse15 .cse16 .cse34 .cse17 .cse19 .cse20 .cse30 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29)))) [2023-12-22 02:38:30,490 INFO L895 garLoopResultBuilder]: At program point L557-1(lines 543 564) the Hoare annotation is: (let ((.cse31 (not (= ~t3_pc~0 (_ bv1 32)))) (.cse11 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse25 (= ~t3_st~0 (_ bv0 32))) (.cse26 (= ~t3_pc~0 (_ bv0 32))) (.cse29 (= ~t2_st~0 (_ bv0 32))) (.cse30 (= ~t2_pc~0 (_ bv0 32))) (.cse32 (= ~local~0 ~token~0)) (.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse33 (= ~t1_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse24 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse14 (= ~p_dw_st~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse16 (= ~c_dr_pc~0 (_ bv0 32))) (.cse17 (= ~q_req_up~0 (_ bv0 32))) (.cse19 (= (_ bv2 32) ~E_3~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse28 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32))) (.cse23 (= ~t3_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse25 .cse10 .cse26 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse9 .cse25 .cse10 .cse26 .cse12 .cse29 .cse13 .cse14 .cse30 .cse15 .cse27 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse29 .cse13 .cse14 .cse30 .cse15 .cse27 .cse16 .cse17 .cse31 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse29 .cse13 .cse14 .cse30 .cse15 .cse27 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse31 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse9 .cse10 .cse12 .cse29 .cse13 .cse14 .cse30 .cse15 .cse27 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 (= (_ bv1 32) ~m_pc~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse26 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse26 .cse12 .cse29 .cse13 .cse14 .cse30 .cse15 .cse27 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23))) [2023-12-22 02:38:30,491 INFO L899 garLoopResultBuilder]: For program point L855(lines 855 862) no Hoare annotation was computed. [2023-12-22 02:38:30,491 INFO L899 garLoopResultBuilder]: For program point L855-2(lines 855 862) no Hoare annotation was computed. [2023-12-22 02:38:30,491 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-22 02:38:30,491 INFO L899 garLoopResultBuilder]: For program point L1186(lines 1186 1190) no Hoare annotation was computed. [2023-12-22 02:38:30,491 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse28 (= ~p_dw_st~0 (_ bv0 32))) (.cse4 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse29 (= ~c_num_read~0 (_ bv0 32))) (.cse30 (= ~p_num_write~0 (_ bv0 32))) (.cse33 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32))) (.cse31 (= ~c_dr_pc~0 (_ bv0 32))) (.cse26 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= (_ bv2 32) ~E_2~0)) (.cse34 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~t3_pc~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse21 (= (_ bv2 32) ~q_write_ev~0)) (.cse27 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= ~t3_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_st~0 (_ bv2 32))) (.cse22 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse32 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~E_3~0)) (.cse23 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse24 (= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse29 .cse30 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse28 .cse15 .cse16 .cse17 .cse31 .cse32 .cse18 .cse23 .cse20 .cse33 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse33) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse30 .cse7 .cse12 .cse22 .cse16 .cse17 .cse31 .cse18 .cse23 .cse19 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse29 .cse30 .cse7 .cse12 .cse14 .cse22 .cse16 .cse17 .cse31 .cse18 .cse23 .cse33 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9 .cse12 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse27 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse32 .cse18 .cse23 .cse19 .cse24 .cse20))) [2023-12-22 02:38:30,491 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2023-12-22 02:38:30,491 INFO L895 garLoopResultBuilder]: At program point L1154-1(lines 1154 1191) the Hoare annotation is: (let ((.cse38 (= ~t2_pc~0 (_ bv1 32))) (.cse39 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse36 (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) (.cse37 (= (_ bv1 32) ~m_pc~0)) (.cse26 (not .cse39)) (.cse29 (= ~t2_pc~0 (_ bv0 32))) (.cse11 (not .cse38)) (.cse14 (= ~t2_st~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse28 (= ~t1_st~0 (_ bv0 32))) (.cse35 (= ~t1_pc~0 (_ bv0 32))) (.cse27 (= ~t3_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse30 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= (_ bv1 32) ~t3_i~0)) (.cse9 (= ~t3_st~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~t3_pc~0 (_ bv0 32))) (.cse31 (= (_ bv0 32) ~m_st~0)) (.cse13 (= (_ bv2 32) ~T1_E~0)) (.cse15 (= ~p_last_write~0 ~c_last_read~0)) (.cse16 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse32 (= (_ bv0 32) ~m_pc~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse33 (= ~local~0 ~token~0)) (.cse21 (= ~t1_st~0 (_ bv2 32))) (.cse22 (= (_ bv2 32) ~E_3~0)) (.cse34 (= ~t1_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ~t1_i~0)) (.cse24 (= ~c_dr_st~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse34 .cse23 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse38 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27 .cse39) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse37 .cse29 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse11 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse37 .cse17 .cse18 .cse19 .cse20 .cse33 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse26 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse10 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse28 .cse8 .cse10 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse22 .cse23 .cse35 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse13 .cse15 .cse16 .cse17 .cse32 .cse18 .cse19 .cse33 .cse21 .cse22 .cse34 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,492 INFO L895 garLoopResultBuilder]: At program point L659-1(lines 659 672) the Hoare annotation is: (let ((.cse34 (= ~t2_pc~0 (_ bv1 32))) (.cse35 (= ~t3_pc~0 (_ bv1 32)))) (let ((.cse15 (= (_ bv1 32) ~m_pc~0)) (.cse12 (= ~t2_st~0 (_ bv0 32))) (.cse16 (= ~t2_pc~0 (_ bv0 32))) (.cse31 (= ~t1_st~0 (_ bv2 32))) (.cse24 (= ~t1_pc~0 (_ bv1 32))) (.cse29 (= (_ bv0 32) ~m_st~0)) (.cse30 (= (_ bv0 32) ~m_pc~0)) (.cse21 (not .cse35)) (.cse22 (= ~local~0 ~token~0)) (.cse28 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~T3_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse32 (= ~t2_st~0 (_ bv2 32))) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~t3_i~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse33 (not .cse34)) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse14 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse18 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~q_req_up~0 (_ bv0 32))) (.cse20 (= (_ bv2 32) ~m_st~0)) (.cse23 (= (_ bv2 32) ~E_3~0)) (.cse25 (= (_ bv1 32) ~t1_i~0)) (.cse26 (= ~c_dr_st~0 (_ bv0 32))) (.cse27 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse25 .cse28 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse30 .cse18 .cse19 .cse21 .cse22 .cse31 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse9 .cse10 .cse33 .cse29 .cse11 .cse13 .cse14 .cse17 .cse30 .cse18 .cse19 .cse31 .cse23 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse9 .cse10 .cse11 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse31 .cse23 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse34 .cse4 (= (bvadd ~local~0 (_ bv3 32)) ~token~0) .cse5 .cse6 .cse7 .cse32 .cse9 .cse10 .cse29 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse31 .cse23 .cse24 .cse25 .cse26 .cse27 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse33 .cse29 .cse11 .cse13 .cse14 .cse17 .cse30 .cse18 .cse19 .cse23 .cse25 .cse28 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse33 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse31 .cse23 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse30 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse28 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse9 .cse10 .cse29 .cse11 .cse13 .cse14 .cse17 .cse30 .cse18 .cse19 .cse21 .cse22 .cse31 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse13 .cse14 .cse17 .cse30 .cse18 .cse20 .cse23 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse23 .cse25 .cse28 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse29 .cse11 .cse13 .cse14 .cse17 .cse30 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse28 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse33 .cse11 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse23 .cse25 .cse26 .cse27)))) [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point L1089-1(lines 1063 1106) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point $Ultimate##107(lines 557 563) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point L84(lines 72 86) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point L275(lines 262 277) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-12-22 02:38:30,492 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point L800(lines 800 815) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point L796(lines 796 816) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point L818(lines 795 820) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 792 821) the Hoare annotation is: true [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point L808(lines 808 813) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point L804(lines 804 814) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 792 821) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2023-12-22 02:38:30,493 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2023-12-22 02:38:30,494 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse35 (= ~p_dw_st~0 (_ bv2 32))) (.cse8 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse33 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse45 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse31 (= ~p_last_write~0 ~q_buf_0~0)) (.cse44 (= (_ bv2 32) ~q_write_ev~0)) (.cse32 (= (_ bv2 32) ~q_read_ev~0)) (.cse52 (= |old(~q_write_ev~0)| (_ bv2 32))) (.cse34 (= (_ bv2 32) |old(~q_read_ev~0)|)) (.cse49 (= ~p_last_write~0 ~c_last_read~0)) (.cse50 (= ~q_free~0 (_ bv1 32))) (.cse51 (= ~p_num_write~0 ~c_num_read~0))) (let ((.cse43 (and .cse31 .cse44 .cse32 .cse52 .cse34 .cse49 .cse50 .cse51)) (.cse27 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse9 (= (_ bv1 32) ~q_read_ev~0)) (.cse16 (not (= |old(~q_read_ev~0)| (_ bv1 32)))) (.cse38 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse39 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse40 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse42 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse46 (and .cse44 .cse45)) (.cse5 (not .cse52)) (.cse41 (and .cse44 .cse32)) (.cse37 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse28 (not .cse34)) (.cse30 (not .cse33)) (.cse6 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse29 (not (= ~q_free~0 (_ bv0 32)))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse2 (not (= (_ bv2 32) ~E_3~0))) (.cse3 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse4 (not (= (_ bv0 32) ~m_st~0))) (.cse7 (not .cse51)) (.cse10 (not (= (_ bv2 32) ~T3_E~0))) (.cse11 (not (= (_ bv2 32) ~T1_E~0))) (.cse12 (not (= ~t3_st~0 (_ bv0 32)))) (.cse13 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse14 (not (= (_ bv0 32) ~m_pc~0))) (.cse15 (not (= (_ bv2 32) ~T2_E~0))) (.cse48 (= ~c_dr_pc~0 (_ bv1 32))) (.cse47 (and .cse8 .cse45)) (.cse17 (not (= ~t1_st~0 (_ bv0 32)))) (.cse18 (not (= (_ bv2 32) ~E_1~0))) (.cse19 (not (= ~t2_st~0 (_ bv0 32)))) (.cse20 (not (= (_ bv2 32) ~E_M~0))) (.cse21 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse22 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse36 (not .cse35)) (.cse23 (not .cse31)) (.cse24 (not (= (_ bv2 32) ~E_2~0))) (.cse25 (not .cse50)) (.cse26 (not .cse49))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse28 .cse29 .cse15 .cse30 .cse17 .cse18 .cse19 (not (= |old(~q_write_ev~0)| (_ bv1 32))) .cse20 (and .cse31 .cse32 .cse33 .cse34 .cse35 (= (_ bv1 32) ~q_write_ev~0)) .cse21 .cse22 .cse36 .cse23 .cse24) (or .cse37 .cse0 .cse38 .cse2 .cse4 .cse5 .cse6 .cse10 .cse11 .cse27 .cse39 .cse12 .cse13 .cse14 .cse28 .cse40 .cse15 .cse41 .cse17 .cse18 .cse19 .cse20 .cse42 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse23 .cse43 .cse24 .cse25 .cse26) (or .cse37 .cse0 (and .cse44 .cse35 .cse45) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse23 .cse24 .cse25 .cse26) (or .cse37 .cse0 .cse2 .cse3 .cse5 .cse7 .cse10 .cse11 .cse12 .cse14 .cse28 .cse15 .cse17 .cse18 .cse19 .cse20 .cse22 .cse36 .cse23 .cse43 .cse25 .cse26) (or .cse0 .cse38 .cse2 .cse5 .cse10 .cse11 .cse27 .cse39 .cse14 .cse40 .cse15 .cse18 .cse20 .cse42 .cse36 .cse23 .cse46 .cse25 .cse26) (or .cse37 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse44 .cse35 .cse9) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse2 .cse3 .cse10 .cse11 .cse14 .cse29 .cse15 .cse47 .cse18 .cse20 .cse42 .cse23) (or .cse0 .cse38 .cse2 .cse3 .cse5 .cse7 .cse10 .cse11 .cse14 .cse15 .cse18 .cse20 .cse36 .cse23 .cse46 .cse25 .cse26) (or .cse0 .cse38 .cse2 .cse3 .cse5 .cse10 .cse11 .cse39 .cse14 .cse40 .cse15 .cse18 .cse20 .cse42 .cse23 .cse46 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11 .cse12 .cse13 .cse14 .cse28 .cse29 .cse15 .cse41 .cse30 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse23 .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse48 .cse47 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse37 .cse0 .cse2 .cse3 .cse5 .cse10 .cse11 .cse12 .cse14 .cse28 .cse29 .cse15 .cse41 .cse17 .cse18 .cse19 .cse20 .cse22 .cse36 .cse23) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse48 .cse47 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse23 .cse24) (or .cse37 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 .cse14 .cse28 .cse29 .cse15 .cse30 (and .cse31 .cse32 .cse8 .cse33 .cse34 .cse35) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse23 .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse48 .cse47 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse48 .cse47 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse36 .cse23 .cse24 .cse25 .cse26)))) [2023-12-22 02:38:30,494 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2023-12-22 02:38:30,494 INFO L899 garLoopResultBuilder]: For program point L958-1(lines 952 995) no Hoare annotation was computed. [2023-12-22 02:38:30,494 INFO L899 garLoopResultBuilder]: For program point L983-1(lines 952 995) no Hoare annotation was computed. [2023-12-22 02:38:30,494 INFO L899 garLoopResultBuilder]: For program point L973-1(lines 952 995) no Hoare annotation was computed. [2023-12-22 02:38:30,494 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 949 996) the Hoare annotation is: (let ((.cse39 (= (_ bv2 32) ~E_M~0)) (.cse40 (= (_ bv2 32) ~T2_E~0)) (.cse41 (= (_ bv2 32) ~T3_E~0)) (.cse42 (= (_ bv2 32) ~T1_E~0)) (.cse43 (= |old(~M_E~0)| ~M_E~0)) (.cse44 (= (_ bv2 32) ~E_1~0)) (.cse45 (= (_ bv2 32) ~E_3~0)) (.cse2 (= ~t2_pc~0 (_ bv1 32)))) (let ((.cse46 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse37 (not (= ~t3_pc~0 (_ bv0 32)))) (.cse38 (not .cse2)) (.cse36 (not (= (_ bv1 32) ~m_pc~0))) (.cse34 (not (= ~t3_st~0 (_ bv0 32)))) (.cse19 (not (= (_ bv2 32) ~m_st~0))) (.cse31 (= ~t3_pc~0 (_ bv1 32))) (.cse14 (not (= ~t1_st~0 (_ bv0 32)))) (.cse30 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse6 (not (= ~t2_st~0 (_ bv2 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse26 (not (= (_ bv0 32) ~m_st~0))) (.cse3 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse4 (and .cse39 .cse40 .cse41 (= (_ bv2 32) ~E_2~0) .cse42 .cse43 .cse44 .cse45)) (.cse5 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse7 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse33 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse9 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse10 (not (= (_ bv1 32) ~t1_i~0))) (.cse11 (not (= (_ bv2 32) |old(~E_2~0)|))) (.cse27 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse35 (not (= ~local~0 ~token~0))) (.cse28 (not (= (_ bv0 32) ~m_pc~0))) (.cse12 (not (= ~q_free~0 (_ bv0 32)))) (.cse13 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse15 (not (= (_ bv2 32) |old(~E_3~0)|))) (.cse16 (not (= (_ bv2 32) |old(~T2_E~0)|))) (.cse17 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse29 (not (= ~t2_st~0 (_ bv0 32)))) (.cse18 (not (= (_ bv1 32) ~t2_i~0))) (.cse32 (not (= ~t1_st~0 (_ bv2 32)))) (.cse20 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse21 (not (= ~t3_st~0 (_ bv2 32)))) (.cse22 (not (= (_ bv2 32) |old(~T3_E~0)|))) (.cse23 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (= (_ bv1 32) ~t3_i~0))) (.cse25 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse27 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse18 .cse19 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse35 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse35 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse19 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse27 .cse35 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse12 .cse38 .cse13 .cse15 .cse16 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse17 .cse36 .cse18 .cse32 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse27 .cse35 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse37 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse35 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse27 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse1 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 (and .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse36 .cse18 .cse32 .cse19 .cse20 .cse21 .cse46 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse35 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse36 .cse18 .cse32 .cse19 .cse20 .cse37 .cse46 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse37 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 (not (= (bvadd ~local~0 (_ bv3 32)) ~token~0)) .cse12 .cse38 .cse13 .cse15 .cse16 .cse17 (not .cse31) .cse36 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse31) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse35 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse3 .cse4 .cse5 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse27 .cse35 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse18 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2023-12-22 02:38:30,495 INFO L899 garLoopResultBuilder]: For program point L963-1(lines 952 995) no Hoare annotation was computed. [2023-12-22 02:38:30,495 INFO L899 garLoopResultBuilder]: For program point L988-1(lines 949 996) no Hoare annotation was computed. [2023-12-22 02:38:30,495 INFO L899 garLoopResultBuilder]: For program point L953-1(lines 952 995) no Hoare annotation was computed. [2023-12-22 02:38:30,495 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 949 996) no Hoare annotation was computed. [2023-12-22 02:38:30,495 INFO L899 garLoopResultBuilder]: For program point L978-1(lines 952 995) no Hoare annotation was computed. [2023-12-22 02:38:30,495 INFO L899 garLoopResultBuilder]: For program point L968-1(lines 952 995) no Hoare annotation was computed. [2023-12-22 02:38:30,498 INFO L445 BasicCegarLoop]: Path program histogram: [3, 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] [2023-12-22 02:38:30,499 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 02:38:30,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:38:30 BoogieIcfgContainer [2023-12-22 02:38:30,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 02:38:30,598 INFO L158 Benchmark]: Toolchain (without parser) took 282649.67ms. Allocated memory was 192.9MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 137.4MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2023-12-22 02:38:30,599 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:38:30,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.05ms. Allocated memory is still 192.9MB. Free memory was 137.1MB in the beginning and 117.2MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-22 02:38:30,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.38ms. Allocated memory is still 192.9MB. Free memory was 117.2MB in the beginning and 114.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-22 02:38:30,603 INFO L158 Benchmark]: Boogie Preprocessor took 59.11ms. Allocated memory is still 192.9MB. Free memory was 114.0MB in the beginning and 110.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-22 02:38:30,604 INFO L158 Benchmark]: RCFGBuilder took 701.82ms. Allocated memory was 192.9MB in the beginning and 266.3MB in the end (delta: 73.4MB). Free memory was 110.1MB in the beginning and 196.0MB in the end (delta: -85.9MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2023-12-22 02:38:30,604 INFO L158 Benchmark]: TraceAbstraction took 281485.80ms. Allocated memory was 266.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 195.5MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2023-12-22 02:38:30,605 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 346.05ms. Allocated memory is still 192.9MB. Free memory was 137.1MB in the beginning and 117.2MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.38ms. Allocated memory is still 192.9MB. Free memory was 117.2MB in the beginning and 114.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.11ms. Allocated memory is still 192.9MB. Free memory was 114.0MB in the beginning and 110.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 701.82ms. Allocated memory was 192.9MB in the beginning and 266.3MB in the end (delta: 73.4MB). Free memory was 110.1MB in the beginning and 196.0MB in the end (delta: -85.9MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * TraceAbstraction took 281485.80ms. Allocated memory was 266.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 195.5MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 496]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 28]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 232 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 281.3s, OverallIterations: 54, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 182.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13482 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13160 mSDsluCounter, 32522 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17899 mSDsCounter, 1152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10136 IncrementalHoareTripleChecker+Invalid, 11288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1152 mSolverCounterUnsat, 14623 mSDtfsCounter, 10136 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7406 GetRequests, 7274 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23587occurred in iteration=37, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.1s AutomataMinimizationTime, 54 MinimizatonAttempts, 4373 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 18645 PreInvPairs, 20546 NumberOfFragments, 73424 HoareAnnotationTreeSize, 18645 FormulaSimplifications, 10985 FormulaSimplificationTreeSizeReduction, 30.7s HoareSimplificationTime, 54 FormulaSimplificationsInter, 326798 FormulaSimplificationTreeSizeReductionInter, 151.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 7105 NumberOfCodeBlocks, 7076 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 7371 ConstructedInterpolants, 0 QuantifiedInterpolants, 12450 SizeOfPredicates, 11 NumberOfNonLiveVariables, 15084 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 56 InterpolantComputations, 53 PerfectInterpolantSequences, 5039/5202 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 1154]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (((local + 3) % 4294967296) == token)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2)) && (t3_pc == 1))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2)) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (((local + 3) % 4294967296) == token)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) - InvariantResult [Line: 828]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (((local + 3) % 4294967296) == token)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2)) && (t3_pc == 1))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 659]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (((local + 3) % 4294967296) == token)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_pc == 1))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_pc == 1))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (t3_st == 0)) && (q_free == 0)) && !((t2_pc == 1))) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && !((t3_pc == 1))) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (2 == E_3)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (1 == t3_i)) && (q_free == 0)) && !((t2_pc == 1))) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_pc)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (2 == E_3)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) && (t3_st == 2))) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (t1_pc == 0)) || (((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (p_num_write == c_num_read)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (p_num_write == c_num_read)) && (t1_pc == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (p_num_write == c_num_read)) && (t1_pc == 0))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0)) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == M_E)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (2 == c_dr_st))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (p_num_write == 1)) && (2 == q_read_ev)) && (c_num_read == 0)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0)) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (2 == c_dr_st))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0)) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (t1_pc == 0)) && (c_dr_st == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (q_free == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == E_3)) && (2 == c_dr_st))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0)) && (p_dw_pc == 0)) && (tmp___1 == 1))) || (((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_read_ev)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (t3_st == 0)) && (q_free == 0)) && (t3_pc == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == T3_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (t1_st == 0)) && (2 == M_E)) && (t3_st == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == E_3)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-22 02:38:30,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...