./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.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/systemc/pc_sfifo_3.cil.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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:43:24,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:43:24,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:43:24,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:43:24,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:43:24,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:43:24,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:43:24,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:43:24,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:43:24,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:43:24,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:43:24,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:43:24,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:43:24,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:43:24,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:43:24,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:43:24,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:43:24,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:43:24,456 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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2025-03-03 14:43:24,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:43:24,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:43:24,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:43:24,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:43:24,652 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:43:24,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2025-03-03 14:43:25,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfcc98423/eb2fc5b4c0ff4229a6640f0ea2780f7f/FLAGf6248eb96 [2025-03-03 14:43:25,986 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:43:25,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2025-03-03 14:43:25,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfcc98423/eb2fc5b4c0ff4229a6640f0ea2780f7f/FLAGf6248eb96 [2025-03-03 14:43:26,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfcc98423/eb2fc5b4c0ff4229a6640f0ea2780f7f [2025-03-03 14:43:26,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:43:26,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:43:26,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:43:26,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:43:26,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:43:26,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b544826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26, skipping insertion in model container [2025-03-03 14:43:26,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:43:26,127 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/systemc/pc_sfifo_3.cil.c[640,653] [2025-03-03 14:43:26,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:43:26,186 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:43:26,194 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/systemc/pc_sfifo_3.cil.c[640,653] [2025-03-03 14:43:26,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:43:26,241 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:43:26,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26 WrapperNode [2025-03-03 14:43:26,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:43:26,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:43:26,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:43:26,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:43:26,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,272 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 215 [2025-03-03 14:43:26,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:43:26,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:43:26,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:43:26,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:43:26,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,302 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 14:43:26,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:43:26,322 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:43:26,322 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:43:26,322 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:43:26,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (1/1) ... [2025-03-03 14:43:26,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:43:26,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:26,347 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 14:43:26,350 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 14:43:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:43:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 14:43:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 14:43:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 14:43:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 14:43:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 14:43:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 14:43:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 14:43:26,366 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 14:43:26,366 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 14:43:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 14:43:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 14:43:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 14:43:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:43:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 14:43:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 14:43:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:43:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:43:26,367 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 14:43:26,367 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 14:43:26,425 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:43:26,427 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:43:26,682 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L217: do_read_c_~a~0#1 := ~a_t~0; [2025-03-03 14:43:26,683 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-03 14:43:26,683 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume !(1 == ~q_free~0); [2025-03-03 14:43:26,725 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 14:43:26,725 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:43:26,735 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:43:26,736 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:43:26,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:43:26 BoogieIcfgContainer [2025-03-03 14:43:26,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:43:26,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:43:26,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:43:26,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:43:26,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:43:26" (1/3) ... [2025-03-03 14:43:26,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dbaf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:43:26, skipping insertion in model container [2025-03-03 14:43:26,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:26" (2/3) ... [2025-03-03 14:43:26,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dbaf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:43:26, skipping insertion in model container [2025-03-03 14:43:26,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:43:26" (3/3) ... [2025-03-03 14:43:26,744 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2025-03-03 14:43:26,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:43:26,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil.c that has 9 procedures, 121 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 14:43:26,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:43:26,805 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;@3b7ed41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:43:26,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:43:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 99 states have internal predecessors, (140), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 14:43:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:43:26,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:26,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:26,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:26,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1680847584, now seen corresponding path program 1 times [2025-03-03 14:43:26,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:26,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672306064] [2025-03-03 14:43:26,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:26,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:43:26,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:43:26,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:26,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:27,198 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 14:43:27,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:27,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672306064] [2025-03-03 14:43:27,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672306064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:27,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:27,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:43:27,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855839975] [2025-03-03 14:43:27,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:27,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:43:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:43:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:43:27,219 INFO L87 Difference]: Start difference. First operand has 121 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 99 states have internal predecessors, (140), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:27,539 INFO L93 Difference]: Finished difference Result 356 states and 520 transitions. [2025-03-03 14:43:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:43:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2025-03-03 14:43:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:27,551 INFO L225 Difference]: With dead ends: 356 [2025-03-03 14:43:27,552 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 14:43:27,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:27,556 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 252 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:27,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 413 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 14:43:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 229. [2025-03-03 14:43:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 183 states have (on average 1.4153005464480874) internal successors, (259), 187 states have internal predecessors, (259), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2025-03-03 14:43:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 320 transitions. [2025-03-03 14:43:27,598 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 320 transitions. Word has length 64 [2025-03-03 14:43:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:27,602 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 320 transitions. [2025-03-03 14:43:27,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 320 transitions. [2025-03-03 14:43:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:43:27,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:27,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:27,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:43:27,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:27,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1306080384, now seen corresponding path program 1 times [2025-03-03 14:43:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:27,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057627673] [2025-03-03 14:43:27,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:27,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:27,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:43:27,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:43:27,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:27,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:27,779 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 14:43:27,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:27,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057627673] [2025-03-03 14:43:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057627673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:27,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406766501] [2025-03-03 14:43:27,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:27,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:27,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:27,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:27,782 INFO L87 Difference]: Start difference. First operand 229 states and 320 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:28,179 INFO L93 Difference]: Finished difference Result 602 states and 841 transitions. [2025-03-03 14:43:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:43:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2025-03-03 14:43:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:28,182 INFO L225 Difference]: With dead ends: 602 [2025-03-03 14:43:28,182 INFO L226 Difference]: Without dead ends: 389 [2025-03-03 14:43:28,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:43:28,186 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 258 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:28,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 756 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:43:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-03 14:43:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 343. [2025-03-03 14:43:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 275 states have (on average 1.4072727272727272) internal successors, (387), 281 states have internal predecessors, (387), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2025-03-03 14:43:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 482 transitions. [2025-03-03 14:43:28,220 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 482 transitions. Word has length 64 [2025-03-03 14:43:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:28,221 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 482 transitions. [2025-03-03 14:43:28,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 482 transitions. [2025-03-03 14:43:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:43:28,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:28,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:28,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:43:28,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:28,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1855696319, now seen corresponding path program 1 times [2025-03-03 14:43:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:28,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142209898] [2025-03-03 14:43:28,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:28,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:28,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:43:28,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:43:28,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:28,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:28,323 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 14:43:28,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:28,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142209898] [2025-03-03 14:43:28,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142209898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:28,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:28,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:43:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537394884] [2025-03-03 14:43:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:28,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:43:28,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:28,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:43:28,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:43:28,325 INFO L87 Difference]: Start difference. First operand 343 states and 482 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:43:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:29,141 INFO L93 Difference]: Finished difference Result 1805 states and 2546 transitions. [2025-03-03 14:43:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:43:29,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2025-03-03 14:43:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:29,153 INFO L225 Difference]: With dead ends: 1805 [2025-03-03 14:43:29,154 INFO L226 Difference]: Without dead ends: 1466 [2025-03-03 14:43:29,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:43:29,159 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1219 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:29,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 983 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 14:43:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2025-03-03 14:43:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1413. [2025-03-03 14:43:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1140 states have (on average 1.3578947368421053) internal successors, (1548), 1161 states have internal predecessors, (1548), 152 states have call successors, (152), 105 states have call predecessors, (152), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2025-03-03 14:43:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1886 transitions. [2025-03-03 14:43:29,259 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1886 transitions. Word has length 64 [2025-03-03 14:43:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:29,259 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 1886 transitions. [2025-03-03 14:43:29,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:43:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1886 transitions. [2025-03-03 14:43:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:43:29,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:29,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:29,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:43:29,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:29,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1685144182, now seen corresponding path program 1 times [2025-03-03 14:43:29,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:29,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009459457] [2025-03-03 14:43:29,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:43:29,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:43:29,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:29,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:29,355 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 14:43:29,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:29,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009459457] [2025-03-03 14:43:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009459457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:29,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:29,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220087423] [2025-03-03 14:43:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:29,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:29,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:29,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:29,358 INFO L87 Difference]: Start difference. First operand 1413 states and 1886 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:29,464 INFO L93 Difference]: Finished difference Result 2856 states and 3834 transitions. [2025-03-03 14:43:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:43:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-03 14:43:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:29,474 INFO L225 Difference]: With dead ends: 2856 [2025-03-03 14:43:29,475 INFO L226 Difference]: Without dead ends: 1453 [2025-03-03 14:43:29,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:29,481 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:29,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:43:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-03-03 14:43:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2025-03-03 14:43:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1172 states have (on average 1.3430034129692834) internal successors, (1574), 1193 states have internal predecessors, (1574), 152 states have call successors, (152), 105 states have call predecessors, (152), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2025-03-03 14:43:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1920 transitions. [2025-03-03 14:43:29,576 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1920 transitions. Word has length 65 [2025-03-03 14:43:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:29,577 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 1920 transitions. [2025-03-03 14:43:29,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1920 transitions. [2025-03-03 14:43:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:43:29,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:29,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:29,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:43:29,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:29,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:29,579 INFO L85 PathProgramCache]: Analyzing trace with hash -977019115, now seen corresponding path program 1 times [2025-03-03 14:43:29,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:29,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436449785] [2025-03-03 14:43:29,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:29,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:29,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:43:29,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:43:29,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:29,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:29,671 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 14:43:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436449785] [2025-03-03 14:43:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436449785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:29,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:29,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:43:29,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519738608] [2025-03-03 14:43:29,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:29,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:43:29,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:29,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:43:29,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:43:29,673 INFO L87 Difference]: Start difference. First operand 1453 states and 1920 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 14:43:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:30,495 INFO L93 Difference]: Finished difference Result 4889 states and 6554 transitions. [2025-03-03 14:43:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:43:30,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-03-03 14:43:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:30,503 INFO L225 Difference]: With dead ends: 4889 [2025-03-03 14:43:30,503 INFO L226 Difference]: Without dead ends: 1719 [2025-03-03 14:43:30,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:43:30,510 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1300 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:30,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1012 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:43:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2025-03-03 14:43:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1649. [2025-03-03 14:43:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1296 states have (on average 1.3001543209876543) internal successors, (1685), 1319 states have internal predecessors, (1685), 192 states have call successors, (192), 133 states have call predecessors, (192), 160 states have return successors, (240), 198 states have call predecessors, (240), 190 states have call successors, (240) [2025-03-03 14:43:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2117 transitions. [2025-03-03 14:43:30,589 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2117 transitions. Word has length 65 [2025-03-03 14:43:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:30,589 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2117 transitions. [2025-03-03 14:43:30,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 14:43:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2117 transitions. [2025-03-03 14:43:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:43:30,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:30,591 INFO L218 NwaCegarLoop]: trace histogram [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 14:43:30,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:43:30,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:30,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash 323171225, now seen corresponding path program 1 times [2025-03-03 14:43:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:30,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534912394] [2025-03-03 14:43:30,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:30,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:30,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:43:30,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:43:30,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:30,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:43:30,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:30,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534912394] [2025-03-03 14:43:30,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534912394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:30,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:30,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:30,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832704926] [2025-03-03 14:43:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:30,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:30,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:30,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:30,681 INFO L87 Difference]: Start difference. First operand 1649 states and 2117 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:30,750 INFO L93 Difference]: Finished difference Result 3348 states and 4328 transitions. [2025-03-03 14:43:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:43:30,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2025-03-03 14:43:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:30,757 INFO L225 Difference]: With dead ends: 3348 [2025-03-03 14:43:30,757 INFO L226 Difference]: Without dead ends: 1709 [2025-03-03 14:43:30,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:30,761 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:30,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:43:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-03-03 14:43:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1709. [2025-03-03 14:43:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1344 states have (on average 1.2849702380952381) internal successors, (1727), 1367 states have internal predecessors, (1727), 192 states have call successors, (192), 133 states have call predecessors, (192), 172 states have return successors, (252), 210 states have call predecessors, (252), 190 states have call successors, (252) [2025-03-03 14:43:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2171 transitions. [2025-03-03 14:43:30,827 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2171 transitions. Word has length 91 [2025-03-03 14:43:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:30,827 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2171 transitions. [2025-03-03 14:43:30,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:43:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2171 transitions. [2025-03-03 14:43:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:43:30,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:30,829 INFO L218 NwaCegarLoop]: trace histogram [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 14:43:30,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:43:30,829 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:30,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 761180728, now seen corresponding path program 1 times [2025-03-03 14:43:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:30,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787390931] [2025-03-03 14:43:30,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:30,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:43:30,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:43:30,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:30,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:43:30,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:30,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787390931] [2025-03-03 14:43:30,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787390931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:30,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:30,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:43:30,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277212103] [2025-03-03 14:43:30,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:30,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:43:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:30,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:43:30,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:43:30,955 INFO L87 Difference]: Start difference. First operand 1709 states and 2171 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:31,288 INFO L93 Difference]: Finished difference Result 3157 states and 4010 transitions. [2025-03-03 14:43:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:43:31,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2025-03-03 14:43:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:31,295 INFO L225 Difference]: With dead ends: 3157 [2025-03-03 14:43:31,296 INFO L226 Difference]: Without dead ends: 1697 [2025-03-03 14:43:31,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:43:31,299 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 257 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:31,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 499 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:43:31,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-03-03 14:43:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1487. [2025-03-03 14:43:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1175 states have (on average 1.283404255319149) internal successors, (1508), 1193 states have internal predecessors, (1508), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2025-03-03 14:43:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1884 transitions. [2025-03-03 14:43:31,375 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1884 transitions. Word has length 91 [2025-03-03 14:43:31,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:31,376 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 1884 transitions. [2025-03-03 14:43:31,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1884 transitions. [2025-03-03 14:43:31,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:43:31,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:31,377 INFO L218 NwaCegarLoop]: trace histogram [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 14:43:31,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:43:31,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:31,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 753421369, now seen corresponding path program 1 times [2025-03-03 14:43:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888010123] [2025-03-03 14:43:31,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:31,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:31,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:43:31,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:43:31,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:31,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:43:31,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:31,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888010123] [2025-03-03 14:43:31,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888010123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:31,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:43:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424255412] [2025-03-03 14:43:31,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:31,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:43:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:31,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:43:31,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:43:31,434 INFO L87 Difference]: Start difference. First operand 1487 states and 1884 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 14:43:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:31,716 INFO L93 Difference]: Finished difference Result 4439 states and 5714 transitions. [2025-03-03 14:43:31,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:43:31,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2025-03-03 14:43:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:31,731 INFO L225 Difference]: With dead ends: 4439 [2025-03-03 14:43:31,731 INFO L226 Difference]: Without dead ends: 2963 [2025-03-03 14:43:31,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:43:31,736 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 184 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:31,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 246 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:43:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2025-03-03 14:43:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2963. [2025-03-03 14:43:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 2331 states have (on average 1.2625482625482625) internal successors, (2943), 2378 states have internal predecessors, (2943), 325 states have call successors, (325), 227 states have call predecessors, (325), 306 states have return successors, (495), 359 states have call predecessors, (495), 323 states have call successors, (495) [2025-03-03 14:43:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 3763 transitions. [2025-03-03 14:43:31,898 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 3763 transitions. Word has length 91 [2025-03-03 14:43:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:31,898 INFO L471 AbstractCegarLoop]: Abstraction has 2963 states and 3763 transitions. [2025-03-03 14:43:31,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 14:43:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 3763 transitions. [2025-03-03 14:43:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:43:31,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:31,901 INFO L218 NwaCegarLoop]: trace histogram [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 14:43:31,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:43:31,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:31,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1536800344, now seen corresponding path program 1 times [2025-03-03 14:43:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:31,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112920455] [2025-03-03 14:43:31,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:31,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:31,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:43:31,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:43:31,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:31,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:43:31,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:31,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112920455] [2025-03-03 14:43:31,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112920455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:31,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:31,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:43:31,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565052627] [2025-03-03 14:43:31,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:31,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:43:31,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:31,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:43:31,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:43:31,929 INFO L87 Difference]: Start difference. First operand 2963 states and 3763 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:31,994 INFO L93 Difference]: Finished difference Result 4439 states and 5594 transitions. [2025-03-03 14:43:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:43:31,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2025-03-03 14:43:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:32,003 INFO L225 Difference]: With dead ends: 4439 [2025-03-03 14:43:32,003 INFO L226 Difference]: Without dead ends: 1487 [2025-03-03 14:43:32,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:43:32,011 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:32,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:43:32,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2025-03-03 14:43:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1487. [2025-03-03 14:43:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1175 states have (on average 1.2519148936170212) internal successors, (1471), 1193 states have internal predecessors, (1471), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2025-03-03 14:43:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1847 transitions. [2025-03-03 14:43:32,099 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1847 transitions. Word has length 91 [2025-03-03 14:43:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:32,099 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 1847 transitions. [2025-03-03 14:43:32,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:43:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1847 transitions. [2025-03-03 14:43:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:43:32,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:32,100 INFO L218 NwaCegarLoop]: trace histogram [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 14:43:32,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:43:32,100 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:32,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash -685987528, now seen corresponding path program 1 times [2025-03-03 14:43:32,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:32,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519543920] [2025-03-03 14:43:32,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:32,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:32,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:43:32,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:43:32,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:32,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:43:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519543920] [2025-03-03 14:43:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519543920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:43:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:43:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233015847] [2025-03-03 14:43:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:32,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:43:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:32,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:43:32,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:43:32,172 INFO L87 Difference]: Start difference. First operand 1487 states and 1847 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:43:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:32,734 INFO L93 Difference]: Finished difference Result 3836 states and 4828 transitions. [2025-03-03 14:43:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:43:32,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2025-03-03 14:43:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:32,744 INFO L225 Difference]: With dead ends: 3836 [2025-03-03 14:43:32,744 INFO L226 Difference]: Without dead ends: 2209 [2025-03-03 14:43:32,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:43:32,748 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 910 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:32,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 698 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:43:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2025-03-03 14:43:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 2088. [2025-03-03 14:43:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 1630 states have (on average 1.2269938650306749) internal successors, (2000), 1657 states have internal predecessors, (2000), 235 states have call successors, (235), 164 states have call predecessors, (235), 222 states have return successors, (317), 267 states have call predecessors, (317), 233 states have call successors, (317) [2025-03-03 14:43:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2552 transitions. [2025-03-03 14:43:32,851 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2552 transitions. Word has length 92 [2025-03-03 14:43:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:32,851 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2552 transitions. [2025-03-03 14:43:32,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:43:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2552 transitions. [2025-03-03 14:43:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:43:32,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:32,853 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:32,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:43:32,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:32,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1900396514, now seen corresponding path program 1 times [2025-03-03 14:43:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:32,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946483950] [2025-03-03 14:43:32,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:32,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:43:32,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:43:32,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:32,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 14:43:32,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946483950] [2025-03-03 14:43:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946483950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370945284] [2025-03-03 14:43:32,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:32,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:32,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:32,955 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 14:43:32,956 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 14:43:32,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:43:33,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:43:33,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:33,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:33,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:43:33,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:43:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:43:33,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:43:33,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370945284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:33,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:43:33,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:43:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501688940] [2025-03-03 14:43:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:33,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:43:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:33,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:43:33,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:43:33,171 INFO L87 Difference]: Start difference. First operand 2088 states and 2552 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:43:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:33,421 INFO L93 Difference]: Finished difference Result 6017 states and 7349 transitions. [2025-03-03 14:43:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:43:33,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2025-03-03 14:43:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:33,439 INFO L225 Difference]: With dead ends: 6017 [2025-03-03 14:43:33,439 INFO L226 Difference]: Without dead ends: 4017 [2025-03-03 14:43:33,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:43:33,446 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 61 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:33,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 274 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:43:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2025-03-03 14:43:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 3985. [2025-03-03 14:43:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3985 states, 3110 states have (on average 1.2157556270096463) internal successors, (3781), 3162 states have internal predecessors, (3781), 442 states have call successors, (442), 327 states have call predecessors, (442), 432 states have return successors, (580), 496 states have call predecessors, (580), 440 states have call successors, (580) [2025-03-03 14:43:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 4803 transitions. [2025-03-03 14:43:33,680 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 4803 transitions. Word has length 163 [2025-03-03 14:43:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:33,680 INFO L471 AbstractCegarLoop]: Abstraction has 3985 states and 4803 transitions. [2025-03-03 14:43:33,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:43:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 4803 transitions. [2025-03-03 14:43:33,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 14:43:33,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:33,682 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:33,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:43:33,883 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,SelfDestructingSolverStorable10 [2025-03-03 14:43:33,883 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:33,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash -382592285, now seen corresponding path program 1 times [2025-03-03 14:43:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:33,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831319837] [2025-03-03 14:43:33,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:33,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:43:33,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:43:33,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:33,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-03 14:43:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831319837] [2025-03-03 14:43:34,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831319837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791951376] [2025-03-03 14:43:34,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:34,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:34,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:34,030 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 14:43:34,032 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 14:43:34,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:43:34,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:43:34,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:34,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:34,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:43:34,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:43:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:43:34,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:43:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791951376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:34,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:43:34,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:43:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282423736] [2025-03-03 14:43:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:34,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:43:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:34,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:43:34,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:43:34,287 INFO L87 Difference]: Start difference. First operand 3985 states and 4803 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:43:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:34,543 INFO L93 Difference]: Finished difference Result 11933 states and 14379 transitions. [2025-03-03 14:43:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:43:34,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 195 [2025-03-03 14:43:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:34,581 INFO L225 Difference]: With dead ends: 11933 [2025-03-03 14:43:34,582 INFO L226 Difference]: Without dead ends: 7959 [2025-03-03 14:43:34,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:43:34,594 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 52 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:34,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 273 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:43:34,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states. [2025-03-03 14:43:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7949. [2025-03-03 14:43:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7949 states, 6206 states have (on average 1.2089912987431517) internal successors, (7503), 6308 states have internal predecessors, (7503), 878 states have call successors, (878), 653 states have call predecessors, (878), 864 states have return successors, (1156), 988 states have call predecessors, (1156), 876 states have call successors, (1156) [2025-03-03 14:43:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7949 states to 7949 states and 9537 transitions. [2025-03-03 14:43:34,991 INFO L78 Accepts]: Start accepts. Automaton has 7949 states and 9537 transitions. Word has length 195 [2025-03-03 14:43:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:34,992 INFO L471 AbstractCegarLoop]: Abstraction has 7949 states and 9537 transitions. [2025-03-03 14:43:34,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:43:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 7949 states and 9537 transitions. [2025-03-03 14:43:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 14:43:34,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:43:34,995 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:43:35,003 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 14:43:35,195 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,SelfDestructingSolverStorable11 [2025-03-03 14:43:35,196 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:43:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:43:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -831288924, now seen corresponding path program 1 times [2025-03-03 14:43:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:43:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246019411] [2025-03-03 14:43:35,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:43:35,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:43:35,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:43:35,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:35,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-03 14:43:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:43:35,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246019411] [2025-03-03 14:43:35,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246019411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:43:35,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727314351] [2025-03-03 14:43:35,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:43:35,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:35,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:43:35,374 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 14:43:35,375 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 14:43:35,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:43:35,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:43:35,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:43:35,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:43:35,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:43:35,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:43:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-03 14:43:35,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:43:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727314351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:43:35,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:43:35,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:43:35,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62987617] [2025-03-03 14:43:35,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:43:35,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:43:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:43:35,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:43:35,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:43:35,678 INFO L87 Difference]: Start difference. First operand 7949 states and 9537 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 14:43:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:43:36,095 INFO L93 Difference]: Finished difference Result 14477 states and 17703 transitions. [2025-03-03 14:43:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:43:36,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 195 [2025-03-03 14:43:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:43:36,105 INFO L225 Difference]: With dead ends: 14477 [2025-03-03 14:43:36,105 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:43:36,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:43:36,125 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:43:36,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:43:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:43:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:43:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:43:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:43:36,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2025-03-03 14:43:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:43:36,132 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:43:36,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 14:43:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:43:36,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:43:36,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:43:36,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:43:36,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:43:36,337 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:43:36,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:43:56,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:43:56,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:43:56 BoogieIcfgContainer [2025-03-03 14:43:56,387 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:43:56,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:43:56,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:43:56,387 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:43:56,390 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:43:26" (3/4) ... [2025-03-03 14:43:56,392 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:43:56,397 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure activate_threads [2025-03-03 14:43:56,397 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-03-03 14:43:56,397 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2025-03-03 14:43:56,397 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2025-03-03 14:43:56,397 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure update_channels [2025-03-03 14:43:56,397 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2025-03-03 14:43:56,397 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2025-03-03 14:43:56,397 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-03-03 14:43:56,405 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-03 14:43:56,405 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 14:43:56,405 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 14:43:56,406 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:43:56,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:43:56,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:43:56,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:43:56,485 INFO L158 Benchmark]: Toolchain (without parser) took 30476.97ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 105.2MB in the beginning and 604.7MB in the end (delta: -499.5MB). Peak memory consumption was 851.1MB. Max. memory is 16.1GB. [2025-03-03 14:43:56,485 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:43:56,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.84ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 90.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:43:56,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.48ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:43:56,486 INFO L158 Benchmark]: Boogie Preprocessor took 47.92ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 87.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:43:56,486 INFO L158 Benchmark]: IcfgBuilder took 414.25ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 67.5MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:43:56,487 INFO L158 Benchmark]: TraceAbstraction took 29648.17ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 66.5MB in the beginning and 612.6MB in the end (delta: -546.2MB). Peak memory consumption was 875.5MB. Max. memory is 16.1GB. [2025-03-03 14:43:56,487 INFO L158 Benchmark]: Witness Printer took 97.29ms. Allocated memory is still 1.5GB. Free memory was 612.6MB in the beginning and 604.7MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:43:56,488 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.84ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 90.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.48ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.92ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 87.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 414.25ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 67.5MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29648.17ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 66.5MB in the beginning and 612.6MB in the end (delta: -546.2MB). Peak memory consumption was 875.5MB. Max. memory is 16.1GB. * Witness Printer took 97.29ms. Allocated memory is still 1.5GB. Free memory was 612.6MB in the beginning and 604.7MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4737 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4659 mSDsluCounter, 6939 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4940 mSDsCounter, 1011 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3662 IncrementalHoareTripleChecker+Invalid, 4673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1011 mSolverCounterUnsat, 1999 mSDtfsCounter, 3662 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 727 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7949occurred in iteration=12, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 549 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1884 NumberOfCodeBlocks, 1884 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1868 ConstructedInterpolants, 0 QuantifiedInterpolants, 3200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1587 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 853/889 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 164]: Location Invariant Derived location invariant: (((((c_dr_pc == 1) && (p_dw_pc != 1)) || (((((c_dr_st == 0) && (q_req_up == 1)) && (p_dw_st != 0)) && (1 == c_dr_i)) && (c_dr_pc <= 0))) || ((q_req_up == 1) && (c_dr_pc == 1))) || (((((c_dr_st == 0) && (p_dw_st != 0)) && (1 == c_dr_i)) && (p_dw_pc != 1)) && (c_dr_pc <= 0))) - InvariantResult [Line: 491]: Location Invariant Derived location invariant: ((((c_dr_st == 0) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) - InvariantResult [Line: 410]: Location Invariant Derived location invariant: ((((c_dr_st == 0) && (1 == c_dr_i)) && (c_dr_pc <= 0)) || (c_dr_pc == 1)) RESULT: Ultimate proved your program to be correct! [2025-03-03 14:43:56,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE