./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfa23a07aa8a02ca6771de75de8be171cc21a8c2878b440538c1944a91ea1c1d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-07 21:41:02,973 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-07 21:41:03,028 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-07 21:41:03,035 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-07 21:41:03,038 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-07 21:41:03,055 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-07 21:41:03,056 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-07 21:41:03,056 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-07 21:41:03,056 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-07 21:41:03,056 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-07 21:41:03,056 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-07 21:41:03,056 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-07 21:41:03,057 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-07 21:41:03,057 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-07 21:41:03,057 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-07 21:41:03,057 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-07 21:41:03,057 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-07 21:41:03,057 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-07 21:41:03,057 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-07 21:41:03,057 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-07 21:41:03,057 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-07 21:41:03,057 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-07 21:41:03,057 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-07 21:41:03,058 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-07 21:41:03,058 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-07 21:41:03,058 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-07 21:41:03,058 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-07 21:41:03,058 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-07 21:41:03,058 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-07 21:41:03,058 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-07 21:41:03,058 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-07 21:41:03,058 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-07 21:41:03,058 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 21:41:03,059 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-07 21:41:03,059 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfa23a07aa8a02ca6771de75de8be171cc21a8c2878b440538c1944a91ea1c1d
[2025-02-07 21:41:03,330 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-07 21:41:03,336 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-07 21:41:03,337 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-07 21:41:03,338 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-07 21:41:03,339 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-07 21:41:03,339 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c
[2025-02-07 21:41:04,496 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02cc82bee/099cd51cb5204b5b9944f4971c2c9fe2/FLAG4f49d2244
[2025-02-07 21:41:05,121 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-07 21:41:05,122 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c
[2025-02-07 21:41:05,160 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02cc82bee/099cd51cb5204b5b9944f4971c2c9fe2/FLAG4f49d2244
[2025-02-07 21:41:05,584 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02cc82bee/099cd51cb5204b5b9944f4971c2c9fe2
[2025-02-07 21:41:05,586 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-07 21:41:05,588 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-07 21:41:05,593 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-07 21:41:05,593 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-07 21:41:05,596 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-07 21:41:05,599 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:41:05" (1/1) ...
[2025-02-07 21:41:05,601 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6790623d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:05, skipping insertion in model container
[2025-02-07 21:41:05,601 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:41:05" (1/1) ...
[2025-02-07 21:41:05,715 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-07 21:41:06,776 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c[380323,380336]
[2025-02-07 21:41:06,804 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c[383339,383352]
[2025-02-07 21:41:06,996 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 21:41:07,004 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-07 21:41:07,493 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c[380323,380336]
[2025-02-07 21:41:07,496 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c[383339,383352]
[2025-02-07 21:41:07,513 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 21:41:07,559 INFO  L204         MainTranslator]: Completed translation
[2025-02-07 21:41:07,560 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07 WrapperNode
[2025-02-07 21:41:07,561 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-07 21:41:07,562 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-07 21:41:07,562 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-07 21:41:07,563 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-07 21:41:07,567 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:07,631 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:07,919 INFO  L138                Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957
[2025-02-07 21:41:07,920 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-07 21:41:07,920 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-07 21:41:07,921 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-07 21:41:07,921 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-07 21:41:07,927 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:07,928 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:07,973 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:08,142 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].
[2025-02-07 21:41:08,142 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:08,143 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:08,283 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:08,301 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:08,341 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:08,355 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:08,393 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-07 21:41:08,394 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-07 21:41:08,394 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-07 21:41:08,394 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-07 21:41:08,395 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (1/1) ...
[2025-02-07 21:41:08,399 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 21:41:08,407 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 21:41:08,418 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-07 21:41:08,424 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-07 21:41:08,438 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-07 21:41:08,439 INFO  L130     BoogieDeclarations]: Found specification of procedure activate_threads
[2025-02-07 21:41:08,439 INFO  L138     BoogieDeclarations]: Found implementation of procedure activate_threads
[2025-02-07 21:41:08,439 INFO  L130     BoogieDeclarations]: Found specification of procedure immediate_notify
[2025-02-07 21:41:08,439 INFO  L138     BoogieDeclarations]: Found implementation of procedure immediate_notify
[2025-02-07 21:41:08,439 INFO  L130     BoogieDeclarations]: Found specification of procedure update_channels
[2025-02-07 21:41:08,439 INFO  L138     BoogieDeclarations]: Found implementation of procedure update_channels
[2025-02-07 21:41:08,439 INFO  L130     BoogieDeclarations]: Found specification of procedure fire_delta_events
[2025-02-07 21:41:08,439 INFO  L138     BoogieDeclarations]: Found implementation of procedure fire_delta_events
[2025-02-07 21:41:08,439 INFO  L130     BoogieDeclarations]: Found specification of procedure exists_runnable_thread
[2025-02-07 21:41:08,440 INFO  L138     BoogieDeclarations]: Found implementation of procedure exists_runnable_thread
[2025-02-07 21:41:08,440 INFO  L130     BoogieDeclarations]: Found specification of procedure reset_delta_events
[2025-02-07 21:41:08,440 INFO  L138     BoogieDeclarations]: Found implementation of procedure reset_delta_events
[2025-02-07 21:41:08,440 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-07 21:41:08,440 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-07 21:41:08,440 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-07 21:41:08,542 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-07 21:41:08,544 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-07 21:41:15,249 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12391: assume 1 == ~E_7~0;~E_7~0 := 2;
[2025-02-07 21:41:15,250 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12391: assume !(1 == ~E_7~0);
[2025-02-07 21:41:15,250 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11863-1: SUMMARY for call eval_#t~ret28#1 := exists_runnable_thread(); srcloc: null
[2025-02-07 21:41:15,250 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11863: assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1;
[2025-02-07 21:41:15,250 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11865: assume 0 != eval_~tmp~0#1;
[2025-02-07 21:41:15,250 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11865: assume !(0 != eval_~tmp~0#1);
[2025-02-07 21:41:15,250 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11338: ~token~0 := 1 + ~token~0;~E_3~0 := 1;
[2025-02-07 21:41:15,250 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12396: assume 1 == ~E_8~0;~E_8~0 := 2;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12396: assume !(1 == ~E_8~0);
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11340: ~E_3~0 := 2;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11340-1: SUMMARY for call immediate_notify(); srcloc: null
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11870-1: assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;havoc eval_#t~nondet29#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11870-1: assume !(0 == ~m_st~0);
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11870: havoc eval_~tmp_ndt_1~0#1;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11873: assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11873: assume !(0 != eval_~tmp_ndt_1~0#1);
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11876: havoc master_#t~nondet27#1;assume { :end_inline_master } true;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1;calculate_output2_#t~ret15#1 := calculate_output3_#res#1;havoc calculate_output3_#t~ret16#1, calculate_output3_~input#1;havoc calculate_output3_#in~input#1;assume { :end_inline_calculate_output3 } true;assume -2147483648 <= calculate_output2_#t~ret15#1 && calculate_output2_#t~ret15#1 <= 2147483647;calculate_output2_#res#1 := calculate_output2_#t~ret15#1;havoc calculate_output2_#t~ret15#1;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11355: assume 0 == ~t3_pc~0;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11355: assume !(0 == ~t3_pc~0);
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11884: havoc eval_~tmp_ndt_2~0#1;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11884-1: assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;havoc eval_#t~nondet30#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_2~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11884-1: assume !(0 == ~t1_st~0);
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11358: assume 1 == ~t3_pc~0;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11358: assume !(1 == ~t3_pc~0);
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11887: assume 0 != eval_~tmp_ndt_2~0#1;~t1_st~0 := 1;assume { :begin_inline_transmit1 } true;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11887: assume !(0 != eval_~tmp_ndt_2~0#1);
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11890: assume { :end_inline_transmit1 } true;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11366: assume true;~t3_pc~0 := 1;~t3_st~0 := 2;
[2025-02-07 21:41:15,251 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11366: assume !true;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11898: havoc eval_~tmp_ndt_3~0#1;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11898-1: assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;havoc eval_#t~nondet31#1;assume -2147483648 <= eval_#t~nondet31#1 && eval_#t~nondet31#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet31#1;havoc eval_#t~nondet31#1;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11898-1: assume !(0 == ~t2_st~0);
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12428: assume -2147483648 <= stop_simulation_#t~ret47#1 && stop_simulation_#t~ret47#1 <= 2147483647;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret47#1;havoc stop_simulation_#t~ret47#1;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12428-1: SUMMARY for call stop_simulation_#t~ret47#1 := exists_runnable_thread(); srcloc: null
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11901: assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11901: assume !(0 != eval_~tmp_ndt_3~0#1);
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12430: assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12430: assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1;stop_simulation_#res#1 := stop_simulation_~__retres2~0#1;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11374: ~token~0 := 1 + ~token~0;~E_4~0 := 1;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11904: assume { :end_inline_transmit2 } true;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11376: ~E_4~0 := 2;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11376-1: SUMMARY for call immediate_notify(); srcloc: null
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11912: havoc eval_~tmp_ndt_4~0#1;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11912-1: assume 0 == ~t3_st~0;havoc eval_~tmp_ndt_4~0#1;havoc eval_#t~nondet32#1;assume -2147483648 <= eval_#t~nondet32#1 && eval_#t~nondet32#1 <= 2147483647;eval_~tmp_ndt_4~0#1 := eval_#t~nondet32#1;havoc eval_#t~nondet32#1;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11912-1: assume !(0 == ~t3_st~0);
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11915: assume 0 != eval_~tmp_ndt_4~0#1;~t3_st~0 := 1;assume { :begin_inline_transmit3 } true;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11915: assume !(0 != eval_~tmp_ndt_4~0#1);
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11918: assume { :end_inline_transmit3 } true;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11391: assume 0 == ~t4_pc~0;
[2025-02-07 21:41:15,252 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11391: assume !(0 == ~t4_pc~0);
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12449-1: SUMMARY for call update_channels(); srcloc: null
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12449: assume { :begin_inline_init_threads } true;
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12450: assume { :end_inline_init_threads } true;
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11394: assume 1 == ~t4_pc~0;
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11394: assume !(1 == ~t4_pc~0);
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12451: SUMMARY for call fire_delta_events(); srcloc: null
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12452: SUMMARY for call activate_threads(); srcloc: null
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12453: SUMMARY for call reset_delta_events(); srcloc: null
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11926-1: assume 0 == ~t4_st~0;havoc eval_~tmp_ndt_5~0#1;havoc eval_#t~nondet33#1;assume -2147483648 <= eval_#t~nondet33#1 && eval_#t~nondet33#1 <= 2147483647;eval_~tmp_ndt_5~0#1 := eval_#t~nondet33#1;havoc eval_#t~nondet33#1;
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11926-1: assume !(0 == ~t4_st~0);
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11926: havoc eval_~tmp_ndt_5~0#1;
[2025-02-07 21:41:15,253 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12456: assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_4~0#1, eval_#t~nondet33#1, eval_~tmp_ndt_5~0#1, eval_#t~nondet34#1, eval_~tmp_ndt_6~0#1, eval_#t~nondet35#1, eval_~tmp_ndt_7~0#1, eval_#t~nondet36#1, eval_~tmp_ndt_8~0#1, eval_#t~nondet37#1, eval_~tmp_ndt_9~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12456: assume !true;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11929: assume 0 != eval_~tmp_ndt_5~0#1;~t4_st~0 := 1;assume { :begin_inline_transmit4 } true;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11929: assume !(0 != eval_~tmp_ndt_5~0#1);
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11402: assume true;~t4_pc~0 := 1;~t4_st~0 := 2;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11402: assume !true;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12460: havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_4~0#1, eval_#t~nondet33#1, eval_~tmp_ndt_5~0#1, eval_#t~nondet34#1, eval_~tmp_ndt_6~0#1, eval_#t~nondet35#1, eval_~tmp_ndt_7~0#1, eval_#t~nondet36#1, eval_~tmp_ndt_8~0#1, eval_#t~nondet37#1, eval_~tmp_ndt_9~0#1, eval_~tmp~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11932: assume { :end_inline_transmit4 } true;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12464: start_simulation_~kernel_st~0#1 := 3;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12464-1: SUMMARY for call update_channels(); srcloc: null
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11410: ~token~0 := 1 + ~token~0;~E_5~0 := 1;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12468: SUMMARY for call fire_delta_events(); srcloc: null
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11940: havoc eval_~tmp_ndt_6~0#1;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11940-1: assume 0 == ~t5_st~0;havoc eval_~tmp_ndt_6~0#1;havoc eval_#t~nondet34#1;assume -2147483648 <= eval_#t~nondet34#1 && eval_#t~nondet34#1 <= 2147483647;eval_~tmp_ndt_6~0#1 := eval_#t~nondet34#1;havoc eval_#t~nondet34#1;
[2025-02-07 21:41:15,254 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11940-1: assume !(0 == ~t5_st~0);
[2025-02-07 21:41:15,255 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11412: ~E_5~0 := 2;
[2025-02-07 21:41:15,255 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12469: SUMMARY for call activate_threads(); srcloc: null
[2025-02-07 21:41:15,255 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11412-1: SUMMARY for call immediate_notify(); srcloc: null
[2025-02-07 21:41:15,255 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12470: SUMMARY for call reset_delta_events(); srcloc: null
[2025-02-07 21:41:15,255 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11943: assume 0 != eval_~tmp_ndt_6~0#1;~t5_st~0 := 1;assume { :begin_inline_transmit5 } true;
[2025-02-07 21:41:15,258 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11943: assume !(0 != eval_~tmp_ndt_6~0#1);
[2025-02-07 21:41:15,258 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12473-1: SUMMARY for call start_simulation_#t~ret48#1 := exists_runnable_thread(); srcloc: null
[2025-02-07 21:41:15,258 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12473: assume -2147483648 <= start_simulation_#t~ret48#1 && start_simulation_#t~ret48#1 <= 2147483647;start_simulation_~tmp~3#1 := start_simulation_#t~ret48#1;havoc start_simulation_#t~ret48#1;
[2025-02-07 21:41:15,258 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11946: assume { :end_inline_transmit5 } true;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12475: assume 0 == start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 4;assume { :begin_inline_fire_time_events } true;~M_E~0 := 1;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12475: assume !(0 == start_simulation_~tmp~3#1);
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12478: assume { :end_inline_fire_time_events } true;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12479-1: SUMMARY for call activate_threads(); srcloc: null
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12479: assume { :begin_inline_reset_time_events } true;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12480: assume { :end_inline_reset_time_events } true;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11954: havoc eval_~tmp_ndt_7~0#1;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11954-1: assume 0 == ~t6_st~0;havoc eval_~tmp_ndt_7~0#1;havoc eval_#t~nondet35#1;assume -2147483648 <= eval_#t~nondet35#1 && eval_#t~nondet35#1 <= 2147483647;eval_~tmp_ndt_7~0#1 := eval_#t~nondet35#1;havoc eval_#t~nondet35#1;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11954-1: assume !(0 == ~t6_st~0);
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11427: assume 0 == ~t5_pc~0;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11427: assume !(0 == ~t5_pc~0);
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11957: assume 0 != eval_~tmp_ndt_7~0#1;~t6_st~0 := 1;assume { :begin_inline_transmit6 } true;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11957: assume !(0 != eval_~tmp_ndt_7~0#1);
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12486-1: assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret47#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12486: start_simulation_#t~ret49#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret47#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;assume -2147483648 <= start_simulation_#t~ret49#1 && start_simulation_#t~ret49#1 <= 2147483647;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret49#1;havoc start_simulation_#t~ret49#1;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11430: assume 1 == ~t5_pc~0;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11430: assume !(1 == ~t5_pc~0);
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12488: assume 0 != start_simulation_~tmp___0~1#1;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12488: assume !(0 != start_simulation_~tmp___0~1#1);
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11960: assume { :end_inline_transmit6 } true;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1;calculate_output4_#t~ret17#1 := calculate_output5_#res#1;havoc calculate_output5_#t~ret18#1, calculate_output5_~input#1;havoc calculate_output5_#in~input#1;assume { :end_inline_calculate_output5 } true;assume -2147483648 <= calculate_output4_#t~ret17#1 && calculate_output4_#t~ret17#1 <= 2147483647;calculate_output4_#res#1 := calculate_output4_#t~ret17#1;havoc calculate_output4_#t~ret17#1;
[2025-02-07 21:41:15,259 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11173: assume false;assume false;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11173: assume !false;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11438: assume true;~t5_pc~0 := 1;~t5_st~0 := 2;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11438: assume !true;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11968: havoc eval_~tmp_ndt_8~0#1;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11968-1: assume 0 == ~t7_st~0;havoc eval_~tmp_ndt_8~0#1;havoc eval_#t~nondet36#1;assume -2147483648 <= eval_#t~nondet36#1 && eval_#t~nondet36#1 <= 2147483647;eval_~tmp_ndt_8~0#1 := eval_#t~nondet36#1;havoc eval_#t~nondet36#1;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11968-1: assume !(0 == ~t7_st~0);
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11971: assume 0 != eval_~tmp_ndt_8~0#1;~t7_st~0 := 1;assume { :begin_inline_transmit7 } true;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11971: assume !(0 != eval_~tmp_ndt_8~0#1);
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11974: assume { :end_inline_transmit7 } true;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11446: ~token~0 := 1 + ~token~0;~E_6~0 := 1;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11448: ~E_6~0 := 2;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12505: assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret48#1, start_simulation_#t~ret49#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11448-1: SUMMARY for call immediate_notify(); srcloc: null
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12506: havoc start_simulation_#t~ret48#1, start_simulation_#t~ret49#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;assume { :end_inline_start_simulation } true;main2_~__retres1~10#1 := 0;main2_#res#1 := main2_~__retres1~10#1;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11982-1: assume 0 == ~t8_st~0;havoc eval_~tmp_ndt_9~0#1;havoc eval_#t~nondet37#1;assume -2147483648 <= eval_#t~nondet37#1 && eval_#t~nondet37#1 <= 2147483647;eval_~tmp_ndt_9~0#1 := eval_#t~nondet37#1;havoc eval_#t~nondet37#1;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11982-1: assume !(0 == ~t8_st~0);
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11982: havoc eval_~tmp_ndt_9~0#1;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11985: assume 0 != eval_~tmp_ndt_9~0#1;~t8_st~0 := 1;assume { :begin_inline_transmit8 } true;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11985: assume !(0 != eval_~tmp_ndt_9~0#1);
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11988: assume { :end_inline_transmit8 } true;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12517: main_#t~ret52#1 := main2_#res#1;havoc main2_~__retres1~10#1;assume { :end_inline_main2 } true;assume -2147483648 <= main_#t~ret52#1 && main_#t~ret52#1 <= 2147483647;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11463: assume 0 == ~t6_pc~0;
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11463: assume !(0 == ~t6_pc~0);
[2025-02-07 21:41:15,260 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11466: assume 1 == ~t6_pc~0;
[2025-02-07 21:41:15,261 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11466: assume !(1 == ~t6_pc~0);
[2025-02-07 21:41:15,261 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11474: assume true;~t6_pc~0 := 1;~t6_st~0 := 2;
[2025-02-07 21:41:15,261 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11474: assume !true;
[2025-02-07 21:41:15,261 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11482: ~token~0 := 1 + ~token~0;~E_7~0 := 1;
[2025-02-07 21:41:15,261 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11484: ~E_7~0 := 2;
[2025-02-07 21:41:15,261 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11484-1: SUMMARY for call immediate_notify(); srcloc: null
[2025-02-07 21:41:15,261 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11750: assume 1 == ~m_i~0;~m_st~0 := 0;
[2025-02-07 21:41:15,261 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11750: assume !(1 == ~m_i~0);~m_st~0 := 2;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1;calculate_output_#t~ret14#1 := calculate_output2_#res#1;havoc calculate_output2_#t~ret15#1, calculate_output2_~input#1;havoc calculate_output2_#in~input#1;assume { :end_inline_calculate_output2 } true;assume -2147483648 <= calculate_output_#t~ret14#1 && calculate_output_#t~ret14#1 <= 2147483647;calculate_output_#res#1 := calculate_output_#t~ret14#1;havoc calculate_output_#t~ret14#1;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11755: assume 1 == ~t1_i~0;~t1_st~0 := 0;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11755: assume !(1 == ~t1_i~0);~t1_st~0 := 2;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11760: assume 1 == ~t2_i~0;~t2_st~0 := 0;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11760: assume !(1 == ~t2_i~0);~t2_st~0 := 2;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1;calculate_output6_#t~ret19#1 := calculate_output7_#res#1;havoc calculate_output7_#t~ret20#1, calculate_output7_~input#1;havoc calculate_output7_#in~input#1;assume { :end_inline_calculate_output7 } true;assume -2147483648 <= calculate_output6_#t~ret19#1 && calculate_output6_#t~ret19#1 <= 2147483647;calculate_output6_#res#1 := calculate_output6_#t~ret19#1;havoc calculate_output6_#t~ret19#1;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L10440-2: calculate_output7_#t~ret20#1 := calculate_output8_#res#1;havoc calculate_output8_~input#1;havoc calculate_output8_#in~input#1;assume { :end_inline_calculate_output8 } true;assume -2147483648 <= calculate_output7_#t~ret20#1 && calculate_output7_#t~ret20#1 <= 2147483647;calculate_output7_#res#1 := calculate_output7_#t~ret20#1;havoc calculate_output7_#t~ret20#1;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11499: assume 0 == ~t7_pc~0;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11499: assume !(0 == ~t7_pc~0);
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11765: assume 1 == ~t3_i~0;~t3_st~0 := 0;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11765: assume !(1 == ~t3_i~0);~t3_st~0 := 2;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11502: assume 1 == ~t7_pc~0;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11502: assume !(1 == ~t7_pc~0);
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11239: assume 0 == ~m_pc~0;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11239: assume !(0 == ~m_pc~0);
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11770: assume 1 == ~t4_i~0;~t4_st~0 := 0;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11770: assume !(1 == ~t4_i~0);~t4_st~0 := 2;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11242: assume 1 == ~m_pc~0;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11242: assume !(1 == ~m_pc~0);
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11510: assume true;~t7_pc~0 := 1;~t7_st~0 := 2;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11510: assume !true;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11775: assume 1 == ~t5_i~0;~t5_st~0 := 0;
[2025-02-07 21:41:15,262 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11775: assume !(1 == ~t5_i~0);~t5_st~0 := 2;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11250: assume true;havoc master_#t~nondet27#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;~token~0 := master_#t~nondet27#1;havoc master_#t~nondet27#1;~local~0 := ~token~0;~E_1~0 := 1;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11250: assume !true;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11780: assume 1 == ~t6_i~0;~t6_st~0 := 0;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11780: assume !(1 == ~t6_i~0);~t6_st~0 := 2;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11518: ~token~0 := 1 + ~token~0;~E_8~0 := 1;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12311: assume 1 == ~M_E~0;~M_E~0 := 2;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12311: assume !(1 == ~M_E~0);
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11520: ~E_8~0 := 2;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11520-1: SUMMARY for call immediate_notify(); srcloc: null
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11256: ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11256-1: SUMMARY for call immediate_notify(); srcloc: null
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11785: assume 1 == ~t7_i~0;~t7_st~0 := 0;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11785: assume !(1 == ~t7_i~0);~t7_st~0 := 2;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12316: assume 1 == ~T1_E~0;~T1_E~0 := 2;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12316: assume !(1 == ~T1_E~0);
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11790: assume 1 == ~t8_i~0;~t8_st~0 := 0;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11790: assume !(1 == ~t8_i~0);~t8_st~0 := 2;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11264: assume ~token~0 != 8 + ~local~0;assume { :begin_inline_error } true;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11264: assume !(~token~0 != 8 + ~local~0);
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12321: assume 1 == ~T2_E~0;~T2_E~0 := 2;
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12321: assume !(1 == ~T2_E~0);
[2025-02-07 21:41:15,263 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11266: assume { :end_inline_error } true;
[2025-02-07 21:41:15,264 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12326: assume 1 == ~T3_E~0;~T3_E~0 := 2;
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12326: assume !(1 == ~T3_E~0);
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11535: assume 0 == ~t8_pc~0;
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11535: assume !(0 == ~t8_pc~0);
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11538: assume 1 == ~t8_pc~0;
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11538: assume !(1 == ~t8_pc~0);
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12331: assume 1 == ~T4_E~0;~T4_E~0 := 2;
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12331: assume !(1 == ~T4_E~0);
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12336: assume 1 == ~T5_E~0;~T5_E~0 := 2;
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12336: assume !(1 == ~T5_E~0);
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11546: assume true;~t8_pc~0 := 1;~t8_st~0 := 2;
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11546: assume !true;
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11283: assume 0 == ~t1_pc~0;
[2025-02-07 21:41:15,265 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11283: assume !(0 == ~t1_pc~0);
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12341: assume 1 == ~T6_E~0;~T6_E~0 := 2;
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12341: assume !(1 == ~T6_E~0);
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11286: assume 1 == ~t1_pc~0;
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11286: assume !(1 == ~t1_pc~0);
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12346: assume 1 == ~T7_E~0;~T7_E~0 := 2;
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12346: assume !(1 == ~T7_E~0);
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11554: ~token~0 := 1 + ~token~0;~E_M~0 := 1;
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11556: ~E_M~0 := 2;
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11556-1: SUMMARY for call immediate_notify(); srcloc: null
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11294: assume true;~t1_pc~0 := 1;~t1_st~0 := 2;
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11294: assume !true;
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12351: assume 1 == ~T8_E~0;~T8_E~0 := 2;
[2025-02-07 21:41:15,266 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12351: assume !(1 == ~T8_E~0);
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12356: assume 1 == ~E_M~0;~E_M~0 := 2;
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12356: assume !(1 == ~E_M~0);
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1;calculate_output5_#t~ret18#1 := calculate_output6_#res#1;havoc calculate_output6_#t~ret19#1, calculate_output6_~input#1;havoc calculate_output6_#in~input#1;assume { :end_inline_calculate_output6 } true;assume -2147483648 <= calculate_output5_#t~ret18#1 && calculate_output5_#t~ret18#1 <= 2147483647;calculate_output5_#res#1 := calculate_output5_#t~ret18#1;havoc calculate_output5_#t~ret18#1;
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11302: ~token~0 := 1 + ~token~0;~E_2~0 := 1;
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11304: ~E_2~0 := 2;
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12361: assume 1 == ~E_1~0;~E_1~0 := 2;
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12361: assume !(1 == ~E_1~0);
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11304-1: SUMMARY for call immediate_notify(); srcloc: null
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12366: assume 1 == ~E_2~0;~E_2~0 := 2;
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12366: assume !(1 == ~E_2~0);
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12371: assume 1 == ~E_3~0;~E_3~0 := 2;
[2025-02-07 21:41:15,267 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12371: assume !(1 == ~E_3~0);
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12376: assume 1 == ~E_4~0;~E_4~0 := 2;
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12376: assume !(1 == ~E_4~0);
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11319: assume 0 == ~t2_pc~0;
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11319: assume !(0 == ~t2_pc~0);
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1;calculate_output3_#t~ret16#1 := calculate_output4_#res#1;havoc calculate_output4_#t~ret17#1, calculate_output4_~input#1;havoc calculate_output4_#in~input#1;assume { :end_inline_calculate_output4 } true;assume -2147483648 <= calculate_output3_#t~ret16#1 && calculate_output3_#t~ret16#1 <= 2147483647;calculate_output3_#res#1 := calculate_output3_#t~ret16#1;havoc calculate_output3_#t~ret16#1;
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1;main1_#t~ret22#1 := calculate_output_#res#1;havoc calculate_output_#t~ret14#1, calculate_output_~input#1;havoc calculate_output_#in~input#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~output~0#1 := main1_#t~ret22#1;havoc main1_~input~0#1;havoc main1_#t~ret22#1;
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11322: assume 1 == ~t2_pc~0;
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11322: assume !(1 == ~t2_pc~0);
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12381: assume 1 == ~E_5~0;~E_5~0 := 2;
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12381: assume !(1 == ~E_5~0);
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12386: assume 1 == ~E_6~0;~E_6~0 := 2;
[2025-02-07 21:41:15,268 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L12386: assume !(1 == ~E_6~0);
[2025-02-07 21:41:15,269 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11330: assume true;~t2_pc~0 := 1;~t2_st~0 := 2;
[2025-02-07 21:41:15,269 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11330: assume !true;
[2025-02-07 21:41:15,269 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11860: assume true;
[2025-02-07 21:41:15,269 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L11860: assume !true;
[2025-02-07 21:41:15,539 INFO  L?                        ?]: Removed 3322 outVars from TransFormulas that were not future-live.
[2025-02-07 21:41:15,539 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-07 21:41:15,592 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-07 21:41:15,597 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-07 21:41:15,597 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:41:15 BoogieIcfgContainer
[2025-02-07 21:41:15,597 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-07 21:41:15,599 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-07 21:41:15,599 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-07 21:41:15,602 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-07 21:41:15,602 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:41:05" (1/3) ...
[2025-02-07 21:41:15,603 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481bdf76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:41:15, skipping insertion in model container
[2025-02-07 21:41:15,603 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:41:07" (2/3) ...
[2025-02-07 21:41:15,603 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481bdf76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:41:15, skipping insertion in model container
[2025-02-07 21:41:15,604 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:41:15" (3/3) ...
[2025-02-07 21:41:15,605 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.08.cil-1.c
[2025-02-07 21:41:15,617 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-07 21:41:15,620 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.08.cil-1.c that has 7 procedures, 2241 locations, 1 initial locations, 12 loop locations, and 2 error locations.
[2025-02-07 21:41:15,715 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-07 21:41:15,725 INFO  L333      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, 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;@5438fcab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-07 21:41:15,726 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2025-02-07 21:41:15,737 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 2127 states, 2115 states have (on average 1.8988179669030734) internal successors, (4016), 2126 states have internal predecessors, (4016), 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)
[2025-02-07 21:41:15,871 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1676
[2025-02-07 21:41:15,871 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 21:41:15,873 INFO  L218           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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 21:41:15,876 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 21:41:15,883 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 21:41:15,885 INFO  L85        PathProgramCache]: Analyzing trace with hash -1274737344, now seen corresponding path program 1 times
[2025-02-07 21:41:15,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 21:41:15,892 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86146974]
[2025-02-07 21:41:15,893 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 21:41:15,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 21:41:16,151 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1675 statements into 1 equivalence classes.
[2025-02-07 21:41:16,478 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1675 of 1675 statements.
[2025-02-07 21:41:16,479 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 21:41:16,479 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 21:41:17,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 21:41:17,756 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 21:41:17,756 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86146974]
[2025-02-07 21:41:17,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86146974] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 21:41:17,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 21:41:17,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-07 21:41:17,759 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93742516]
[2025-02-07 21:41:17,759 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 21:41:17,763 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-07 21:41:17,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 21:41:17,780 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-07 21:41:17,780 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-07 21:41:17,786 INFO  L87              Difference]: Start difference. First operand  has 2127 states, 2115 states have (on average 1.8988179669030734) internal successors, (4016), 2126 states have internal predecessors, (4016), 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) Second operand  has 2 states, 2 states have (on average 837.5) internal successors, (1675), 2 states have internal predecessors, (1675), 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)
[2025-02-07 21:41:17,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 21:41:17,863 INFO  L93              Difference]: Finished difference Result 2191 states and 4139 transitions.
[2025-02-07 21:41:17,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-07 21:41:17,865 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 837.5) internal successors, (1675), 2 states have internal predecessors, (1675), 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) Word has length 1675
[2025-02-07 21:41:17,874 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 21:41:17,892 INFO  L225             Difference]: With dead ends: 2191
[2025-02-07 21:41:17,892 INFO  L226             Difference]: Without dead ends: 1676
[2025-02-07 21:41:17,901 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-07 21:41:17,907 INFO  L435           NwaCegarLoop]: 3952 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-07 21:41:17,908 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-07 21:41:17,941 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1676 states.
[2025-02-07 21:41:18,019 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1676.
[2025-02-07 21:41:18,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1676 states, 1675 states have (on average 1.0) internal successors, (1675), 1675 states have internal predecessors, (1675), 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)
[2025-02-07 21:41:18,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 1675 transitions.
[2025-02-07 21:41:18,045 INFO  L78                 Accepts]: Start accepts. Automaton has 1676 states and 1675 transitions. Word has length 1675
[2025-02-07 21:41:18,047 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 21:41:18,050 INFO  L471      AbstractCegarLoop]: Abstraction has 1676 states and 1675 transitions.
[2025-02-07 21:41:18,052 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 837.5) internal successors, (1675), 2 states have internal predecessors, (1675), 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)
[2025-02-07 21:41:18,052 INFO  L276                IsEmpty]: Start isEmpty. Operand 1676 states and 1675 transitions.
[2025-02-07 21:41:18,240 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1676
[2025-02-07 21:41:18,241 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 21:41:18,242 INFO  L218           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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 21:41:18,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-07 21:41:18,243 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 21:41:18,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 21:41:18,245 INFO  L85        PathProgramCache]: Analyzing trace with hash -373482468, now seen corresponding path program 1 times
[2025-02-07 21:41:18,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 21:41:18,245 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523653284]
[2025-02-07 21:41:18,246 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 21:41:18,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 21:41:18,459 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1675 statements into 1 equivalence classes.
[2025-02-07 21:41:18,594 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1675 of 1675 statements.
[2025-02-07 21:41:18,596 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 21:41:18,597 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 21:41:22,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 21:41:22,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 21:41:22,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523653284]
[2025-02-07 21:41:22,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523653284] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 21:41:22,300 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 21:41:22,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-07 21:41:22,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665855779]
[2025-02-07 21:41:22,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 21:41:22,304 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 21:41:22,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 21:41:22,306 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 21:41:22,306 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 21:41:22,307 INFO  L87              Difference]: Start difference. First operand 1676 states and 1675 transitions. Second operand  has 4 states, 4 states have (on average 418.75) internal successors, (1675), 3 states have internal predecessors, (1675), 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)
[2025-02-07 21:41:23,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 21:41:23,872 INFO  L93              Difference]: Finished difference Result 1676 states and 1675 transitions.
[2025-02-07 21:41:23,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-07 21:41:23,873 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 418.75) internal successors, (1675), 3 states have internal predecessors, (1675), 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) Word has length 1675
[2025-02-07 21:41:23,876 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 21:41:23,876 INFO  L225             Difference]: With dead ends: 1676
[2025-02-07 21:41:23,876 INFO  L226             Difference]: Without dead ends: 0
[2025-02-07 21:41:23,879 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 21:41:23,881 INFO  L435           NwaCegarLoop]: 4 mSDtfsCounter, 1672 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-07 21:41:23,882 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 4 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-07 21:41:23,882 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-07 21:41:23,882 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-07 21:41:23,883 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)
[2025-02-07 21:41:23,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-07 21:41:23,883 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1675
[2025-02-07 21:41:23,883 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 21:41:23,883 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-07 21:41:23,884 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 418.75) internal successors, (1675), 3 states have internal predecessors, (1675), 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)
[2025-02-07 21:41:23,885 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-07 21:41:23,885 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-07 21:41:23,887 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining)
[2025-02-07 21:41:23,888 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining)
[2025-02-07 21:41:23,889 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-07 21:41:23,891 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1]
[2025-02-07 21:41:23,892 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-07 21:41:23,915 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-07 21:41:23,935 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:41:23 BoogieIcfgContainer
[2025-02-07 21:41:23,935 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-07 21:41:23,936 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-07 21:41:23,936 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-07 21:41:23,936 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-07 21:41:23,937 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:41:15" (3/4) ...
[2025-02-07 21:41:23,939 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-07 21:41:23,944 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure activate_threads
[2025-02-07 21:41:23,944 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure immediate_notify
[2025-02-07 21:41:23,944 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread
[2025-02-07 21:41:23,944 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure update_channels
[2025-02-07 21:41:23,944 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure fire_delta_events
[2025-02-07 21:41:23,944 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure reset_delta_events
[2025-02-07 21:41:24,027 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges
[2025-02-07 21:41:24,042 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-07 21:41:24,048 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-07 21:41:24,052 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-07 21:41:24,402 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-07 21:41:24,403 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-07 21:41:24,403 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-07 21:41:24,404 INFO  L158              Benchmark]: Toolchain (without parser) took 18815.64ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 69.4MB in the beginning and 671.9MB in the end (delta: -602.5MB). Peak memory consumption was 575.5MB. Max. memory is 16.1GB.
[2025-02-07 21:41:24,404 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-07 21:41:24,404 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 1968.83ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 69.4MB in the beginning and 211.8MB in the end (delta: -142.4MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB.
[2025-02-07 21:41:24,404 INFO  L158              Benchmark]: Boogie Procedure Inliner took 357.66ms. Allocated memory is still 385.9MB. Free memory was 211.8MB in the beginning and 133.9MB in the end (delta: 77.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB.
[2025-02-07 21:41:24,405 INFO  L158              Benchmark]: Boogie Preprocessor took 472.63ms. Allocated memory is still 385.9MB. Free memory was 133.9MB in the beginning and 206.4MB in the end (delta: -72.4MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB.
[2025-02-07 21:41:24,405 INFO  L158              Benchmark]: IcfgBuilder took 7202.98ms. Allocated memory was 385.9MB in the beginning and 788.5MB in the end (delta: 402.7MB). Free memory was 206.4MB in the beginning and 182.1MB in the end (delta: 24.2MB). Peak memory consumption was 484.5MB. Max. memory is 16.1GB.
[2025-02-07 21:41:24,405 INFO  L158              Benchmark]: TraceAbstraction took 8336.68ms. Allocated memory was 788.5MB in the beginning and 1.3GB in the end (delta: 528.5MB). Free memory was 182.1MB in the beginning and 810.3MB in the end (delta: -628.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-07 21:41:24,405 INFO  L158              Benchmark]: Witness Printer took 466.80ms. Allocated memory is still 1.3GB. Free memory was 810.3MB in the beginning and 671.9MB in the end (delta: 138.4MB). Peak memory consumption was 142.6MB. Max. memory is 16.1GB.
[2025-02-07 21:41:24,406 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.19ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 1968.83ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 69.4MB in the beginning and 211.8MB in the end (delta: -142.4MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 357.66ms. Allocated memory is still 385.9MB. Free memory was 211.8MB in the beginning and 133.9MB in the end (delta: 77.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 472.63ms. Allocated memory is still 385.9MB. Free memory was 133.9MB in the beginning and 206.4MB in the end (delta: -72.4MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB.
 * IcfgBuilder took 7202.98ms. Allocated memory was 385.9MB in the beginning and 788.5MB in the end (delta: 402.7MB). Free memory was 206.4MB in the beginning and 182.1MB in the end (delta: 24.2MB). Peak memory consumption was 484.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8336.68ms. Allocated memory was 788.5MB in the beginning and 1.3GB in the end (delta: 528.5MB). Free memory was 182.1MB in the beginning and 810.3MB in the end (delta: -628.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 466.80ms. Allocated memory is still 1.3GB. Free memory was 810.3MB in the beginning and 671.9MB in the end (delta: 138.4MB). Peak memory consumption was 142.6MB. Max. memory is 16.1GB.
 * 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: 11088]: 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: 11173]: 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 7 procedures, 2241 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1672 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1672 mSDsluCounter, 3956 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1669 IncrementalHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3956 mSDtfsCounter, 1669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2127occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 3350 NumberOfCodeBlocks, 3350 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3348 ConstructedInterpolants, 0 QuantifiedInterpolants, 38175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    2 specifications checked. All of them hold
  - InvariantResult [Line: 11150]: Location Invariant
    Derived location invariant: ((((((((a15 == 1) && (5 == a20)) && (a25 == 1)) && (a9 != 17)) && (a16 == 1)) && (a12 == 4)) && (a27 == 1)) && (a2 == 10))
RESULT: Ultimate proved your program to be correct!
[2025-02-07 21:41:24,435 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE