./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:23:02,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:23:02,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:23:02,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:23:02,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:23:02,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:23:02,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:23:02,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:23:02,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:23:02,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:23:02,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:23:02,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:23:02,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:23:02,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:23:02,908 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:23:02,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:23:02,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:23:02,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:23:02,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:23:02,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:23:02,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:02,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:23:02,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:23:02,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:23:02,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:23:02,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:23:02,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:23:02,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:23:02,910 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/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 -> e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 [2025-03-03 16:23:03,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:23:03,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:23:03,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:23:03,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:23:03,174 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:23:03,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2025-03-03 16:23:04,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8939868f9/324c864a03d341cba24ea33b04f6f86d/FLAGc589f632a [2025-03-03 16:23:04,692 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:23:04,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2025-03-03 16:23:04,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8939868f9/324c864a03d341cba24ea33b04f6f86d/FLAGc589f632a [2025-03-03 16:23:04,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8939868f9/324c864a03d341cba24ea33b04f6f86d [2025-03-03 16:23:04,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:23:04,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:23:04,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:04,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:23:04,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:23:04,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:04" (1/1) ... [2025-03-03 16:23:04,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d683ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:04, skipping insertion in model container [2025-03-03 16:23:04,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:04" (1/1) ... [2025-03-03 16:23:04,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:23:04,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[914,927] [2025-03-03 16:23:04,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[7125,7138] [2025-03-03 16:23:05,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:05,026 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:23:05,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[914,927] [2025-03-03 16:23:05,050 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c[7125,7138] [2025-03-03 16:23:05,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:05,085 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:23:05,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05 WrapperNode [2025-03-03 16:23:05,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:05,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:05,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:23:05,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:23:05,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,145 INFO L138 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 670 [2025-03-03 16:23:05,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:05,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:23:05,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:23:05,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:23:05,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,177 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-03-03 16:23:05,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:23:05,205 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:23:05,205 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:23:05,205 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:23:05,206 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (1/1) ... [2025-03-03 16:23:05,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:05,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:05,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:23:05,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:23:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:23:05,257 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:23:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:23:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:23:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:23:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:23:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:23:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:23:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:23:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:23:05,258 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:23:05,258 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:23:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:23:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:23:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:23:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:23:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:23:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:23:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:23:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:23:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:23:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:23:05,259 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:23:05,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:23:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:23:05,260 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:23:05,260 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:23:05,261 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:23:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:23:05,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:23:05,261 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:23:05,261 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:23:05,349 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:23:05,351 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:23:05,914 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-03 16:23:05,914 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:23:05,931 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:23:05,931 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:23:05,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:05 BoogieIcfgContainer [2025-03-03 16:23:05,932 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:23:05,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:23:05,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:23:05,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:23:05,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:23:04" (1/3) ... [2025-03-03 16:23:05,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187dc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:05, skipping insertion in model container [2025-03-03 16:23:05,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:05" (2/3) ... [2025-03-03 16:23:05,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187dc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:05, skipping insertion in model container [2025-03-03 16:23:05,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:05" (3/3) ... [2025-03-03 16:23:05,938 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2025-03-03 16:23:05,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:23:05,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-2+token_ring.06.cil-2.c that has 15 procedures, 350 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-03 16:23:05,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:23:06,002 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;@26cbe4ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:23:06,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:23:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 298 states have (on average 1.5302013422818792) internal successors, (456), 305 states have internal predecessors, (456), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 16:23:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:06,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:06,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:06,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:06,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2039063817, now seen corresponding path program 1 times [2025-03-03 16:23:06,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:06,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143764382] [2025-03-03 16:23:06,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:06,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:06,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:06,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:06,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:06,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:06,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143764382] [2025-03-03 16:23:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143764382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:06,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:06,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792745305] [2025-03-03 16:23:06,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:06,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:06,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:06,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:06,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:06,398 INFO L87 Difference]: Start difference. First operand has 350 states, 298 states have (on average 1.5302013422818792) internal successors, (456), 305 states have internal predecessors, (456), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03-03 16:23:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:07,027 INFO L93 Difference]: Finished difference Result 784 states and 1176 transitions. [2025-03-03 16:23:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:07,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2025-03-03 16:23:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:07,043 INFO L225 Difference]: With dead ends: 784 [2025-03-03 16:23:07,046 INFO L226 Difference]: Without dead ends: 446 [2025-03-03 16:23:07,050 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-03-03 16:23:07,053 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 363 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:07,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1128 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-03 16:23:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 438. [2025-03-03 16:23:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 368 states have (on average 1.4619565217391304) internal successors, (538), 375 states have internal predecessors, (538), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2025-03-03 16:23:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 632 transitions. [2025-03-03 16:23:07,131 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 632 transitions. Word has length 59 [2025-03-03 16:23:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:07,131 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 632 transitions. [2025-03-03 16:23:07,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03-03 16:23:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 632 transitions. [2025-03-03 16:23:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:07,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:07,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:07,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:23:07,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:07,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1201356788, now seen corresponding path program 1 times [2025-03-03 16:23:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:07,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463453344] [2025-03-03 16:23:07,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:07,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:07,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:07,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:07,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463453344] [2025-03-03 16:23:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463453344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:07,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:07,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:07,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791418628] [2025-03-03 16:23:07,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:07,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:07,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:07,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:07,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:07,320 INFO L87 Difference]: Start difference. First operand 438 states and 632 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-03-03 16:23:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:07,948 INFO L93 Difference]: Finished difference Result 763 states and 1071 transitions. [2025-03-03 16:23:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2025-03-03 16:23:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:07,952 INFO L225 Difference]: With dead ends: 763 [2025-03-03 16:23:07,952 INFO L226 Difference]: Without dead ends: 581 [2025-03-03 16:23:07,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:07,953 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 734 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:07,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1343 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-03 16:23:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 536. [2025-03-03 16:23:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 446 states have (on average 1.4439461883408071) internal successors, (644), 455 states have internal predecessors, (644), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2025-03-03 16:23:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 768 transitions. [2025-03-03 16:23:07,994 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 768 transitions. Word has length 59 [2025-03-03 16:23:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:07,994 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 768 transitions. [2025-03-03 16:23:07,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-03-03 16:23:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 768 transitions. [2025-03-03 16:23:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:07,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:07,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:23:07,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash -499383691, now seen corresponding path program 1 times [2025-03-03 16:23:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911675002] [2025-03-03 16:23:07,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:08,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:08,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:08,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:08,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:08,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:08,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911675002] [2025-03-03 16:23:08,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911675002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:08,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:08,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:08,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593470276] [2025-03-03 16:23:08,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:08,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:08,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:08,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:08,103 INFO L87 Difference]: Start difference. First operand 536 states and 768 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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-03-03 16:23:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:08,147 INFO L93 Difference]: Finished difference Result 815 states and 1148 transitions. [2025-03-03 16:23:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2025-03-03 16:23:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:08,150 INFO L225 Difference]: With dead ends: 815 [2025-03-03 16:23:08,150 INFO L226 Difference]: Without dead ends: 541 [2025-03-03 16:23:08,152 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-03-03 16:23:08,153 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 0 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2470 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-03-03 16:23:08,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2470 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-03 16:23:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-03 16:23:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 450 states have (on average 1.4355555555555555) internal successors, (646), 459 states have internal predecessors, (646), 57 states have call successors, (57), 28 states have call predecessors, (57), 32 states have return successors, (68), 57 states have call predecessors, (68), 54 states have call successors, (68) [2025-03-03 16:23:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 771 transitions. [2025-03-03 16:23:08,189 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 771 transitions. Word has length 59 [2025-03-03 16:23:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:08,189 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 771 transitions. [2025-03-03 16:23:08,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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-03-03 16:23:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 771 transitions. [2025-03-03 16:23:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:08,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:08,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:08,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:23:08,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:08,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1785479764, now seen corresponding path program 1 times [2025-03-03 16:23:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:08,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156637782] [2025-03-03 16:23:08,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:08,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:08,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:08,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:08,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:08,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:08,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156637782] [2025-03-03 16:23:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156637782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:08,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:08,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:23:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976512204] [2025-03-03 16:23:08,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:08,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:23:08,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:08,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:23:08,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:23:08,297 INFO L87 Difference]: Start difference. First operand 541 states and 771 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:09,227 INFO L93 Difference]: Finished difference Result 1823 states and 2503 transitions. [2025-03-03 16:23:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:23:09,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2025-03-03 16:23:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:09,234 INFO L225 Difference]: With dead ends: 1823 [2025-03-03 16:23:09,234 INFO L226 Difference]: Without dead ends: 1526 [2025-03-03 16:23:09,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:23:09,237 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 2279 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:09,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2293 Valid, 1520 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:23:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-03-03 16:23:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1459. [2025-03-03 16:23:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1182 states have (on average 1.3553299492385786) internal successors, (1602), 1206 states have internal predecessors, (1602), 145 states have call successors, (145), 111 states have call predecessors, (145), 130 states have return successors, (182), 144 states have call predecessors, (182), 142 states have call successors, (182) [2025-03-03 16:23:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1929 transitions. [2025-03-03 16:23:09,312 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1929 transitions. Word has length 59 [2025-03-03 16:23:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:09,313 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 1929 transitions. [2025-03-03 16:23:09,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1929 transitions. [2025-03-03 16:23:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:09,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:09,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:09,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:23:09,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:09,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:09,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1306912745, now seen corresponding path program 1 times [2025-03-03 16:23:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:09,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092819969] [2025-03-03 16:23:09,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:09,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:09,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:09,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:09,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:09,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:09,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092819969] [2025-03-03 16:23:09,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092819969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:09,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:09,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678619630] [2025-03-03 16:23:09,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:09,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:09,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:09,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:09,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:09,394 INFO L87 Difference]: Start difference. First operand 1459 states and 1929 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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-03-03 16:23:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:09,468 INFO L93 Difference]: Finished difference Result 2698 states and 3531 transitions. [2025-03-03 16:23:09,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:09,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2025-03-03 16:23:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:09,475 INFO L225 Difference]: With dead ends: 2698 [2025-03-03 16:23:09,475 INFO L226 Difference]: Without dead ends: 1489 [2025-03-03 16:23:09,477 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-03-03 16:23:09,477 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 0 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2470 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-03-03 16:23:09,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2470 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-03-03 16:23:09,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1489. [2025-03-03 16:23:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1206 states have (on average 1.341625207296849) internal successors, (1618), 1230 states have internal predecessors, (1618), 145 states have call successors, (145), 111 states have call predecessors, (145), 136 states have return successors, (188), 150 states have call predecessors, (188), 142 states have call successors, (188) [2025-03-03 16:23:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1951 transitions. [2025-03-03 16:23:09,560 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1951 transitions. Word has length 59 [2025-03-03 16:23:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:09,560 INFO L471 AbstractCegarLoop]: Abstraction has 1489 states and 1951 transitions. [2025-03-03 16:23:09,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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-03-03 16:23:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1951 transitions. [2025-03-03 16:23:09,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:09,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:09,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:09,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:23:09,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:09,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash -62148264, now seen corresponding path program 1 times [2025-03-03 16:23:09,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:09,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024530580] [2025-03-03 16:23:09,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:09,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:09,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:09,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:09,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:09,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:09,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:09,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024530580] [2025-03-03 16:23:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024530580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:09,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499002874] [2025-03-03 16:23:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:09,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:09,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:09,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:09,691 INFO L87 Difference]: Start difference. First operand 1489 states and 1951 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-03-03 16:23:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:10,279 INFO L93 Difference]: Finished difference Result 2723 states and 3469 transitions. [2025-03-03 16:23:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:23:10,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2025-03-03 16:23:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:10,288 INFO L225 Difference]: With dead ends: 2723 [2025-03-03 16:23:10,288 INFO L226 Difference]: Without dead ends: 1712 [2025-03-03 16:23:10,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:23:10,290 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 719 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:10,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1124 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2025-03-03 16:23:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1430. [2025-03-03 16:23:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1163 states have (on average 1.3379191745485812) internal successors, (1556), 1182 states have internal predecessors, (1556), 139 states have call successors, (139), 106 states have call predecessors, (139), 126 states have return successors, (173), 143 states have call predecessors, (173), 136 states have call successors, (173) [2025-03-03 16:23:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1868 transitions. [2025-03-03 16:23:10,378 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1868 transitions. Word has length 59 [2025-03-03 16:23:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:10,378 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 1868 transitions. [2025-03-03 16:23:10,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-03-03 16:23:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1868 transitions. [2025-03-03 16:23:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:23:10,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:10,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:10,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:23:10,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:10,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1059220617, now seen corresponding path program 1 times [2025-03-03 16:23:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:10,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452622116] [2025-03-03 16:23:10,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:10,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:10,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:10,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:10,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:23:10,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 16:23:10,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:23:10,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:23:10,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:10,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:23:10,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 16:23:10,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 16:23:10,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-03 16:23:10,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-03 16:23:10,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:23:10,447 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:10,545 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 16:23:10,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:23:10 BoogieIcfgContainer [2025-03-03 16:23:10,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 16:23:10,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 16:23:10,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 16:23:10,548 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 16:23:10,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:05" (3/4) ... [2025-03-03 16:23:10,549 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 16:23:10,647 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 41. [2025-03-03 16:23:10,697 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 16:23:10,697 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 16:23:10,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 16:23:10,698 INFO L158 Benchmark]: Toolchain (without parser) took 5968.18ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 112.6MB in the beginning and 88.1MB in the end (delta: 24.5MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. [2025-03-03 16:23:10,698 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:23:10,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.78ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 92.1MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 16:23:10,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.36ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 16:23:10,699 INFO L158 Benchmark]: Boogie Preprocessor took 58.61ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:23:10,699 INFO L158 Benchmark]: IcfgBuilder took 726.84ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 105.6MB in the end (delta: -19.9MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2025-03-03 16:23:10,699 INFO L158 Benchmark]: TraceAbstraction took 4613.85ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 105.6MB in the beginning and 108.0MB in the end (delta: -2.3MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2025-03-03 16:23:10,699 INFO L158 Benchmark]: Witness Printer took 149.36ms. Allocated memory is still 243.3MB. Free memory was 108.0MB in the beginning and 88.1MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 16:23:10,700 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.78ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 92.1MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.36ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.61ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 726.84ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 105.6MB in the end (delta: -19.9MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4613.85ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 105.6MB in the beginning and 108.0MB in the end (delta: -2.3MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. * Witness Printer took 149.36ms. Allocated memory is still 243.3MB. Free memory was 108.0MB in the beginning and 88.1MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. 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 m_st ; [L508] int t1_st ; [L509] int t2_st ; [L510] int t3_st ; [L511] int t4_st ; [L512] int t5_st ; [L513] int t6_st ; [L514] int m_i ; [L515] int t1_i ; [L516] int t2_i ; [L517] int t3_i ; [L518] int t4_i ; [L519] int t5_i ; [L520] int t6_i ; [L521] int M_E = 2; [L522] int T1_E = 2; [L523] int T2_E = 2; [L524] int T3_E = 2; [L525] int T4_E = 2; [L526] int T5_E = 2; [L527] int T6_E = 2; [L528] int E_M = 2; [L529] int E_1 = 2; [L530] int E_2 = 2; [L531] int E_3 = 2; [L532] int E_4 = 2; [L533] int E_5 = 2; [L534] int E_6 = 2; [L543] int token ; [L545] int local ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=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, 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, token=0] [L1587] COND TRUE __VERIFIER_nondet_int() [L1588] 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, token=0] [L427] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=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, 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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=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, 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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_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, 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, 350 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4167 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4095 mSDsluCounter, 10055 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7738 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3799 IncrementalHoareTripleChecker+Invalid, 4406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 2317 mSDtfsCounter, 3799 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1489occurred in iteration=5, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 402 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 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-03-03 16:23:10,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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