./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.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/Problem05_label42+token_ring.01.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 cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:37:37,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:37:37,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:37:37,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:37:37,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:37:37,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:37:37,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:37:37,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:37:37,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:37:37,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:37:37,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:37:37,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:37:37,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:37:37,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:37:37,169 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:37:37,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:37:37,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:37:37,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:37:37,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:37:37,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:37:37,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:37:37,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:37:37,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:37:37,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:37:37,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:37:37,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:37:37,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:37:37,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:37:37,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:37:37,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:37:37,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:37:37,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:37:37,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:37:37,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:37:37,172 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 -> cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 [2025-03-03 15:37:37,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:37:37,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:37:37,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:37:37,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:37:37,417 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:37:37,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2025-03-03 15:37:38,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad8bed17/30f2b9235a344931a062fa2256ab681f/FLAG77d3e3144 [2025-03-03 15:37:39,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:37:39,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2025-03-03 15:37:39,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad8bed17/30f2b9235a344931a062fa2256ab681f/FLAG77d3e3144 [2025-03-03 15:37:39,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad8bed17/30f2b9235a344931a062fa2256ab681f [2025-03-03 15:37:39,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:37:39,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:37:39,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:37:39,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:37:39,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:37:39,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:37:39" (1/1) ... [2025-03-03 15:37:39,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fa5c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:39, skipping insertion in model container [2025-03-03 15:37:39,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:37:39" (1/1) ... [2025-03-03 15:37:39,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:37:40,465 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/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2025-03-03 15:37:40,495 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/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2025-03-03 15:37:40,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:37:40,603 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:37:41,118 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/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2025-03-03 15:37:41,129 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/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2025-03-03 15:37:41,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:37:41,189 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:37:41,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41 WrapperNode [2025-03-03 15:37:41,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:37:41,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:37:41,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:37:41,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:37:41,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,553 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12564 [2025-03-03 15:37:41,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:37:41,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:37:41,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:37:41,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:37:41,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,730 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 15:37:41,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:37:41,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:37:41,922 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:37:41,922 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:37:41,923 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (1/1) ... [2025-03-03 15:37:41,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:37:41,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:41,949 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 15:37:41,951 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 15:37:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:37:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 15:37:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 15:37:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:37:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:37:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:37:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:37:41,971 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:37:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:37:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:37:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:37:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:37:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:37:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:37:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:37:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:37:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:37:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:37:42,055 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:37:42,057 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:37:47,988 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:37:47,989 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:37:47,989 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:37:47,989 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:37:47,990 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:37:47,990 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:37:47,990 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:37:48,175 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2025-03-03 15:37:48,176 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:37:48,226 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:37:48,226 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:37:48,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:37:48 BoogieIcfgContainer [2025-03-03 15:37:48,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:37:48,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:37:48,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:37:48,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:37:48,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:37:39" (1/3) ... [2025-03-03 15:37:48,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a4c4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:37:48, skipping insertion in model container [2025-03-03 15:37:48,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:41" (2/3) ... [2025-03-03 15:37:48,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a4c4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:37:48, skipping insertion in model container [2025-03-03 15:37:48,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:37:48" (3/3) ... [2025-03-03 15:37:48,239 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.01.cil-2.c [2025-03-03 15:37:48,251 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:37:48,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.01.cil-2.c that has 8 procedures, 2302 locations, 1 initial locations, 5 loop locations, and 2 error locations. [2025-03-03 15:37:48,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:37:48,417 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;@3be79a10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:37:48,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:37:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 2302 states, 2275 states have (on average 1.8553846153846154) internal successors, (4221), 2280 states have internal predecessors, (4221), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 15:37:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:37:48,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:48,437 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] [2025-03-03 15:37:48,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:48,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2135216030, now seen corresponding path program 1 times [2025-03-03 15:37:48,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:48,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862762788] [2025-03-03 15:37:48,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:48,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:37:48,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:37:48,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:48,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:48,749 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 15:37:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:48,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862762788] [2025-03-03 15:37:48,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862762788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:48,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:48,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:37:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777429634] [2025-03-03 15:37:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:48,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:37:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:48,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:37:48,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:37:48,775 INFO L87 Difference]: Start difference. First operand has 2302 states, 2275 states have (on average 1.8553846153846154) internal successors, (4221), 2280 states have internal predecessors, (4221), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:49,150 INFO L93 Difference]: Finished difference Result 4705 states and 8663 transitions. [2025-03-03 15:37:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:37:49,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-03 15:37:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:49,176 INFO L225 Difference]: With dead ends: 4705 [2025-03-03 15:37:49,176 INFO L226 Difference]: Without dead ends: 2342 [2025-03-03 15:37:49,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:37:49,190 INFO L435 NwaCegarLoop]: 4160 mSDtfsCounter, 4259 mSDsluCounter, 8372 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4268 SdHoareTripleChecker+Valid, 12532 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:49,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4268 Valid, 12532 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:37:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-03-03 15:37:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2333. [2025-03-03 15:37:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 2291 states have (on average 1.8354430379746836) internal successors, (4205), 2295 states have internal predecessors, (4205), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-03 15:37:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 4258 transitions. [2025-03-03 15:37:49,311 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 4258 transitions. Word has length 58 [2025-03-03 15:37:49,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:49,312 INFO L471 AbstractCegarLoop]: Abstraction has 2333 states and 4258 transitions. [2025-03-03 15:37:49,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 4258 transitions. [2025-03-03 15:37:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:37:49,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:49,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] [2025-03-03 15:37:49,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:37:49,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:49,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash 884861980, now seen corresponding path program 1 times [2025-03-03 15:37:49,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:49,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17183270] [2025-03-03 15:37:49,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:49,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:37:49,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:37:49,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:49,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:49,463 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 15:37:49,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:49,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17183270] [2025-03-03 15:37:49,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17183270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:49,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:49,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:37:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753059636] [2025-03-03 15:37:49,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:49,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:37:49,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:49,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:37:49,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:37:49,467 INFO L87 Difference]: Start difference. First operand 2333 states and 4258 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:49,639 INFO L93 Difference]: Finished difference Result 2548 states and 4567 transitions. [2025-03-03 15:37:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:37:49,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-03 15:37:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:49,650 INFO L225 Difference]: With dead ends: 2548 [2025-03-03 15:37:49,650 INFO L226 Difference]: Without dead ends: 2345 [2025-03-03 15:37:49,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:37:49,652 INFO L435 NwaCegarLoop]: 4072 mSDtfsCounter, 4139 mSDsluCounter, 8095 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4148 SdHoareTripleChecker+Valid, 12167 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:49,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4148 Valid, 12167 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:37:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2025-03-03 15:37:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2333. [2025-03-03 15:37:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 2291 states have (on average 1.83457005674378) internal successors, (4203), 2295 states have internal predecessors, (4203), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-03 15:37:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 4256 transitions. [2025-03-03 15:37:49,712 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 4256 transitions. Word has length 58 [2025-03-03 15:37:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:49,713 INFO L471 AbstractCegarLoop]: Abstraction has 2333 states and 4256 transitions. [2025-03-03 15:37:49,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 4256 transitions. [2025-03-03 15:37:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:37:49,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:49,715 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] [2025-03-03 15:37:49,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:37:49,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:49,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash -815878499, now seen corresponding path program 1 times [2025-03-03 15:37:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:49,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385886793] [2025-03-03 15:37:49,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:49,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:37:49,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:37:49,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:49,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:49,830 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 15:37:49,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:49,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385886793] [2025-03-03 15:37:49,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385886793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:49,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:49,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:37:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528845268] [2025-03-03 15:37:49,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:49,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:37:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:49,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:37:49,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:49,831 INFO L87 Difference]: Start difference. First operand 2333 states and 4256 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:50,162 INFO L93 Difference]: Finished difference Result 2662 states and 4716 transitions. [2025-03-03 15:37:50,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:37:50,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-03 15:37:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:50,174 INFO L225 Difference]: With dead ends: 2662 [2025-03-03 15:37:50,174 INFO L226 Difference]: Without dead ends: 2459 [2025-03-03 15:37:50,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:37:50,177 INFO L435 NwaCegarLoop]: 4155 mSDtfsCounter, 4215 mSDsluCounter, 12421 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4226 SdHoareTripleChecker+Valid, 16576 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:50,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4226 Valid, 16576 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:37:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2025-03-03 15:37:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2423. [2025-03-03 15:37:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2365 states have (on average 1.8211416490486259) internal successors, (4307), 2370 states have internal predecessors, (4307), 36 states have call successors, (36), 19 states have call predecessors, (36), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2025-03-03 15:37:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 4381 transitions. [2025-03-03 15:37:50,238 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 4381 transitions. Word has length 58 [2025-03-03 15:37:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:50,239 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 4381 transitions. [2025-03-03 15:37:50,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 4381 transitions. [2025-03-03 15:37:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:37:50,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:50,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:50,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:37:50,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:50,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:50,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1840572420, now seen corresponding path program 1 times [2025-03-03 15:37:50,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:50,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718440315] [2025-03-03 15:37:50,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:50,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:37:50,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:37:50,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:50,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:50,313 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 15:37:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718440315] [2025-03-03 15:37:50,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718440315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:50,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:50,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:37:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191294004] [2025-03-03 15:37:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:50,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:37:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:50,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:37:50,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:37:50,316 INFO L87 Difference]: Start difference. First operand 2423 states and 4381 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:50,476 INFO L93 Difference]: Finished difference Result 2726 states and 4808 transitions. [2025-03-03 15:37:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:37:50,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-03 15:37:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:50,537 INFO L225 Difference]: With dead ends: 2726 [2025-03-03 15:37:50,537 INFO L226 Difference]: Without dead ends: 2433 [2025-03-03 15:37:50,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:37:50,539 INFO L435 NwaCegarLoop]: 4067 mSDtfsCounter, 4133 mSDsluCounter, 8084 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4142 SdHoareTripleChecker+Valid, 12151 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:50,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4142 Valid, 12151 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:37:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2025-03-03 15:37:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2423. [2025-03-03 15:37:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2365 states have (on average 1.8198731501057082) internal successors, (4304), 2370 states have internal predecessors, (4304), 36 states have call successors, (36), 19 states have call predecessors, (36), 20 states have return successors, (38), 35 states have call predecessors, (38), 34 states have call successors, (38) [2025-03-03 15:37:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 4378 transitions. [2025-03-03 15:37:50,646 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 4378 transitions. Word has length 58 [2025-03-03 15:37:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:50,647 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 4378 transitions. [2025-03-03 15:37:50,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 4378 transitions. [2025-03-03 15:37:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:37:50,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:50,649 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] [2025-03-03 15:37:50,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:37:50,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:50,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:50,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2005698237, now seen corresponding path program 1 times [2025-03-03 15:37:50,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:50,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689153047] [2025-03-03 15:37:50,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:50,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:37:50,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:37:50,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:50,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:50,769 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 15:37:50,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:50,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689153047] [2025-03-03 15:37:50,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689153047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:50,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:50,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:37:50,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767839280] [2025-03-03 15:37:50,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:50,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:37:50,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:50,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:37:50,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:37:50,773 INFO L87 Difference]: Start difference. First operand 2423 states and 4378 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:51,016 INFO L93 Difference]: Finished difference Result 2972 states and 5153 transitions. [2025-03-03 15:37:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:37:51,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-03 15:37:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:51,027 INFO L225 Difference]: With dead ends: 2972 [2025-03-03 15:37:51,027 INFO L226 Difference]: Without dead ends: 2680 [2025-03-03 15:37:51,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:37:51,031 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4207 mSDsluCounter, 4169 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4207 SdHoareTripleChecker+Valid, 8395 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:51,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4207 Valid, 8395 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:37:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2025-03-03 15:37:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2677. [2025-03-03 15:37:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2569 states have (on average 1.7781237835733747) internal successors, (4568), 2579 states have internal predecessors, (4568), 66 states have call successors, (66), 37 states have call predecessors, (66), 40 states have return successors, (71), 62 states have call predecessors, (71), 64 states have call successors, (71) [2025-03-03 15:37:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 4705 transitions. [2025-03-03 15:37:51,105 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 4705 transitions. Word has length 58 [2025-03-03 15:37:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:51,105 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 4705 transitions. [2025-03-03 15:37:51,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:37:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 4705 transitions. [2025-03-03 15:37:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:37:51,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:51,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:37:51,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:37:51,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:51,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:51,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1684647550, now seen corresponding path program 1 times [2025-03-03 15:37:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:51,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724393628] [2025-03-03 15:37:51,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:51,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:51,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:37:51,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:37:51,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:51,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:37:51,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:51,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724393628] [2025-03-03 15:37:51,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724393628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653504482] [2025-03-03 15:37:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:51,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:51,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:37:51,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:37:51,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:37:51,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:51,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:51,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:37:51,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:37:51,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653504482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:51,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:51,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:37:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625901496] [2025-03-03 15:37:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:51,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:51,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:51,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:51,314 INFO L87 Difference]: Start difference. First operand 2677 states and 4705 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:37:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:51,390 INFO L93 Difference]: Finished difference Result 3744 states and 6153 transitions. [2025-03-03 15:37:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:51,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 95 [2025-03-03 15:37:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:51,405 INFO L225 Difference]: With dead ends: 3744 [2025-03-03 15:37:51,405 INFO L226 Difference]: Without dead ends: 3198 [2025-03-03 15:37:51,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 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 15:37:51,409 INFO L435 NwaCegarLoop]: 4111 mSDtfsCounter, 4079 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 4244 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:51,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 4244 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2025-03-03 15:37:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 3176. [2025-03-03 15:37:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3176 states, 2972 states have (on average 1.7200538358008075) internal successors, (5112), 2989 states have internal predecessors, (5112), 122 states have call successors, (122), 73 states have call predecessors, (122), 80 states have return successors, (133), 115 states have call predecessors, (133), 120 states have call successors, (133) [2025-03-03 15:37:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 5367 transitions. [2025-03-03 15:37:51,493 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 5367 transitions. Word has length 95 [2025-03-03 15:37:51,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:51,493 INFO L471 AbstractCegarLoop]: Abstraction has 3176 states and 5367 transitions. [2025-03-03 15:37:51,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:37:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 5367 transitions. [2025-03-03 15:37:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:37:51,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:51,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:37:51,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:37:51,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 15:37:51,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:51,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1686969092, now seen corresponding path program 1 times [2025-03-03 15:37:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:51,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273890959] [2025-03-03 15:37:51,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:51,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:37:51,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:37:51,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:51,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:37:51,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:51,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273890959] [2025-03-03 15:37:51,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273890959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:51,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009669233] [2025-03-03 15:37:51,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:51,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:51,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:51,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:51,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:37:51,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:37:51,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:37:51,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:51,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:51,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:37:51,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 15:37:51,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009669233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:51,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:51,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:37:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706214696] [2025-03-03 15:37:51,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:51,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:51,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:51,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:51,844 INFO L87 Difference]: Start difference. First operand 3176 states and 5367 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:37:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:52,010 INFO L93 Difference]: Finished difference Result 5115 states and 8007 transitions. [2025-03-03 15:37:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2025-03-03 15:37:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:52,027 INFO L225 Difference]: With dead ends: 5115 [2025-03-03 15:37:52,028 INFO L226 Difference]: Without dead ends: 4071 [2025-03-03 15:37:52,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 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 15:37:52,031 INFO L435 NwaCegarLoop]: 4227 mSDtfsCounter, 114 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 8334 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:52,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 8334 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2025-03-03 15:37:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 4071. [2025-03-03 15:37:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4071 states, 3696 states have (on average 1.6409632034632036) internal successors, (6065), 3722 states have internal predecessors, (6065), 221 states have call successors, (221), 137 states have call predecessors, (221), 152 states have return successors, (270), 215 states have call predecessors, (270), 219 states have call successors, (270) [2025-03-03 15:37:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 6556 transitions. [2025-03-03 15:37:52,143 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 6556 transitions. Word has length 95 [2025-03-03 15:37:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:52,143 INFO L471 AbstractCegarLoop]: Abstraction has 4071 states and 6556 transitions. [2025-03-03 15:37:52,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:37:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 6556 transitions. [2025-03-03 15:37:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 15:37:52,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:52,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:37:52,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:37:52,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-03 15:37:52,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:52,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:52,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1894693344, now seen corresponding path program 1 times [2025-03-03 15:37:52,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:52,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797697415] [2025-03-03 15:37:52,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:52,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:52,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:37:52,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:37:52,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:52,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 15:37:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:52,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797697415] [2025-03-03 15:37:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797697415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:52,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395851823] [2025-03-03 15:37:52,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:52,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:52,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:52,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:52,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:37:52,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:37:52,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:37:52,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:52,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:52,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:37:52,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 15:37:52,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:52,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395851823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:52,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:52,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:37:52,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72789124] [2025-03-03 15:37:52,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:52,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:52,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:52,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:52,573 INFO L87 Difference]: Start difference. First operand 4071 states and 6556 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:37:52,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:52,671 INFO L93 Difference]: Finished difference Result 6197 states and 9447 transitions. [2025-03-03 15:37:52,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:52,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 140 [2025-03-03 15:37:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:52,688 INFO L225 Difference]: With dead ends: 6197 [2025-03-03 15:37:52,688 INFO L226 Difference]: Without dead ends: 4263 [2025-03-03 15:37:52,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 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 15:37:52,694 INFO L435 NwaCegarLoop]: 4114 mSDtfsCounter, 4090 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 4138 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:52,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 4138 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2025-03-03 15:37:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4263. [2025-03-03 15:37:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 3868 states have (on average 1.6057394002068253) internal successors, (6211), 3894 states have internal predecessors, (6211), 225 states have call successors, (225), 153 states have call predecessors, (225), 168 states have return successors, (274), 219 states have call predecessors, (274), 223 states have call successors, (274) [2025-03-03 15:37:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6710 transitions. [2025-03-03 15:37:52,869 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6710 transitions. Word has length 140 [2025-03-03 15:37:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:52,869 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 6710 transitions. [2025-03-03 15:37:52,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:37:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6710 transitions. [2025-03-03 15:37:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 15:37:52,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:52,874 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:37:52,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 15:37:53,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:53,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:53,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1650592702, now seen corresponding path program 1 times [2025-03-03 15:37:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208448249] [2025-03-03 15:37:53,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:53,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:37:53,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:37:53,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:53,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 15:37:53,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208448249] [2025-03-03 15:37:53,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208448249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201311134] [2025-03-03 15:37:53,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:53,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:53,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:53,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:37:53,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 15:37:53,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 15:37:53,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:53,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:53,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:37:53,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 15:37:53,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:53,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201311134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:53,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:53,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:37:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168577694] [2025-03-03 15:37:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:53,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:53,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:53,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:53,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:53,276 INFO L87 Difference]: Start difference. First operand 4263 states and 6710 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:37:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:53,379 INFO L93 Difference]: Finished difference Result 6070 states and 9038 transitions. [2025-03-03 15:37:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:53,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 140 [2025-03-03 15:37:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:53,402 INFO L225 Difference]: With dead ends: 6070 [2025-03-03 15:37:53,402 INFO L226 Difference]: Without dead ends: 4383 [2025-03-03 15:37:53,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 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 15:37:53,409 INFO L435 NwaCegarLoop]: 4133 mSDtfsCounter, 4056 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4056 SdHoareTripleChecker+Valid, 4272 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:53,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4056 Valid, 4272 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2025-03-03 15:37:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 4251. [2025-03-03 15:37:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 3856 states have (on average 1.5982883817427387) internal successors, (6163), 3882 states have internal predecessors, (6163), 225 states have call successors, (225), 153 states have call predecessors, (225), 168 states have return successors, (274), 219 states have call predecessors, (274), 223 states have call successors, (274) [2025-03-03 15:37:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6662 transitions. [2025-03-03 15:37:53,611 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6662 transitions. Word has length 140 [2025-03-03 15:37:53,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:53,614 INFO L471 AbstractCegarLoop]: Abstraction has 4251 states and 6662 transitions. [2025-03-03 15:37:53,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:37:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6662 transitions. [2025-03-03 15:37:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 15:37:53,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:53,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:37:53,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:37:53,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:53,831 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:53,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:53,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1609854635, now seen corresponding path program 1 times [2025-03-03 15:37:53,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644591442] [2025-03-03 15:37:53,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:53,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 15:37:53,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 15:37:53,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:53,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 15:37:53,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644591442] [2025-03-03 15:37:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644591442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057915481] [2025-03-03 15:37:53,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:53,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:53,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:53,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:37:53,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 15:37:54,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 15:37:54,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:54,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:54,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:37:54,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 15:37:54,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:54,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057915481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:54,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:37:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773752791] [2025-03-03 15:37:54,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:54,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:54,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:54,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:54,062 INFO L87 Difference]: Start difference. First operand 4251 states and 6662 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:37:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:54,190 INFO L93 Difference]: Finished difference Result 8307 states and 11884 transitions. [2025-03-03 15:37:54,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:54,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 141 [2025-03-03 15:37:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:54,208 INFO L225 Difference]: With dead ends: 8307 [2025-03-03 15:37:54,208 INFO L226 Difference]: Without dead ends: 6193 [2025-03-03 15:37:54,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 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 15:37:54,216 INFO L435 NwaCegarLoop]: 4224 mSDtfsCounter, 123 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 8331 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:54,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 8331 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6193 states. [2025-03-03 15:37:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6193 to 6189. [2025-03-03 15:37:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6189 states, 5428 states have (on average 1.4931834929992631) internal successors, (8105), 5478 states have internal predecessors, (8105), 431 states have call successors, (431), 297 states have call predecessors, (431), 328 states have return successors, (598), 421 states have call predecessors, (598), 429 states have call successors, (598) [2025-03-03 15:37:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6189 states to 6189 states and 9134 transitions. [2025-03-03 15:37:54,449 INFO L78 Accepts]: Start accepts. Automaton has 6189 states and 9134 transitions. Word has length 141 [2025-03-03 15:37:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:54,450 INFO L471 AbstractCegarLoop]: Abstraction has 6189 states and 9134 transitions. [2025-03-03 15:37:54,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:37:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 6189 states and 9134 transitions. [2025-03-03 15:37:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 15:37:54,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:54,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:54,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 15:37:54,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 15:37:54,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:54,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1447915038, now seen corresponding path program 1 times [2025-03-03 15:37:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945459238] [2025-03-03 15:37:54,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:54,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 15:37:54,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 15:37:54,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:54,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 15:37:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945459238] [2025-03-03 15:37:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945459238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416370418] [2025-03-03 15:37:54,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:54,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:54,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:54,725 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:54,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:37:54,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 15:37:54,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 15:37:54,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:54,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:54,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:37:54,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:37:54,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:54,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416370418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:54,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:54,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:37:54,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237568595] [2025-03-03 15:37:54,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:54,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:54,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:54,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:54,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:54,861 INFO L87 Difference]: Start difference. First operand 6189 states and 9134 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:37:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:55,025 INFO L93 Difference]: Finished difference Result 8305 states and 11960 transitions. [2025-03-03 15:37:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:55,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 142 [2025-03-03 15:37:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:55,039 INFO L225 Difference]: With dead ends: 8305 [2025-03-03 15:37:55,039 INFO L226 Difference]: Without dead ends: 6209 [2025-03-03 15:37:55,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 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 15:37:55,044 INFO L435 NwaCegarLoop]: 4191 mSDtfsCounter, 87 mSDsluCounter, 4098 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 8289 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:55,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 8289 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2025-03-03 15:37:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 6181. [2025-03-03 15:37:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6181 states, 5420 states have (on average 1.4828413284132842) internal successors, (8037), 5470 states have internal predecessors, (8037), 431 states have call successors, (431), 297 states have call predecessors, (431), 328 states have return successors, (598), 421 states have call predecessors, (598), 429 states have call successors, (598) [2025-03-03 15:37:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6181 states to 6181 states and 9066 transitions. [2025-03-03 15:37:55,217 INFO L78 Accepts]: Start accepts. Automaton has 6181 states and 9066 transitions. Word has length 142 [2025-03-03 15:37:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:55,218 INFO L471 AbstractCegarLoop]: Abstraction has 6181 states and 9066 transitions. [2025-03-03 15:37:55,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:37:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6181 states and 9066 transitions. [2025-03-03 15:37:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 15:37:55,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:55,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:55,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 15:37:55,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:55,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:55,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1295083305, now seen corresponding path program 1 times [2025-03-03 15:37:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126614787] [2025-03-03 15:37:55,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:55,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 15:37:55,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 15:37:55,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:55,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 15:37:55,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:55,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126614787] [2025-03-03 15:37:55,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126614787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:55,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074319100] [2025-03-03 15:37:55,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:55,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:55,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:55,480 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:55,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:37:55,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 15:37:55,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 15:37:55,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:55,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:55,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:37:55,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 15:37:55,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074319100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:55,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:55,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-03 15:37:55,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489538021] [2025-03-03 15:37:55,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:55,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:37:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:55,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:37:55,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:37:55,641 INFO L87 Difference]: Start difference. First operand 6181 states and 9066 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:37:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:56,155 INFO L93 Difference]: Finished difference Result 10217 states and 14229 transitions. [2025-03-03 15:37:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:37:56,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 143 [2025-03-03 15:37:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:56,207 INFO L225 Difference]: With dead ends: 10217 [2025-03-03 15:37:56,208 INFO L226 Difference]: Without dead ends: 6181 [2025-03-03 15:37:56,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:37:56,222 INFO L435 NwaCegarLoop]: 4061 mSDtfsCounter, 4110 mSDsluCounter, 8077 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4118 SdHoareTripleChecker+Valid, 12138 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:56,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4118 Valid, 12138 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:37:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6181 states. [2025-03-03 15:37:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6181 to 6181. [2025-03-03 15:37:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6181 states, 5420 states have (on average 1.465129151291513) internal successors, (7941), 5470 states have internal predecessors, (7941), 431 states have call successors, (431), 297 states have call predecessors, (431), 328 states have return successors, (598), 421 states have call predecessors, (598), 429 states have call successors, (598) [2025-03-03 15:37:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6181 states to 6181 states and 8970 transitions. [2025-03-03 15:37:56,477 INFO L78 Accepts]: Start accepts. Automaton has 6181 states and 8970 transitions. Word has length 143 [2025-03-03 15:37:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:56,477 INFO L471 AbstractCegarLoop]: Abstraction has 6181 states and 8970 transitions. [2025-03-03 15:37:56,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:37:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 6181 states and 8970 transitions. [2025-03-03 15:37:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 15:37:56,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:56,483 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:56,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:37:56,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:56,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:56,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:56,689 INFO L85 PathProgramCache]: Analyzing trace with hash 308500616, now seen corresponding path program 1 times [2025-03-03 15:37:56,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:56,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024759438] [2025-03-03 15:37:56,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:56,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 15:37:56,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 15:37:56,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:56,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 15:37:56,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:56,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024759438] [2025-03-03 15:37:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024759438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937505639] [2025-03-03 15:37:56,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:56,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:56,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:56,764 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:56,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:37:56,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 15:37:56,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 15:37:56,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:56,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:56,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:37:56,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 15:37:56,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:56,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937505639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:56,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:56,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-03 15:37:56,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943077273] [2025-03-03 15:37:56,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:56,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:37:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:56,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:37:56,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:37:56,903 INFO L87 Difference]: Start difference. First operand 6181 states and 8970 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:37:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:57,244 INFO L93 Difference]: Finished difference Result 9765 states and 13581 transitions. [2025-03-03 15:37:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:37:57,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 143 [2025-03-03 15:37:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:57,260 INFO L225 Difference]: With dead ends: 9765 [2025-03-03 15:37:57,260 INFO L226 Difference]: Without dead ends: 6313 [2025-03-03 15:37:57,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:37:57,266 INFO L435 NwaCegarLoop]: 4059 mSDtfsCounter, 4148 mSDsluCounter, 8072 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4157 SdHoareTripleChecker+Valid, 12131 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:57,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4157 Valid, 12131 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:37:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2025-03-03 15:37:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 5279. [2025-03-03 15:37:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5279 states, 4702 states have (on average 1.47809442790302) internal successors, (6950), 4732 states have internal predecessors, (6950), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2025-03-03 15:37:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 7720 transitions. [2025-03-03 15:37:57,418 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 7720 transitions. Word has length 143 [2025-03-03 15:37:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:57,419 INFO L471 AbstractCegarLoop]: Abstraction has 5279 states and 7720 transitions. [2025-03-03 15:37:57,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:37:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 7720 transitions. [2025-03-03 15:37:57,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 15:37:57,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:57,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:57,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 15:37:57,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 15:37:57,624 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:57,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1385054025, now seen corresponding path program 1 times [2025-03-03 15:37:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923380463] [2025-03-03 15:37:57,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:57,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 15:37:57,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 15:37:57,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:57,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 15:37:57,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923380463] [2025-03-03 15:37:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923380463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407624486] [2025-03-03 15:37:57,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:57,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:57,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:57,688 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:57,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:37:57,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 15:37:57,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 15:37:57,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:57,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:57,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 15:37:57,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 15:37:57,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:37:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 15:37:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407624486] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:57,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 15:37:57,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-03 15:37:57,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778043350] [2025-03-03 15:37:57,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:57,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:37:57,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:57,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:37:57,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:37:57,928 INFO L87 Difference]: Start difference. First operand 5279 states and 7720 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:37:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:58,462 INFO L93 Difference]: Finished difference Result 9236 states and 12380 transitions. [2025-03-03 15:37:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:37:58,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 143 [2025-03-03 15:37:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:58,483 INFO L225 Difference]: With dead ends: 9236 [2025-03-03 15:37:58,484 INFO L226 Difference]: Without dead ends: 7736 [2025-03-03 15:37:58,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:37:58,490 INFO L435 NwaCegarLoop]: 4210 mSDtfsCounter, 4187 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4187 SdHoareTripleChecker+Valid, 8372 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:58,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4187 Valid, 8372 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:37:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7736 states. [2025-03-03 15:37:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7736 to 6426. [2025-03-03 15:37:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6426 states, 5641 states have (on average 1.4183655380251727) internal successors, (8001), 5675 states have internal predecessors, (8001), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2025-03-03 15:37:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6426 states to 6426 states and 9049 transitions. [2025-03-03 15:37:58,742 INFO L78 Accepts]: Start accepts. Automaton has 6426 states and 9049 transitions. Word has length 143 [2025-03-03 15:37:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:58,742 INFO L471 AbstractCegarLoop]: Abstraction has 6426 states and 9049 transitions. [2025-03-03 15:37:58,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:37:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 6426 states and 9049 transitions. [2025-03-03 15:37:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 15:37:58,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:58,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:58,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 15:37:58,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 15:37:58,952 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:58,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:58,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1609456863, now seen corresponding path program 1 times [2025-03-03 15:37:58,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:58,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402423425] [2025-03-03 15:37:58,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:58,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:37:58,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:37:58,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:58,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 15:37:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402423425] [2025-03-03 15:37:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402423425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223586135] [2025-03-03 15:37:59,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:59,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:59,005 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:59,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 15:37:59,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:37:59,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:37:59,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:59,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:59,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:37:59,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 15:37:59,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:59,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223586135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:59,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:59,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:37:59,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289079670] [2025-03-03 15:37:59,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:59,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:59,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:59,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:59,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:59,093 INFO L87 Difference]: Start difference. First operand 6426 states and 9049 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 15:37:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:59,291 INFO L93 Difference]: Finished difference Result 8485 states and 11486 transitions. [2025-03-03 15:37:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:59,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 147 [2025-03-03 15:37:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:59,307 INFO L225 Difference]: With dead ends: 8485 [2025-03-03 15:37:59,308 INFO L226 Difference]: Without dead ends: 6430 [2025-03-03 15:37:59,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 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 15:37:59,313 INFO L435 NwaCegarLoop]: 4107 mSDtfsCounter, 0 mSDsluCounter, 4096 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8203 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:59,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8203 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states. [2025-03-03 15:37:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 6430. [2025-03-03 15:37:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6430 states, 5645 states have (on average 1.4180690876882196) internal successors, (8005), 5679 states have internal predecessors, (8005), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2025-03-03 15:37:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6430 states to 6430 states and 9053 transitions. [2025-03-03 15:37:59,732 INFO L78 Accepts]: Start accepts. Automaton has 6430 states and 9053 transitions. Word has length 147 [2025-03-03 15:37:59,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:59,733 INFO L471 AbstractCegarLoop]: Abstraction has 6430 states and 9053 transitions. [2025-03-03 15:37:59,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 15:37:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 6430 states and 9053 transitions. [2025-03-03 15:37:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:37:59,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:59,739 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:59,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 15:37:59,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 15:37:59,943 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:59,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 818036730, now seen corresponding path program 1 times [2025-03-03 15:37:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:59,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309899695] [2025-03-03 15:37:59,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:59,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:37:59,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:37:59,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:59,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 15:38:00,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309899695] [2025-03-03 15:38:00,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309899695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155863671] [2025-03-03 15:38:00,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:00,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:00,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:00,021 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:00,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 15:38:00,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:38:00,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:38:00,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:00,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:00,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 15:38:00,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 15:38:00,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155863671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:00,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:00,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 15:38:00,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658401602] [2025-03-03 15:38:00,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:00,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:38:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:00,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:38:00,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:38:00,126 INFO L87 Difference]: Start difference. First operand 6430 states and 9053 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:38:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:00,300 INFO L93 Difference]: Finished difference Result 8590 states and 11649 transitions. [2025-03-03 15:38:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:38:00,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 148 [2025-03-03 15:38:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:00,312 INFO L225 Difference]: With dead ends: 8590 [2025-03-03 15:38:00,312 INFO L226 Difference]: Without dead ends: 5010 [2025-03-03 15:38:00,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:38:00,318 INFO L435 NwaCegarLoop]: 4105 mSDtfsCounter, 0 mSDsluCounter, 12309 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16414 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:00,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16414 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2025-03-03 15:38:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 5010. [2025-03-03 15:38:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5010 states, 4473 states have (on average 1.4757433489827856) internal successors, (6601), 4499 states have internal predecessors, (6601), 307 states have call successors, (307), 205 states have call predecessors, (307), 228 states have return successors, (361), 309 states have call predecessors, (361), 305 states have call successors, (361) [2025-03-03 15:38:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 7269 transitions. [2025-03-03 15:38:00,463 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 7269 transitions. Word has length 148 [2025-03-03 15:38:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:00,464 INFO L471 AbstractCegarLoop]: Abstraction has 5010 states and 7269 transitions. [2025-03-03 15:38:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:38:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 7269 transitions. [2025-03-03 15:38:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:38:00,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:00,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:00,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 15:38:00,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 15:38:00,670 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:00,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1899884838, now seen corresponding path program 1 times [2025-03-03 15:38:00,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:00,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256920955] [2025-03-03 15:38:00,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:00,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:38:00,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:38:00,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:00,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 15:38:00,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:00,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256920955] [2025-03-03 15:38:00,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256920955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:00,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177034050] [2025-03-03 15:38:00,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:00,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:00,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:00,723 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:00,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 15:38:00,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:38:00,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:38:00,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:00,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:00,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 15:38:00,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 15:38:00,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:00,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177034050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:00,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:00,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-03 15:38:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859255197] [2025-03-03 15:38:00,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:00,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:38:00,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:00,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:38:00,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:38:00,806 INFO L87 Difference]: Start difference. First operand 5010 states and 7269 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:38:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:00,952 INFO L93 Difference]: Finished difference Result 6744 states and 9283 transitions. [2025-03-03 15:38:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:38:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 148 [2025-03-03 15:38:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:00,961 INFO L225 Difference]: With dead ends: 6744 [2025-03-03 15:38:00,961 INFO L226 Difference]: Without dead ends: 2930 [2025-03-03 15:38:00,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:38:00,966 INFO L435 NwaCegarLoop]: 4103 mSDtfsCounter, 0 mSDsluCounter, 12303 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16406 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:00,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16406 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2025-03-03 15:38:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2930. [2025-03-03 15:38:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 2783 states have (on average 1.684513115343155) internal successors, (4688), 2791 states have internal predecessors, (4688), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2025-03-03 15:38:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 4859 transitions. [2025-03-03 15:38:01,019 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 4859 transitions. Word has length 148 [2025-03-03 15:38:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:01,019 INFO L471 AbstractCegarLoop]: Abstraction has 2930 states and 4859 transitions. [2025-03-03 15:38:01,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:38:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 4859 transitions. [2025-03-03 15:38:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:38:01,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:01,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:01,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 15:38:01,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 15:38:01,227 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:01,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 693921304, now seen corresponding path program 1 times [2025-03-03 15:38:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5980462] [2025-03-03 15:38:01,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:01,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:38:01,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:38:01,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:01,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 15:38:01,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 15:38:01,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:38:01,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:38:01,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:01,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 15:38:01,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 15:38:01,299 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 15:38:01,300 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-03 15:38:01,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-03 15:38:01,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:38:01,306 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:01,400 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 15:38:01,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 03:38:01 BoogieIcfgContainer [2025-03-03 15:38:01,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 15:38:01,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 15:38:01,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 15:38:01,404 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 15:38:01,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:37:48" (3/4) ... [2025-03-03 15:38:01,405 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 15:38:01,520 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 109. [2025-03-03 15:38:01,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 15:38:01,611 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 15:38:01,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 15:38:01,612 INFO L158 Benchmark]: Toolchain (without parser) took 22371.51ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 99.4MB in the beginning and 279.7MB in the end (delta: -180.3MB). Peak memory consumption was 293.4MB. Max. memory is 16.1GB. [2025-03-03 15:38:01,612 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 15:38:01,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1949.16ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 99.4MB in the beginning and 165.1MB in the end (delta: -65.8MB). Peak memory consumption was 135.7MB. Max. memory is 16.1GB. [2025-03-03 15:38:01,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 363.40ms. Allocated memory is still 285.2MB. Free memory was 165.1MB in the beginning and 88.3MB in the end (delta: 76.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-03 15:38:01,612 INFO L158 Benchmark]: Boogie Preprocessor took 365.02ms. Allocated memory is still 285.2MB. Free memory was 88.3MB in the beginning and 96.9MB in the end (delta: -8.6MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2025-03-03 15:38:01,613 INFO L158 Benchmark]: IcfgBuilder took 6305.13ms. Allocated memory was 285.2MB in the beginning and 645.9MB in the end (delta: 360.7MB). Free memory was 95.0MB in the beginning and 149.0MB in the end (delta: -54.0MB). Peak memory consumption was 369.8MB. Max. memory is 16.1GB. [2025-03-03 15:38:01,613 INFO L158 Benchmark]: TraceAbstraction took 13170.69ms. Allocated memory is still 645.9MB. Free memory was 149.0MB in the beginning and 309.0MB in the end (delta: -160.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 15:38:01,613 INFO L158 Benchmark]: Witness Printer took 207.28ms. Allocated memory is still 645.9MB. Free memory was 309.0MB in the beginning and 279.7MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 15:38:01,614 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.96ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1949.16ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 99.4MB in the beginning and 165.1MB in the end (delta: -65.8MB). Peak memory consumption was 135.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 363.40ms. Allocated memory is still 285.2MB. Free memory was 165.1MB in the beginning and 88.3MB in the end (delta: 76.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 365.02ms. Allocated memory is still 285.2MB. Free memory was 88.3MB in the beginning and 96.9MB in the end (delta: -8.6MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. * IcfgBuilder took 6305.13ms. Allocated memory was 285.2MB in the beginning and 645.9MB in the end (delta: 360.7MB). Free memory was 95.0MB in the beginning and 149.0MB in the end (delta: -54.0MB). Peak memory consumption was 369.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13170.69ms. Allocated memory is still 645.9MB. Free memory was 149.0MB in the beginning and 309.0MB in the end (delta: -160.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 207.28ms. Allocated memory is still 645.9MB. Free memory was 309.0MB in the beginning and 279.7MB in the end (delta: 29.4MB). 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11049]: 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 8 procedures, 2302 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46002 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45947 mSDsluCounter, 173093 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102768 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1375 IncrementalHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 70325 mSDtfsCounter, 1375 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1854 GetRequests, 1776 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6430occurred in iteration=15, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3688 NumberOfCodeBlocks, 3688 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3653 ConstructedInterpolants, 0 QuantifiedInterpolants, 4652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5043 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 30 InterpolantComputations, 17 PerfectInterpolantSequences, 1598/1846 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 15:38:01,635 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