./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/pc_sfifo_2.cil-2+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 b38de45df8f558469e0ee724acb9ff4d380fa7bca593c33e5a93134ad362699b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:06:13,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:06:13,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:06:13,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:06:13,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:06:13,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:06:13,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:06:13,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:06:13,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:06:13,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:06:13,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:06:13,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:06:13,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:06:13,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:06:13,788 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:06:13,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:06:13,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:06:13,788 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:06:13,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:06:13,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:06:13,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:06:13,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:06:13,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:06:13,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:06:13,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:06:13,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:06:13,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:06:13,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:13,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:13,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:06:13,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:06:13,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:06:13,791 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 -> b38de45df8f558469e0ee724acb9ff4d380fa7bca593c33e5a93134ad362699b [2025-01-09 06:06:14,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:06:14,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:06:14,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:06:14,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:06:14,118 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:06:14,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2025-01-09 06:06:15,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7eb77b7d/73b8fd6ff47e4adf8c11dcf527d8d217/FLAG3c55f73d2 [2025-01-09 06:06:15,775 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:06:15,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2025-01-09 06:06:15,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7eb77b7d/73b8fd6ff47e4adf8c11dcf527d8d217/FLAG3c55f73d2 [2025-01-09 06:06:16,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7eb77b7d/73b8fd6ff47e4adf8c11dcf527d8d217 [2025-01-09 06:06:16,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:06:16,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:06:16,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:16,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:06:16,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:06:16,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61706ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16, skipping insertion in model container [2025-01-09 06:06:16,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:06:16,181 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/pc_sfifo_2.cil-2+token_ring.08.cil-1.c[914,927] [2025-01-09 06:06:16,216 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/pc_sfifo_2.cil-2+token_ring.08.cil-1.c[7125,7138] [2025-01-09 06:06:16,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:16,263 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:06:16,270 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/pc_sfifo_2.cil-2+token_ring.08.cil-1.c[914,927] [2025-01-09 06:06:16,287 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/pc_sfifo_2.cil-2+token_ring.08.cil-1.c[7125,7138] [2025-01-09 06:06:16,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:16,349 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:06:16,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16 WrapperNode [2025-01-09 06:06:16,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:16,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:16,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:06:16,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:06:16,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,401 INFO L138 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 784 [2025-01-09 06:06:16,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:16,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:06:16,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:06:16,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:06:16,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,434 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-01-09 06:06:16,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,446 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:06:16,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:06:16,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:06:16,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:06:16,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (1/1) ... [2025-01-09 06:06:16,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:16,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:16,514 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-01-09 06:06:16,522 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-01-09 06:06:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:06:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:06:16,542 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:06:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:06:16,542 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:06:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:06:16,542 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:06:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:06:16,542 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:06:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:06:16,543 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:06:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:06:16,543 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:06:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:06:16,543 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:06:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:06:16,544 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:06:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:06:16,544 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:06:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:06:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:06:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:06:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:06:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:06:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:06:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:06:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:06:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:06:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:06:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:06:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:06:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:06:16,625 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:06:16,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:06:17,243 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-01-09 06:06:17,243 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:06:17,258 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:06:17,259 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-09 06:06:17,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:17 BoogieIcfgContainer [2025-01-09 06:06:17,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:06:17,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:06:17,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:06:17,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:06:17,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:06:16" (1/3) ... [2025-01-09 06:06:17,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ca4655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:17, skipping insertion in model container [2025-01-09 06:06:17,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:16" (2/3) ... [2025-01-09 06:06:17,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ca4655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:17, skipping insertion in model container [2025-01-09 06:06:17,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:17" (3/3) ... [2025-01-09 06:06:17,266 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.08.cil-1.c [2025-01-09 06:06:17,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:06:17,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-2+token_ring.08.cil-1.c that has 15 procedures, 378 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-01-09 06:06:17,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:06:17,367 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;@13c65a02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:06:17,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:06:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 378 states, 326 states have (on average 1.5766871165644172) internal successors, (514), 331 states have internal predecessors, (514), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 06:06:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 06:06:17,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:17,381 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] [2025-01-09 06:06:17,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:17,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 980825068, now seen corresponding path program 1 times [2025-01-09 06:06:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:17,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903986866] [2025-01-09 06:06:17,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:17,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 06:06:17,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 06:06:17,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:17,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:17,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903986866] [2025-01-09 06:06:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903986866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:17,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:17,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:17,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118000353] [2025-01-09 06:06:17,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:17,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:17,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:17,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:17,814 INFO L87 Difference]: Start difference. First operand has 378 states, 326 states have (on average 1.5766871165644172) internal successors, (514), 331 states have internal predecessors, (514), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:18,921 INFO L93 Difference]: Finished difference Result 832 states and 1290 transitions. [2025-01-09 06:06:18,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:18,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2025-01-09 06:06:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:18,932 INFO L225 Difference]: With dead ends: 832 [2025-01-09 06:06:18,932 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 06:06:18,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:18,938 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 397 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:18,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1198 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 06:06:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 06:06:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 460. [2025-01-09 06:06:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 388 states have (on average 1.5154639175257731) internal successors, (588), 395 states have internal predecessors, (588), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2025-01-09 06:06:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 686 transitions. [2025-01-09 06:06:18,999 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 686 transitions. Word has length 57 [2025-01-09 06:06:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:19,000 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 686 transitions. [2025-01-09 06:06:19,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 686 transitions. [2025-01-09 06:06:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 06:06:19,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:19,002 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] [2025-01-09 06:06:19,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:06:19,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:19,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1638056620, now seen corresponding path program 1 times [2025-01-09 06:06:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273048998] [2025-01-09 06:06:19,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:19,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 06:06:19,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 06:06:19,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:19,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273048998] [2025-01-09 06:06:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273048998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:19,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:19,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408231454] [2025-01-09 06:06:19,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:19,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:19,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:19,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:19,232 INFO L87 Difference]: Start difference. First operand 460 states and 686 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:19,950 INFO L93 Difference]: Finished difference Result 767 states and 1107 transitions. [2025-01-09 06:06:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:19,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2025-01-09 06:06:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:19,955 INFO L225 Difference]: With dead ends: 767 [2025-01-09 06:06:19,955 INFO L226 Difference]: Without dead ends: 597 [2025-01-09 06:06:19,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:19,956 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 815 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:19,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1379 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-01-09 06:06:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 552. [2025-01-09 06:06:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 460 states have (on average 1.4956521739130435) internal successors, (688), 469 states have internal predecessors, (688), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2025-01-09 06:06:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 816 transitions. [2025-01-09 06:06:19,999 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 816 transitions. Word has length 57 [2025-01-09 06:06:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:19,999 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 816 transitions. [2025-01-09 06:06:19,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 816 transitions. [2025-01-09 06:06:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 06:06:20,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:20,001 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] [2025-01-09 06:06:20,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:06:20,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:20,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash 740663342, now seen corresponding path program 1 times [2025-01-09 06:06:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023969740] [2025-01-09 06:06:20,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:20,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 06:06:20,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 06:06:20,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:20,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:20,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023969740] [2025-01-09 06:06:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023969740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:20,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:20,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677818307] [2025-01-09 06:06:20,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:20,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:20,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:20,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:20,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:20,116 INFO L87 Difference]: Start difference. First operand 552 states and 816 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:20,165 INFO L93 Difference]: Finished difference Result 813 states and 1178 transitions. [2025-01-09 06:06:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:20,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2025-01-09 06:06:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:20,170 INFO L225 Difference]: With dead ends: 813 [2025-01-09 06:06:20,171 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 06:06:20,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:20,173 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2770 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:20,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2770 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 06:06:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-09 06:06:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 464 states have (on average 1.4870689655172413) internal successors, (690), 473 states have internal predecessors, (690), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2025-01-09 06:06:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 819 transitions. [2025-01-09 06:06:20,211 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 819 transitions. Word has length 57 [2025-01-09 06:06:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:20,212 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 819 transitions. [2025-01-09 06:06:20,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 819 transitions. [2025-01-09 06:06:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 06:06:20,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:20,214 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] [2025-01-09 06:06:20,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:06:20,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:20,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:20,215 INFO L85 PathProgramCache]: Analyzing trace with hash 763295596, now seen corresponding path program 1 times [2025-01-09 06:06:20,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:20,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291960319] [2025-01-09 06:06:20,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:20,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:20,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 06:06:20,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 06:06:20,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:20,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:20,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:20,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291960319] [2025-01-09 06:06:20,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291960319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:20,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:20,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:20,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907983375] [2025-01-09 06:06:20,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:20,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:20,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:20,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:20,308 INFO L87 Difference]: Start difference. First operand 557 states and 819 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:20,852 INFO L93 Difference]: Finished difference Result 2491 states and 3511 transitions. [2025-01-09 06:06:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:20,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2025-01-09 06:06:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:20,863 INFO L225 Difference]: With dead ends: 2491 [2025-01-09 06:06:20,864 INFO L226 Difference]: Without dead ends: 2230 [2025-01-09 06:06:20,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:06:20,866 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 1577 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:20,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 2346 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2025-01-09 06:06:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2087. [2025-01-09 06:06:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 1655 states have (on average 1.3709969788519638) internal successors, (2269), 1692 states have internal predecessors, (2269), 224 states have call successors, (224), 172 states have call predecessors, (224), 206 states have return successors, (339), 226 states have call predecessors, (339), 221 states have call successors, (339) [2025-01-09 06:06:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2832 transitions. [2025-01-09 06:06:21,135 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2832 transitions. Word has length 57 [2025-01-09 06:06:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:21,136 INFO L471 AbstractCegarLoop]: Abstraction has 2087 states and 2832 transitions. [2025-01-09 06:06:21,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2832 transitions. [2025-01-09 06:06:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 06:06:21,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:21,138 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] [2025-01-09 06:06:21,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:06:21,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:21,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash -909222035, now seen corresponding path program 1 times [2025-01-09 06:06:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476500240] [2025-01-09 06:06:21,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:21,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 06:06:21,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 06:06:21,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:21,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:21,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:21,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476500240] [2025-01-09 06:06:21,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476500240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:21,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:21,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274386371] [2025-01-09 06:06:21,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:21,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:21,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:21,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:21,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:21,264 INFO L87 Difference]: Start difference. First operand 2087 states and 2832 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:21,411 INFO L93 Difference]: Finished difference Result 3923 states and 5312 transitions. [2025-01-09 06:06:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:21,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2025-01-09 06:06:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:21,426 INFO L225 Difference]: With dead ends: 3923 [2025-01-09 06:06:21,427 INFO L226 Difference]: Without dead ends: 2132 [2025-01-09 06:06:21,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:21,433 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2770 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:21,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2770 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2025-01-09 06:06:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2025-01-09 06:06:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 1691 states have (on average 1.354228267297457) internal successors, (2290), 1728 states have internal predecessors, (2290), 224 states have call successors, (224), 172 states have call predecessors, (224), 215 states have return successors, (357), 235 states have call predecessors, (357), 221 states have call successors, (357) [2025-01-09 06:06:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2871 transitions. [2025-01-09 06:06:21,606 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2871 transitions. Word has length 57 [2025-01-09 06:06:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:21,607 INFO L471 AbstractCegarLoop]: Abstraction has 2132 states and 2871 transitions. [2025-01-09 06:06:21,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2871 transitions. [2025-01-09 06:06:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 06:06:21,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:21,609 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] [2025-01-09 06:06:21,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:06:21,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:21,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash -486520209, now seen corresponding path program 1 times [2025-01-09 06:06:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:21,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592830007] [2025-01-09 06:06:21,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:21,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:21,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 06:06:21,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 06:06:21,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:21,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:21,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592830007] [2025-01-09 06:06:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592830007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:21,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:21,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566261111] [2025-01-09 06:06:21,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:21,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:21,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:21,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:21,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:21,791 INFO L87 Difference]: Start difference. First operand 2132 states and 2871 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:22,747 INFO L93 Difference]: Finished difference Result 3826 states and 5054 transitions. [2025-01-09 06:06:22,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:06:22,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2025-01-09 06:06:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:22,760 INFO L225 Difference]: With dead ends: 3826 [2025-01-09 06:06:22,760 INFO L226 Difference]: Without dead ends: 2335 [2025-01-09 06:06:22,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:06:22,766 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 822 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:22,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1184 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:06:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2025-01-09 06:06:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2142. [2025-01-09 06:06:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 1703 states have (on average 1.34762184380505) internal successors, (2295), 1735 states have internal predecessors, (2295), 225 states have call successors, (225), 173 states have call predecessors, (225), 212 states have return successors, (341), 237 states have call predecessors, (341), 222 states have call successors, (341) [2025-01-09 06:06:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2861 transitions. [2025-01-09 06:06:22,920 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2861 transitions. Word has length 57 [2025-01-09 06:06:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:22,921 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 2861 transitions. [2025-01-09 06:06:22,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2861 transitions. [2025-01-09 06:06:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 06:06:22,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:22,923 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] [2025-01-09 06:06:22,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:06:22,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:22,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1507588563, now seen corresponding path program 1 times [2025-01-09 06:06:22,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:22,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84053308] [2025-01-09 06:06:22,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:22,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:22,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 06:06:22,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 06:06:22,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:22,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:06:22,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 06:06:22,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 06:06:22,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 06:06:22,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:22,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:06:22,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 06:06:22,996 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 06:06:22,997 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-01-09 06:06:22,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 06:06:22,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:06:23,001 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:23,130 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 06:06:23,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:06:23 BoogieIcfgContainer [2025-01-09 06:06:23,138 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 06:06:23,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 06:06:23,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 06:06:23,143 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 06:06:23,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:17" (3/4) ... [2025-01-09 06:06:23,145 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 06:06:23,258 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 39. [2025-01-09 06:06:23,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 06:06:23,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 06:06:23,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 06:06:23,347 INFO L158 Benchmark]: Toolchain (without parser) took 7323.74ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 112.2MB in the beginning and 138.1MB in the end (delta: -25.9MB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. [2025-01-09 06:06:23,347 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:06:23,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.02ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 90.0MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 06:06:23,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.17ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 86.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:06:23,348 INFO L158 Benchmark]: Boogie Preprocessor took 75.83ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 82.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 06:06:23,348 INFO L158 Benchmark]: RCFGBuilder took 781.28ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 92.1MB in the end (delta: -9.9MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2025-01-09 06:06:23,349 INFO L158 Benchmark]: TraceAbstraction took 5877.06ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 91.4MB in the beginning and 160.3MB in the end (delta: -68.9MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. [2025-01-09 06:06:23,349 INFO L158 Benchmark]: Witness Printer took 202.85ms. Allocated memory is still 318.8MB. Free memory was 160.3MB in the beginning and 138.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 06:06:23,350 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.24ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.02ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 90.0MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.17ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 86.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.83ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 82.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 781.28ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 92.1MB in the end (delta: -9.9MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5877.06ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 91.4MB in the beginning and 160.3MB in the end (delta: -68.9MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. * Witness Printer took 202.85ms. Allocated memory is still 318.8MB. Free memory was 160.3MB in the beginning and 138.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int t7_pc = 0; [L508] int t8_pc = 0; [L509] int m_st ; [L510] int t1_st ; [L511] int t2_st ; [L512] int t3_st ; [L513] int t4_st ; [L514] int t5_st ; [L515] int t6_st ; [L516] int t7_st ; [L517] int t8_st ; [L518] int m_i ; [L519] int t1_i ; [L520] int t2_i ; [L521] int t3_i ; [L522] int t4_i ; [L523] int t5_i ; [L524] int t6_i ; [L525] int t7_i ; [L526] int t8_i ; [L527] int M_E = 2; [L528] int T1_E = 2; [L529] int T2_E = 2; [L530] int T3_E = 2; [L531] int T4_E = 2; [L532] int T5_E = 2; [L533] int T6_E = 2; [L534] int T7_E = 2; [L535] int T8_E = 2; [L536] int E_M = 2; [L537] int E_1 = 2; [L538] int E_2 = 2; [L539] int E_3 = 2; [L540] int E_4 = 2; [L541] int E_5 = 2; [L542] int E_6 = 2; [L543] int E_7 = 2; [L544] int E_8 = 2; [L555] int token ; [L557] int local ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L1837] COND TRUE __VERIFIER_nondet_int() [L1838] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L85] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L104] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, \result=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_8=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, T8_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, t8_i=0, t8_pc=0, t8_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 378 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3679 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3611 mSDsluCounter, 11647 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8704 mSDsCounter, 474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3443 IncrementalHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 474 mSolverCounterUnsat, 2943 mSDtfsCounter, 3443 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2142occurred in iteration=6, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 6 MinimizatonAttempts, 389 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-09 06:06:23,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE