./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39b635cc2ab0f0d4f8e606a07f9fc2cea48a2218c52549f8b5aa54058d2e5b4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:33:41,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:33:41,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:33:41,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:33:41,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:33:41,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:33:41,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:33:41,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:33:41,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:33:41,919 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:33:41,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:33:41,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:33:41,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:33:41,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:33:41,920 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:33:41,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:33:41,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:33:41,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:33:41,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:33:41,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:33:41,922 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 -> 39b635cc2ab0f0d4f8e606a07f9fc2cea48a2218c52549f8b5aa54058d2e5b4b [2025-03-08 07:33:42,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:33:42,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:33:42,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:33:42,180 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:33:42,180 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:33:42,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c [2025-03-08 07:33:43,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8058549ee/e4dbcc5d24134b6da1c24c4efa9314e6/FLAG75aa8250c [2025-03-08 07:33:43,597 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:33:43,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c [2025-03-08 07:33:43,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8058549ee/e4dbcc5d24134b6da1c24c4efa9314e6/FLAG75aa8250c [2025-03-08 07:33:43,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8058549ee/e4dbcc5d24134b6da1c24c4efa9314e6 [2025-03-08 07:33:43,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:33:43,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:33:43,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:33:43,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:33:43,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:33:43,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:33:43" (1/1) ... [2025-03-08 07:33:43,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:43, skipping insertion in model container [2025-03-08 07:33:43,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:33:43" (1/1) ... [2025-03-08 07:33:43,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:33:44,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c[914,927] [2025-03-08 07:33:44,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c[7115,7128] [2025-03-08 07:33:44,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:33:44,185 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:33:44,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c[914,927] [2025-03-08 07:33:44,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-2.c[7115,7128] [2025-03-08 07:33:44,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:33:44,260 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:33:44,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44 WrapperNode [2025-03-08 07:33:44,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:33:44,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:33:44,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:33:44,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:33:44,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,304 INFO L138 Inliner]: procedures = 71, calls = 85, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 846 [2025-03-08 07:33:44,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:33:44,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:33:44,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:33:44,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:33:44,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,331 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-08 07:33:44,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:33:44,355 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:33:44,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:33:44,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:33:44,357 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (1/1) ... [2025-03-08 07:33:44,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:33:44,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:44,387 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-08 07:33:44,393 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-08 07:33:44,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:33:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:33:44,410 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:33:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:33:44,410 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:33:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:33:44,410 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:33:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:33:44,410 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:33:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:33:44,411 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:33:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:33:44,411 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:33:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:33:44,411 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:33:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:33:44,411 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:33:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:33:44,411 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:33:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:33:44,411 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:33:44,411 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:33:44,412 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:33:44,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:33:44,412 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:33:44,412 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:33:44,412 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:33:44,412 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:33:44,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:33:44,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:33:44,413 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:33:44,413 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:33:44,413 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-08 07:33:44,413 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-08 07:33:44,500 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:33:44,502 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:33:45,237 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-03-08 07:33:45,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:33:45,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:33:45,250 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:33:45,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:33:45 BoogieIcfgContainer [2025-03-08 07:33:45,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:33:45,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:33:45,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:33:45,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:33:45,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:33:43" (1/3) ... [2025-03-08 07:33:45,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7356eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:33:45, skipping insertion in model container [2025-03-08 07:33:45,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:44" (2/3) ... [2025-03-08 07:33:45,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7356eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:33:45, skipping insertion in model container [2025-03-08 07:33:45,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:33:45" (3/3) ... [2025-03-08 07:33:45,261 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.09.cil-2.c [2025-03-08 07:33:45,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:33:45,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.09.cil-2.c that has 16 procedures, 410 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-08 07:33:45,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:33:45,351 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;@2a744e0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:33:45,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:33:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 355 states have (on average 1.5887323943661973) internal successors, (564), 361 states have internal predecessors, (564), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 07:33:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:45,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:45,365 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] [2025-03-08 07:33:45,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:45,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1351177406, now seen corresponding path program 1 times [2025-03-08 07:33:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:45,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675739685] [2025-03-08 07:33:45,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:45,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:45,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:45,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:45,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:45,733 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-08 07:33:45,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:45,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675739685] [2025-03-08 07:33:45,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675739685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:45,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:45,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:45,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303704103] [2025-03-08 07:33:45,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:45,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:45,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:45,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:45,760 INFO L87 Difference]: Start difference. First operand has 410 states, 355 states have (on average 1.5887323943661973) internal successors, (564), 361 states have internal predecessors, (564), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:33:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:46,482 INFO L93 Difference]: Finished difference Result 893 states and 1394 transitions. [2025-03-08 07:33:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:46,492 INFO L225 Difference]: With dead ends: 893 [2025-03-08 07:33:46,493 INFO L226 Difference]: Without dead ends: 498 [2025-03-08 07:33:46,496 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-08 07:33:46,499 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 417 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:46,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1315 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-08 07:33:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 491. [2025-03-08 07:33:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 417 states have (on average 1.5275779376498801) internal successors, (637), 424 states have internal predecessors, (637), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2025-03-08 07:33:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 738 transitions. [2025-03-08 07:33:46,568 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 738 transitions. Word has length 62 [2025-03-08 07:33:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:46,569 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 738 transitions. [2025-03-08 07:33:46,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:33:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 738 transitions. [2025-03-08 07:33:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:46,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:46,572 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] [2025-03-08 07:33:46,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:33:46,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:46,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 334121253, now seen corresponding path program 1 times [2025-03-08 07:33:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:46,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773469475] [2025-03-08 07:33:46,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:46,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:46,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:46,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:46,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:46,754 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-08 07:33:46,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:46,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773469475] [2025-03-08 07:33:46,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773469475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:46,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:46,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:46,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842433340] [2025-03-08 07:33:46,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:46,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:46,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:46,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:46,759 INFO L87 Difference]: Start difference. First operand 491 states and 738 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-08 07:33:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:47,460 INFO L93 Difference]: Finished difference Result 796 states and 1157 transitions. [2025-03-08 07:33:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:47,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:47,468 INFO L225 Difference]: With dead ends: 796 [2025-03-08 07:33:47,469 INFO L226 Difference]: Without dead ends: 627 [2025-03-08 07:33:47,470 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-08 07:33:47,472 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 904 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:47,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 1491 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:47,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-08 07:33:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 583. [2025-03-08 07:33:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 489 states have (on average 1.507157464212679) internal successors, (737), 498 states have internal predecessors, (737), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2025-03-08 07:33:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 868 transitions. [2025-03-08 07:33:47,507 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 868 transitions. Word has length 62 [2025-03-08 07:33:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:47,507 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 868 transitions. [2025-03-08 07:33:47,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-08 07:33:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 868 transitions. [2025-03-08 07:33:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:47,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:47,509 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] [2025-03-08 07:33:47,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:33:47,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:47,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1303702276, now seen corresponding path program 1 times [2025-03-08 07:33:47,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:47,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967173982] [2025-03-08 07:33:47,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:47,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:47,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:47,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:47,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:47,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:47,604 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-08 07:33:47,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:47,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967173982] [2025-03-08 07:33:47,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967173982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:47,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:47,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870150913] [2025-03-08 07:33:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:47,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:47,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:47,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:47,607 INFO L87 Difference]: Start difference. First operand 583 states and 868 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-08 07:33:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:47,650 INFO L93 Difference]: Finished difference Result 843 states and 1229 transitions. [2025-03-08 07:33:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 62 [2025-03-08 07:33:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:47,654 INFO L225 Difference]: With dead ends: 843 [2025-03-08 07:33:47,654 INFO L226 Difference]: Without dead ends: 588 [2025-03-08 07:33:47,655 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-08 07:33:47,656 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3030 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-08 07:33:47,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3030 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-08 07:33:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2025-03-08 07:33:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 493 states have (on average 1.4989858012170385) internal successors, (739), 502 states have internal predecessors, (739), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2025-03-08 07:33:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 871 transitions. [2025-03-08 07:33:47,687 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 871 transitions. Word has length 62 [2025-03-08 07:33:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:47,687 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 871 transitions. [2025-03-08 07:33:47,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-08 07:33:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 871 transitions. [2025-03-08 07:33:47,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:47,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:47,689 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] [2025-03-08 07:33:47,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:33:47,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:47,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:47,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1265784123, now seen corresponding path program 1 times [2025-03-08 07:33:47,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:47,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175168849] [2025-03-08 07:33:47,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:47,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:47,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:47,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:47,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:47,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:47,788 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-08 07:33:47,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:47,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175168849] [2025-03-08 07:33:47,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175168849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:47,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:47,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:33:47,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737100599] [2025-03-08 07:33:47,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:47,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:33:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:47,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:33:47,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:33:47,792 INFO L87 Difference]: Start difference. First operand 588 states and 871 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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-08 07:33:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:48,891 INFO L93 Difference]: Finished difference Result 1770 states and 2507 transitions. [2025-03-08 07:33:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:33:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:48,899 INFO L225 Difference]: With dead ends: 1770 [2025-03-08 07:33:48,900 INFO L226 Difference]: Without dead ends: 1492 [2025-03-08 07:33:48,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:33:48,902 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 2672 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2686 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:48,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2686 Valid, 1636 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:33:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-03-08 07:33:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1444. [2025-03-08 07:33:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1163 states have (on average 1.404127257093723) internal successors, (1633), 1187 states have internal predecessors, (1633), 149 states have call successors, (149), 112 states have call predecessors, (149), 130 states have return successors, (185), 147 states have call predecessors, (185), 145 states have call successors, (185) [2025-03-08 07:33:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1967 transitions. [2025-03-08 07:33:48,983 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1967 transitions. Word has length 62 [2025-03-08 07:33:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:48,984 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1967 transitions. [2025-03-08 07:33:48,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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-08 07:33:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1967 transitions. [2025-03-08 07:33:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:48,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:48,985 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] [2025-03-08 07:33:48,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:33:48,985 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:48,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:48,986 INFO L85 PathProgramCache]: Analyzing trace with hash 317479458, now seen corresponding path program 1 times [2025-03-08 07:33:48,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:48,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703464207] [2025-03-08 07:33:48,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:48,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:48,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:49,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:49,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:49,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:49,059 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-08 07:33:49,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:49,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703464207] [2025-03-08 07:33:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703464207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:49,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330875756] [2025-03-08 07:33:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:49,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:49,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:49,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:49,060 INFO L87 Difference]: Start difference. First operand 1444 states and 1967 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-08 07:33:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:49,128 INFO L93 Difference]: Finished difference Result 2602 states and 3488 transitions. [2025-03-08 07:33:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:49,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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 62 [2025-03-08 07:33:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:49,137 INFO L225 Difference]: With dead ends: 2602 [2025-03-08 07:33:49,138 INFO L226 Difference]: Without dead ends: 1474 [2025-03-08 07:33:49,140 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-08 07:33:49,141 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3030 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-08 07:33:49,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3030 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2025-03-08 07:33:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2025-03-08 07:33:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1187 states have (on average 1.3892165122156697) internal successors, (1649), 1211 states have internal predecessors, (1649), 149 states have call successors, (149), 112 states have call predecessors, (149), 136 states have return successors, (191), 153 states have call predecessors, (191), 145 states have call successors, (191) [2025-03-08 07:33:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1989 transitions. [2025-03-08 07:33:49,219 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1989 transitions. Word has length 62 [2025-03-08 07:33:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:49,220 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 1989 transitions. [2025-03-08 07:33:49,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (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-08 07:33:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1989 transitions. [2025-03-08 07:33:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:49,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:49,221 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] [2025-03-08 07:33:49,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:33:49,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:49,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash 348499265, now seen corresponding path program 1 times [2025-03-08 07:33:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:49,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414278606] [2025-03-08 07:33:49,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:49,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:49,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:49,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:49,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:49,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:49,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:49,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414278606] [2025-03-08 07:33:49,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414278606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:49,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:49,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499521755] [2025-03-08 07:33:49,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:49,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:49,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:49,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:49,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:49,376 INFO L87 Difference]: Start difference. First operand 1474 states and 1989 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-08 07:33:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:50,051 INFO L93 Difference]: Finished difference Result 2646 states and 3445 transitions. [2025-03-08 07:33:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:33:50,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:50,059 INFO L225 Difference]: With dead ends: 2646 [2025-03-08 07:33:50,059 INFO L226 Difference]: Without dead ends: 1700 [2025-03-08 07:33:50,061 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-08 07:33:50,062 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 889 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:50,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1297 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2025-03-08 07:33:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1419. [2025-03-08 07:33:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1148 states have (on average 1.3858885017421603) internal successors, (1591), 1167 states have internal predecessors, (1591), 143 states have call successors, (143), 107 states have call predecessors, (143), 126 states have return successors, (176), 146 states have call predecessors, (176), 139 states have call successors, (176) [2025-03-08 07:33:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1910 transitions. [2025-03-08 07:33:50,138 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1910 transitions. Word has length 62 [2025-03-08 07:33:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:50,138 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 1910 transitions. [2025-03-08 07:33:50,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-08 07:33:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1910 transitions. [2025-03-08 07:33:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:50,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:50,139 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] [2025-03-08 07:33:50,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:33:50,139 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:50,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash 559850178, now seen corresponding path program 1 times [2025-03-08 07:33:50,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:50,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718774856] [2025-03-08 07:33:50,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:50,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:50,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:50,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:50,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:50,196 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-08 07:33:50,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:50,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718774856] [2025-03-08 07:33:50,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718774856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:50,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:50,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:33:50,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314550740] [2025-03-08 07:33:50,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:50,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:33:50,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:50,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:33:50,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:33:50,198 INFO L87 Difference]: Start difference. First operand 1419 states and 1910 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:50,622 INFO L93 Difference]: Finished difference Result 3550 states and 4649 transitions. [2025-03-08 07:33:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:33:50,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:33:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:50,633 INFO L225 Difference]: With dead ends: 3550 [2025-03-08 07:33:50,633 INFO L226 Difference]: Without dead ends: 2448 [2025-03-08 07:33:50,636 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-08 07:33:50,637 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 850 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:50,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 660 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:33:50,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2025-03-08 07:33:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2444. [2025-03-08 07:33:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1930 states have (on average 1.3186528497409327) internal successors, (2545), 1966 states have internal predecessors, (2545), 262 states have call successors, (262), 206 states have call predecessors, (262), 250 states have return successors, (367), 274 states have call predecessors, (367), 258 states have call successors, (367) [2025-03-08 07:33:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3174 transitions. [2025-03-08 07:33:50,756 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3174 transitions. Word has length 62 [2025-03-08 07:33:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:50,757 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 3174 transitions. [2025-03-08 07:33:50,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3174 transitions. [2025-03-08 07:33:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:33:50,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:50,758 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] [2025-03-08 07:33:50,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:33:50,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:50,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:50,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1636784924, now seen corresponding path program 1 times [2025-03-08 07:33:50,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:50,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582648178] [2025-03-08 07:33:50,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:50,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:50,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:33:50,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:33:50,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:50,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:50,801 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-08 07:33:50,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582648178] [2025-03-08 07:33:50,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582648178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:50,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:50,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:50,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17582897] [2025-03-08 07:33:50,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:50,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:50,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:50,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:50,803 INFO L87 Difference]: Start difference. First operand 2444 states and 3174 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:50,991 INFO L93 Difference]: Finished difference Result 5428 states and 6959 transitions. [2025-03-08 07:33:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:50,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-08 07:33:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:51,005 INFO L225 Difference]: With dead ends: 5428 [2025-03-08 07:33:51,005 INFO L226 Difference]: Without dead ends: 3306 [2025-03-08 07:33:51,010 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-08 07:33:51,010 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 101 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:51,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1187 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2025-03-08 07:33:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3238. [2025-03-08 07:33:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 2538 states have (on average 1.3002364066193854) internal successors, (3300), 2579 states have internal predecessors, (3300), 354 states have call successors, (354), 286 states have call predecessors, (354), 344 states have return successors, (481), 375 states have call predecessors, (481), 350 states have call successors, (481) [2025-03-08 07:33:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4135 transitions. [2025-03-08 07:33:51,170 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4135 transitions. Word has length 63 [2025-03-08 07:33:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:51,170 INFO L471 AbstractCegarLoop]: Abstraction has 3238 states and 4135 transitions. [2025-03-08 07:33:51,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4135 transitions. [2025-03-08 07:33:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:33:51,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:51,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:51,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:33:51,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:51,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:51,172 INFO L85 PathProgramCache]: Analyzing trace with hash -399946472, now seen corresponding path program 1 times [2025-03-08 07:33:51,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:51,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060175164] [2025-03-08 07:33:51,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:51,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:51,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:33:51,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:33:51,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:51,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:51,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060175164] [2025-03-08 07:33:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060175164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:51,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:33:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269243509] [2025-03-08 07:33:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:51,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:33:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:51,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:33:51,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:33:51,253 INFO L87 Difference]: Start difference. First operand 3238 states and 4135 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:51,558 INFO L93 Difference]: Finished difference Result 4163 states and 5253 transitions. [2025-03-08 07:33:51,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:33:51,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-03-08 07:33:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:51,575 INFO L225 Difference]: With dead ends: 4163 [2025-03-08 07:33:51,576 INFO L226 Difference]: Without dead ends: 4160 [2025-03-08 07:33:51,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 07:33:51,579 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 1128 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:51,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 711 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:33:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4160 states. [2025-03-08 07:33:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4160 to 3688. [2025-03-08 07:33:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 2881 states have (on average 1.2877473099618189) internal successors, (3710), 2925 states have internal predecessors, (3710), 404 states have call successors, (404), 330 states have call predecessors, (404), 401 states have return successors, (558), 435 states have call predecessors, (558), 401 states have call successors, (558) [2025-03-08 07:33:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4672 transitions. [2025-03-08 07:33:51,788 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4672 transitions. Word has length 68 [2025-03-08 07:33:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:51,788 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4672 transitions. [2025-03-08 07:33:51,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4672 transitions. [2025-03-08 07:33:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:33:51,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:51,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:51,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:33:51,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:51,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash 486051872, now seen corresponding path program 1 times [2025-03-08 07:33:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:51,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438148234] [2025-03-08 07:33:51,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:51,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:33:51,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:33:51,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:51,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:51,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:51,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438148234] [2025-03-08 07:33:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438148234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:51,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399416328] [2025-03-08 07:33:51,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:51,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:51,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:51,895 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-08 07:33:51,896 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-08 07:33:51,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:33:51,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:33:51,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:51,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:51,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:33:51,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:52,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:33:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399416328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:33:52,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:33:52,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-08 07:33:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727907214] [2025-03-08 07:33:52,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:33:52,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:33:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:52,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:33:52,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:52,328 INFO L87 Difference]: Start difference. First operand 3688 states and 4672 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 07:33:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:53,095 INFO L93 Difference]: Finished difference Result 7512 states and 9348 transitions. [2025-03-08 07:33:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:33:53,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 69 [2025-03-08 07:33:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:53,129 INFO L225 Difference]: With dead ends: 7512 [2025-03-08 07:33:53,129 INFO L226 Difference]: Without dead ends: 7509 [2025-03-08 07:33:53,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:53,135 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1361 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:53,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 2881 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:33:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7509 states. [2025-03-08 07:33:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7509 to 7128. [2025-03-08 07:33:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7128 states, 5543 states have (on average 1.2628540501533465) internal successors, (7000), 5622 states have internal predecessors, (7000), 781 states have call successors, (781), 660 states have call predecessors, (781), 802 states have return successors, (1083), 848 states have call predecessors, (1083), 778 states have call successors, (1083) [2025-03-08 07:33:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7128 states to 7128 states and 8864 transitions. [2025-03-08 07:33:53,734 INFO L78 Accepts]: Start accepts. Automaton has 7128 states and 8864 transitions. Word has length 69 [2025-03-08 07:33:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:53,734 INFO L471 AbstractCegarLoop]: Abstraction has 7128 states and 8864 transitions. [2025-03-08 07:33:53,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 07:33:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7128 states and 8864 transitions. [2025-03-08 07:33:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:33:53,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:53,740 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-08 07:33:53,747 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-08 07:33:53,940 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,SelfDestructingSolverStorable9 [2025-03-08 07:33:53,941 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:53,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1205608573, now seen corresponding path program 2 times [2025-03-08 07:33:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:53,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798426042] [2025-03-08 07:33:53,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:33:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:53,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 07:33:53,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 07:33:53,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:33:53,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:53,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:53,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798426042] [2025-03-08 07:33:53,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798426042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:53,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:53,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:53,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868986383] [2025-03-08 07:33:53,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:53,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:53,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:53,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:53,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:53,984 INFO L87 Difference]: Start difference. First operand 7128 states and 8864 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:54,184 INFO L93 Difference]: Finished difference Result 9423 states and 11757 transitions. [2025-03-08 07:33:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:54,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-03-08 07:33:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:54,210 INFO L225 Difference]: With dead ends: 9423 [2025-03-08 07:33:54,211 INFO L226 Difference]: Without dead ends: 3487 [2025-03-08 07:33:54,223 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-08 07:33:54,224 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 579 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:54,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 795 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2025-03-08 07:33:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 2756. [2025-03-08 07:33:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2173 states have (on average 1.2761159687068568) internal successors, (2773), 2198 states have internal predecessors, (2773), 302 states have call successors, (302), 244 states have call predecessors, (302), 279 states have return successors, (385), 316 states have call predecessors, (385), 299 states have call successors, (385) [2025-03-08 07:33:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3460 transitions. [2025-03-08 07:33:54,377 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3460 transitions. Word has length 71 [2025-03-08 07:33:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:54,378 INFO L471 AbstractCegarLoop]: Abstraction has 2756 states and 3460 transitions. [2025-03-08 07:33:54,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3460 transitions. [2025-03-08 07:33:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:33:54,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:54,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:54,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:33:54,380 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1298983615, now seen corresponding path program 1 times [2025-03-08 07:33:54,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:54,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829705826] [2025-03-08 07:33:54,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:54,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:54,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:33:54,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:33:54,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:54,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:33:54,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:54,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829705826] [2025-03-08 07:33:54,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829705826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:54,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:54,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763652418] [2025-03-08 07:33:54,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:54,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:54,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:54,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:54,477 INFO L87 Difference]: Start difference. First operand 2756 states and 3460 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:55,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:55,426 INFO L93 Difference]: Finished difference Result 7676 states and 9473 transitions. [2025-03-08 07:33:55,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 07:33:55,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-03-08 07:33:55,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:55,443 INFO L225 Difference]: With dead ends: 7676 [2025-03-08 07:33:55,443 INFO L226 Difference]: Without dead ends: 4488 [2025-03-08 07:33:55,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:33:55,452 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 771 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:55,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1665 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:33:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4488 states. [2025-03-08 07:33:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4488 to 4311. [2025-03-08 07:33:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4311 states, 3358 states have (on average 1.2376414532459799) internal successors, (4156), 3413 states have internal predecessors, (4156), 477 states have call successors, (477), 398 states have call predecessors, (477), 474 states have return successors, (675), 502 states have call predecessors, (675), 474 states have call successors, (675) [2025-03-08 07:33:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5308 transitions. [2025-03-08 07:33:55,812 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5308 transitions. Word has length 80 [2025-03-08 07:33:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:55,812 INFO L471 AbstractCegarLoop]: Abstraction has 4311 states and 5308 transitions. [2025-03-08 07:33:55,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5308 transitions. [2025-03-08 07:33:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:33:55,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:55,815 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] [2025-03-08 07:33:55,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:33:55,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:55,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1243274480, now seen corresponding path program 1 times [2025-03-08 07:33:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:55,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432664548] [2025-03-08 07:33:55,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:55,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:33:55,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:33:55,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:55,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 07:33:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432664548] [2025-03-08 07:33:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432664548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:55,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:33:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035760540] [2025-03-08 07:33:55,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:55,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:33:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:55,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:33:55,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:55,916 INFO L87 Difference]: Start difference. First operand 4311 states and 5308 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-08 07:33:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:56,890 INFO L93 Difference]: Finished difference Result 7258 states and 8883 transitions. [2025-03-08 07:33:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:33:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 86 [2025-03-08 07:33:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:56,903 INFO L225 Difference]: With dead ends: 7258 [2025-03-08 07:33:56,903 INFO L226 Difference]: Without dead ends: 3480 [2025-03-08 07:33:56,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:33:56,909 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 1502 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:56,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1738 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:33:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2025-03-08 07:33:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3159. [2025-03-08 07:33:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3159 states, 2464 states have (on average 1.229301948051948) internal successors, (3029), 2506 states have internal predecessors, (3029), 346 states have call successors, (346), 281 states have call predecessors, (346), 347 states have return successors, (464), 374 states have call predecessors, (464), 343 states have call successors, (464) [2025-03-08 07:33:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 3839 transitions. [2025-03-08 07:33:57,076 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 3839 transitions. Word has length 86 [2025-03-08 07:33:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:57,077 INFO L471 AbstractCegarLoop]: Abstraction has 3159 states and 3839 transitions. [2025-03-08 07:33:57,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-08 07:33:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 3839 transitions. [2025-03-08 07:33:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 07:33:57,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:57,080 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:33:57,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:33:57,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:57,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2045152847, now seen corresponding path program 1 times [2025-03-08 07:33:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:57,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155640908] [2025-03-08 07:33:57,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:57,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:57,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:33:57,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:33:57,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:57,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 07:33:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155640908] [2025-03-08 07:33:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155640908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830168706] [2025-03-08 07:33:57,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:57,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:57,206 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-08 07:33:57,208 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-08 07:33:57,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:33:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:33:57,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:57,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:57,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 07:33:57,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:33:57,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:33:57,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830168706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:57,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:33:57,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 07:33:57,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599343896] [2025-03-08 07:33:57,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:57,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:57,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:57,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:57,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:33:57,360 INFO L87 Difference]: Start difference. First operand 3159 states and 3839 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:33:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:57,447 INFO L93 Difference]: Finished difference Result 4637 states and 5603 transitions. [2025-03-08 07:33:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:57,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-03-08 07:33:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:57,460 INFO L225 Difference]: With dead ends: 4637 [2025-03-08 07:33:57,461 INFO L226 Difference]: Without dead ends: 1800 [2025-03-08 07:33:57,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:33:57,466 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 0 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:57,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3011 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-03-08 07:33:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1787. [2025-03-08 07:33:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1453 states have (on average 1.2601514108740537) internal successors, (1831), 1468 states have internal predecessors, (1831), 170 states have call successors, (170), 126 states have call predecessors, (170), 162 states have return successors, (226), 193 states have call predecessors, (226), 167 states have call successors, (226) [2025-03-08 07:33:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2227 transitions. [2025-03-08 07:33:57,571 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2227 transitions. Word has length 139 [2025-03-08 07:33:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:57,571 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2227 transitions. [2025-03-08 07:33:57,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:33:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2227 transitions. [2025-03-08 07:33:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 07:33:57,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:57,574 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:33:57,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:33:57,774 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,SelfDestructingSolverStorable13 [2025-03-08 07:33:57,775 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:57,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash 289569209, now seen corresponding path program 1 times [2025-03-08 07:33:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373774422] [2025-03-08 07:33:57,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:57,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 07:33:57,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 07:33:57,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:57,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 07:33:57,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:57,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373774422] [2025-03-08 07:33:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373774422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:57,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:57,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:57,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335960350] [2025-03-08 07:33:57,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:57,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:57,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:57,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:57,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:57,811 INFO L87 Difference]: Start difference. First operand 1787 states and 2227 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 07:33:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:57,873 INFO L93 Difference]: Finished difference Result 2931 states and 3595 transitions. [2025-03-08 07:33:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:57,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 141 [2025-03-08 07:33:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:57,880 INFO L225 Difference]: With dead ends: 2931 [2025-03-08 07:33:57,880 INFO L226 Difference]: Without dead ends: 1635 [2025-03-08 07:33:57,882 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-08 07:33:57,882 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 119 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1087 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-08 07:33:57,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1087 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2025-03-08 07:33:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2025-03-08 07:33:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1337 states have (on average 1.2737471952131638) internal successors, (1703), 1352 states have internal predecessors, (1703), 152 states have call successors, (152), 110 states have call predecessors, (152), 144 states have return successors, (203), 173 states have call predecessors, (203), 149 states have call successors, (203) [2025-03-08 07:33:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2058 transitions. [2025-03-08 07:33:57,955 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2058 transitions. Word has length 141 [2025-03-08 07:33:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:57,955 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2058 transitions. [2025-03-08 07:33:57,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 07:33:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2058 transitions. [2025-03-08 07:33:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 07:33:57,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:57,958 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:33:57,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:33:57,958 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:57,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:57,958 INFO L85 PathProgramCache]: Analyzing trace with hash -413091896, now seen corresponding path program 1 times [2025-03-08 07:33:57,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:57,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616246832] [2025-03-08 07:33:57,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:57,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 07:33:57,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 07:33:57,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:57,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 07:33:58,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616246832] [2025-03-08 07:33:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616246832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:58,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:58,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122064558] [2025-03-08 07:33:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:58,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:58,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:58,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:58,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:58,022 INFO L87 Difference]: Start difference. First operand 1635 states and 2058 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 07:33:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:58,531 INFO L93 Difference]: Finished difference Result 2830 states and 3486 transitions. [2025-03-08 07:33:58,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:58,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 150 [2025-03-08 07:33:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:58,538 INFO L225 Difference]: With dead ends: 2830 [2025-03-08 07:33:58,538 INFO L226 Difference]: Without dead ends: 1585 [2025-03-08 07:33:58,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:58,541 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 303 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:58,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1266 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-03-08 07:33:58,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1495. [2025-03-08 07:33:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1225 states have (on average 1.2889795918367346) internal successors, (1579), 1239 states have internal predecessors, (1579), 138 states have call successors, (138), 98 states have call predecessors, (138), 130 states have return successors, (183), 158 states have call predecessors, (183), 135 states have call successors, (183) [2025-03-08 07:33:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1900 transitions. [2025-03-08 07:33:58,610 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1900 transitions. Word has length 150 [2025-03-08 07:33:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:58,610 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 1900 transitions. [2025-03-08 07:33:58,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 07:33:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1900 transitions. [2025-03-08 07:33:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 07:33:58,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:58,613 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:33:58,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:33:58,613 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:58,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash 553921402, now seen corresponding path program 1 times [2025-03-08 07:33:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:58,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503959839] [2025-03-08 07:33:58,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:58,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:33:58,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:33:58,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:58,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 07:33:58,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503959839] [2025-03-08 07:33:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503959839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537978794] [2025-03-08 07:33:58,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:58,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:58,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:58,804 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-08 07:33:58,805 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-08 07:33:58,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:33:58,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:33:58,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:58,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:58,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 07:33:58,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 07:33:59,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:33:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 07:33:59,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537978794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:33:59,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:33:59,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-08 07:33:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187834318] [2025-03-08 07:33:59,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:33:59,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 07:33:59,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:59,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 07:33:59,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:33:59,246 INFO L87 Difference]: Start difference. First operand 1495 states and 1900 transitions. Second operand has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-08 07:34:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:00,400 INFO L93 Difference]: Finished difference Result 3241 states and 4073 transitions. [2025-03-08 07:34:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 07:34:00,400 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 153 [2025-03-08 07:34:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:00,409 INFO L225 Difference]: With dead ends: 3241 [2025-03-08 07:34:00,409 INFO L226 Difference]: Without dead ends: 1980 [2025-03-08 07:34:00,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-03-08 07:34:00,413 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1157 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 2217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:00,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1853 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2044 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:34:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2025-03-08 07:34:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1769. [2025-03-08 07:34:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1424 states have (on average 1.2485955056179776) internal successors, (1778), 1439 states have internal predecessors, (1778), 178 states have call successors, (178), 136 states have call predecessors, (178), 165 states have return successors, (252), 194 states have call predecessors, (252), 175 states have call successors, (252) [2025-03-08 07:34:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2208 transitions. [2025-03-08 07:34:00,506 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2208 transitions. Word has length 153 [2025-03-08 07:34:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:00,506 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2208 transitions. [2025-03-08 07:34:00,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-08 07:34:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2208 transitions. [2025-03-08 07:34:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:00,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:00,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:00,515 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-08 07:34:00,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:00,709 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:00,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1391963785, now seen corresponding path program 1 times [2025-03-08 07:34:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:00,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613494320] [2025-03-08 07:34:00,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:00,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:00,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:00,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:00,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:00,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:00,747 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-08 07:34:00,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613494320] [2025-03-08 07:34:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613494320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:00,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005949190] [2025-03-08 07:34:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:00,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:00,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:00,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:00,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:00,748 INFO L87 Difference]: Start difference. First operand 1769 states and 2208 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:00,877 INFO L93 Difference]: Finished difference Result 2067 states and 2676 transitions. [2025-03-08 07:34:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:00,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:00,885 INFO L225 Difference]: With dead ends: 2067 [2025-03-08 07:34:00,885 INFO L226 Difference]: Without dead ends: 1769 [2025-03-08 07:34:00,887 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-08 07:34:00,887 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 473 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 728 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-08 07:34:00,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 728 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2025-03-08 07:34:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2025-03-08 07:34:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1424 states have (on average 1.2478932584269662) internal successors, (1777), 1439 states have internal predecessors, (1777), 178 states have call successors, (178), 136 states have call predecessors, (178), 165 states have return successors, (252), 194 states have call predecessors, (252), 175 states have call successors, (252) [2025-03-08 07:34:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2207 transitions. [2025-03-08 07:34:01,058 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2207 transitions. Word has length 144 [2025-03-08 07:34:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:01,058 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2207 transitions. [2025-03-08 07:34:01,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2207 transitions. [2025-03-08 07:34:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:01,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:01,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:01,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:34:01,060 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:01,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1210230536, now seen corresponding path program 1 times [2025-03-08 07:34:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:01,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570766114] [2025-03-08 07:34:01,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:01,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:01,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:01,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:01,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:01,136 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-08 07:34:01,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:01,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570766114] [2025-03-08 07:34:01,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570766114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:01,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:01,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087216948] [2025-03-08 07:34:01,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:01,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:01,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:01,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:01,138 INFO L87 Difference]: Start difference. First operand 1769 states and 2207 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:01,686 INFO L93 Difference]: Finished difference Result 2385 states and 3187 transitions. [2025-03-08 07:34:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:01,694 INFO L225 Difference]: With dead ends: 2385 [2025-03-08 07:34:01,694 INFO L226 Difference]: Without dead ends: 2095 [2025-03-08 07:34:01,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:01,695 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 1068 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:01,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1478 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:34:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2025-03-08 07:34:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2070. [2025-03-08 07:34:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 1700 states have (on average 1.3047058823529412) internal successors, (2218), 1716 states have internal predecessors, (2218), 196 states have call successors, (196), 142 states have call predecessors, (196), 172 states have return successors, (271), 212 states have call predecessors, (271), 193 states have call successors, (271) [2025-03-08 07:34:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2685 transitions. [2025-03-08 07:34:01,796 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2685 transitions. Word has length 144 [2025-03-08 07:34:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:01,797 INFO L471 AbstractCegarLoop]: Abstraction has 2070 states and 2685 transitions. [2025-03-08 07:34:01,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2685 transitions. [2025-03-08 07:34:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:01,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:01,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:01,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:34:01,800 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:01,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash -978413818, now seen corresponding path program 1 times [2025-03-08 07:34:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:01,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848671954] [2025-03-08 07:34:01,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:01,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:01,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:01,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:01,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:01,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:01,924 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-08 07:34:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848671954] [2025-03-08 07:34:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848671954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:01,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:01,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117134945] [2025-03-08 07:34:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:01,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:01,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:01,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:01,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:01,927 INFO L87 Difference]: Start difference. First operand 2070 states and 2685 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:02,657 INFO L93 Difference]: Finished difference Result 3046 states and 4252 transitions. [2025-03-08 07:34:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:02,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:02,666 INFO L225 Difference]: With dead ends: 3046 [2025-03-08 07:34:02,666 INFO L226 Difference]: Without dead ends: 2455 [2025-03-08 07:34:02,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-08 07:34:02,668 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 1071 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:02,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 2753 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2025-03-08 07:34:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2350. [2025-03-08 07:34:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 1955 states have (on average 1.338618925831202) internal successors, (2617), 1972 states have internal predecessors, (2617), 214 states have call successors, (214), 148 states have call predecessors, (214), 179 states have return successors, (292), 231 states have call predecessors, (292), 211 states have call successors, (292) [2025-03-08 07:34:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3123 transitions. [2025-03-08 07:34:02,786 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3123 transitions. Word has length 144 [2025-03-08 07:34:02,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:02,786 INFO L471 AbstractCegarLoop]: Abstraction has 2350 states and 3123 transitions. [2025-03-08 07:34:02,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3123 transitions. [2025-03-08 07:34:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:02,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:02,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:02,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:34:02,790 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:02,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash -547497017, now seen corresponding path program 1 times [2025-03-08 07:34:02,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:02,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398773859] [2025-03-08 07:34:02,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:02,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:02,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:02,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:02,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:02,886 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-08 07:34:02,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:02,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398773859] [2025-03-08 07:34:02,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398773859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:02,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:02,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369466505] [2025-03-08 07:34:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:02,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:02,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:02,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:02,888 INFO L87 Difference]: Start difference. First operand 2350 states and 3123 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:03,580 INFO L93 Difference]: Finished difference Result 3938 states and 5669 transitions. [2025-03-08 07:34:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:03,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:03,595 INFO L225 Difference]: With dead ends: 3938 [2025-03-08 07:34:03,595 INFO L226 Difference]: Without dead ends: 3067 [2025-03-08 07:34:03,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-08 07:34:03,599 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 1066 mSDsluCounter, 2051 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:03,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 2737 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2025-03-08 07:34:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 2947. [2025-03-08 07:34:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2500 states have (on average 1.3928) internal successors, (3482), 2521 states have internal predecessors, (3482), 250 states have call successors, (250), 160 states have call predecessors, (250), 195 states have return successors, (340), 269 states have call predecessors, (340), 247 states have call successors, (340) [2025-03-08 07:34:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4072 transitions. [2025-03-08 07:34:03,758 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4072 transitions. Word has length 144 [2025-03-08 07:34:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:03,758 INFO L471 AbstractCegarLoop]: Abstraction has 2947 states and 4072 transitions. [2025-03-08 07:34:03,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4072 transitions. [2025-03-08 07:34:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:03,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:03,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:03,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:34:03,761 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:03,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash 574782182, now seen corresponding path program 1 times [2025-03-08 07:34:03,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:03,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876032792] [2025-03-08 07:34:03,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:03,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:03,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:03,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:03,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:03,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:03,842 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-08 07:34:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:03,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876032792] [2025-03-08 07:34:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876032792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:03,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:03,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:03,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176441506] [2025-03-08 07:34:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:03,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:03,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:03,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:03,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:03,844 INFO L87 Difference]: Start difference. First operand 2947 states and 4072 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:04,484 INFO L93 Difference]: Finished difference Result 5865 states and 8792 transitions. [2025-03-08 07:34:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:04,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:04,498 INFO L225 Difference]: With dead ends: 5865 [2025-03-08 07:34:04,498 INFO L226 Difference]: Without dead ends: 4397 [2025-03-08 07:34:04,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-08 07:34:04,503 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 1061 mSDsluCounter, 2042 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:04,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 2725 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2025-03-08 07:34:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4246. [2025-03-08 07:34:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4246 states, 3689 states have (on average 1.4643534833288154) internal successors, (5402), 3724 states have internal predecessors, (5402), 322 states have call successors, (322), 184 states have call predecessors, (322), 233 states have return successors, (460), 345 states have call predecessors, (460), 319 states have call successors, (460) [2025-03-08 07:34:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4246 states to 4246 states and 6184 transitions. [2025-03-08 07:34:04,710 INFO L78 Accepts]: Start accepts. Automaton has 4246 states and 6184 transitions. Word has length 144 [2025-03-08 07:34:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:04,710 INFO L471 AbstractCegarLoop]: Abstraction has 4246 states and 6184 transitions. [2025-03-08 07:34:04,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 6184 transitions. [2025-03-08 07:34:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:04,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:04,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:04,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:34:04,714 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:04,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:04,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1328677913, now seen corresponding path program 1 times [2025-03-08 07:34:04,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266898861] [2025-03-08 07:34:04,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:04,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:04,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:04,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:04,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:04,788 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-08 07:34:04,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:04,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266898861] [2025-03-08 07:34:04,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266898861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:04,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:04,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:04,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423403409] [2025-03-08 07:34:04,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:04,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:04,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:04,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:04,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:04,790 INFO L87 Difference]: Start difference. First operand 4246 states and 6184 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:05,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:05,535 INFO L93 Difference]: Finished difference Result 10120 states and 15882 transitions. [2025-03-08 07:34:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:05,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:05,559 INFO L225 Difference]: With dead ends: 10120 [2025-03-08 07:34:05,559 INFO L226 Difference]: Without dead ends: 7353 [2025-03-08 07:34:05,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-08 07:34:05,570 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 1056 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:05,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 2713 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7353 states. [2025-03-08 07:34:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7353 to 7141. [2025-03-08 07:34:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7141 states, 6346 states have (on average 1.5408131106208636) internal successors, (9778), 6427 states have internal predecessors, (9778), 466 states have call successors, (466), 232 states have call predecessors, (466), 327 states have return successors, (796), 497 states have call predecessors, (796), 463 states have call successors, (796) [2025-03-08 07:34:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 11040 transitions. [2025-03-08 07:34:05,899 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 11040 transitions. Word has length 144 [2025-03-08 07:34:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:05,900 INFO L471 AbstractCegarLoop]: Abstraction has 7141 states and 11040 transitions. [2025-03-08 07:34:05,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 11040 transitions. [2025-03-08 07:34:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:05,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:05,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:05,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:34:05,904 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:05,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash 272488134, now seen corresponding path program 1 times [2025-03-08 07:34:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:05,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706509730] [2025-03-08 07:34:05,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:05,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:05,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:05,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:05,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:05,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:05,973 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-08 07:34:05,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:05,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706509730] [2025-03-08 07:34:05,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706509730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:05,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:05,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107736654] [2025-03-08 07:34:05,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:05,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:05,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:05,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:05,975 INFO L87 Difference]: Start difference. First operand 7141 states and 11040 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:06,574 INFO L93 Difference]: Finished difference Result 14131 states and 23025 transitions. [2025-03-08 07:34:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:06,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:06,600 INFO L225 Difference]: With dead ends: 14131 [2025-03-08 07:34:06,600 INFO L226 Difference]: Without dead ends: 8469 [2025-03-08 07:34:06,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:06,614 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 803 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:06,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1091 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2025-03-08 07:34:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 7141. [2025-03-08 07:34:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7141 states, 6346 states have (on average 1.538134257800189) internal successors, (9761), 6427 states have internal predecessors, (9761), 466 states have call successors, (466), 232 states have call predecessors, (466), 327 states have return successors, (796), 497 states have call predecessors, (796), 463 states have call successors, (796) [2025-03-08 07:34:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 11023 transitions. [2025-03-08 07:34:07,002 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 11023 transitions. Word has length 144 [2025-03-08 07:34:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:07,003 INFO L471 AbstractCegarLoop]: Abstraction has 7141 states and 11023 transitions. [2025-03-08 07:34:07,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 11023 transitions. [2025-03-08 07:34:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:07,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:07,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:07,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:34:07,007 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:07,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash -368598009, now seen corresponding path program 1 times [2025-03-08 07:34:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190378784] [2025-03-08 07:34:07,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:07,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:07,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:07,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:07,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:07,088 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-08 07:34:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:07,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190378784] [2025-03-08 07:34:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190378784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:07,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:07,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:07,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672553574] [2025-03-08 07:34:07,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:07,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:07,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:07,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:07,089 INFO L87 Difference]: Start difference. First operand 7141 states and 11023 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:07,912 INFO L93 Difference]: Finished difference Result 14048 states and 22825 transitions. [2025-03-08 07:34:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:07,942 INFO L225 Difference]: With dead ends: 14048 [2025-03-08 07:34:07,942 INFO L226 Difference]: Without dead ends: 8386 [2025-03-08 07:34:07,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:07,959 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 800 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:07,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1083 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8386 states. [2025-03-08 07:34:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8386 to 7141. [2025-03-08 07:34:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7141 states, 6346 states have (on average 1.5354554049795146) internal successors, (9744), 6427 states have internal predecessors, (9744), 466 states have call successors, (466), 232 states have call predecessors, (466), 327 states have return successors, (796), 497 states have call predecessors, (796), 463 states have call successors, (796) [2025-03-08 07:34:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 11006 transitions. [2025-03-08 07:34:08,419 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 11006 transitions. Word has length 144 [2025-03-08 07:34:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:08,419 INFO L471 AbstractCegarLoop]: Abstraction has 7141 states and 11006 transitions. [2025-03-08 07:34:08,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 11006 transitions. [2025-03-08 07:34:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:08,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:08,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:08,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 07:34:08,424 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash 857647782, now seen corresponding path program 1 times [2025-03-08 07:34:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976209049] [2025-03-08 07:34:08,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:08,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:08,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:08,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:08,503 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-08 07:34:08,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:08,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976209049] [2025-03-08 07:34:08,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976209049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:08,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:08,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976813297] [2025-03-08 07:34:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:08,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:08,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:08,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:08,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:08,505 INFO L87 Difference]: Start difference. First operand 7141 states and 11006 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:09,152 INFO L93 Difference]: Finished difference Result 13965 states and 22625 transitions. [2025-03-08 07:34:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:09,183 INFO L225 Difference]: With dead ends: 13965 [2025-03-08 07:34:09,183 INFO L226 Difference]: Without dead ends: 8303 [2025-03-08 07:34:09,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:09,198 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 797 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:09,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1075 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2025-03-08 07:34:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 7141. [2025-03-08 07:34:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7141 states, 6346 states have (on average 1.5327765521588401) internal successors, (9727), 6427 states have internal predecessors, (9727), 466 states have call successors, (466), 232 states have call predecessors, (466), 327 states have return successors, (796), 497 states have call predecessors, (796), 463 states have call successors, (796) [2025-03-08 07:34:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 10989 transitions. [2025-03-08 07:34:09,693 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 10989 transitions. Word has length 144 [2025-03-08 07:34:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:09,693 INFO L471 AbstractCegarLoop]: Abstraction has 7141 states and 10989 transitions. [2025-03-08 07:34:09,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 10989 transitions. [2025-03-08 07:34:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:09,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:09,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:09,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 07:34:09,698 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:09,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2144130087, now seen corresponding path program 1 times [2025-03-08 07:34:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:09,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217345529] [2025-03-08 07:34:09,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:09,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:09,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:09,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:09,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:09,814 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-08 07:34:09,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:09,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217345529] [2025-03-08 07:34:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217345529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:09,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302311095] [2025-03-08 07:34:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:09,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:09,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:09,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:09,816 INFO L87 Difference]: Start difference. First operand 7141 states and 10989 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:10,829 INFO L93 Difference]: Finished difference Result 19459 states and 31819 transitions. [2025-03-08 07:34:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:10,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:10,862 INFO L225 Difference]: With dead ends: 19459 [2025-03-08 07:34:10,862 INFO L226 Difference]: Without dead ends: 13797 [2025-03-08 07:34:10,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-08 07:34:10,876 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 1027 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:10,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2644 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13797 states. [2025-03-08 07:34:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13797 to 13525. [2025-03-08 07:34:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13525 states, 12200 states have (on average 1.5941803278688524) internal successors, (19449), 12427 states have internal predecessors, (19449), 754 states have call successors, (754), 328 states have call predecessors, (754), 569 states have return successors, (1852), 801 states have call predecessors, (1852), 751 states have call successors, (1852) [2025-03-08 07:34:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13525 states to 13525 states and 22055 transitions. [2025-03-08 07:34:11,722 INFO L78 Accepts]: Start accepts. Automaton has 13525 states and 22055 transitions. Word has length 144 [2025-03-08 07:34:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:11,722 INFO L471 AbstractCegarLoop]: Abstraction has 13525 states and 22055 transitions. [2025-03-08 07:34:11,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13525 states and 22055 transitions. [2025-03-08 07:34:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:11,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:11,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:11,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 07:34:11,728 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:11,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash -169675130, now seen corresponding path program 1 times [2025-03-08 07:34:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:11,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928787657] [2025-03-08 07:34:11,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:11,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:11,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:11,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:11,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:11,801 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-08 07:34:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:11,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928787657] [2025-03-08 07:34:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928787657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306927331] [2025-03-08 07:34:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:11,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:11,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:11,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:11,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:11,803 INFO L87 Difference]: Start difference. First operand 13525 states and 22055 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:12,928 INFO L93 Difference]: Finished difference Result 28511 states and 48593 transitions. [2025-03-08 07:34:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:12,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:12,971 INFO L225 Difference]: With dead ends: 28511 [2025-03-08 07:34:12,971 INFO L226 Difference]: Without dead ends: 16465 [2025-03-08 07:34:12,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:12,991 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 793 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:12,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1061 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:34:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16465 states. [2025-03-08 07:34:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16465 to 13525. [2025-03-08 07:34:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13525 states, 12200 states have (on average 1.5914754098360655) internal successors, (19416), 12427 states have internal predecessors, (19416), 754 states have call successors, (754), 328 states have call predecessors, (754), 569 states have return successors, (1852), 801 states have call predecessors, (1852), 751 states have call successors, (1852) [2025-03-08 07:34:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13525 states to 13525 states and 22022 transitions. [2025-03-08 07:34:13,591 INFO L78 Accepts]: Start accepts. Automaton has 13525 states and 22022 transitions. Word has length 144 [2025-03-08 07:34:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:13,591 INFO L471 AbstractCegarLoop]: Abstraction has 13525 states and 22022 transitions. [2025-03-08 07:34:13,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 13525 states and 22022 transitions. [2025-03-08 07:34:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:13,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:13,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:13,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 07:34:13,596 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:13,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1352692665, now seen corresponding path program 1 times [2025-03-08 07:34:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:13,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049869261] [2025-03-08 07:34:13,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:13,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:13,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:13,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:13,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:13,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:13,662 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-08 07:34:13,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:13,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049869261] [2025-03-08 07:34:13,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049869261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:13,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:13,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:13,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926844526] [2025-03-08 07:34:13,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:13,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:13,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:13,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:13,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:13,664 INFO L87 Difference]: Start difference. First operand 13525 states and 22022 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:15,249 INFO L93 Difference]: Finished difference Result 42545 states and 72797 transitions. [2025-03-08 07:34:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:15,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:15,353 INFO L225 Difference]: With dead ends: 42545 [2025-03-08 07:34:15,354 INFO L226 Difference]: Without dead ends: 30499 [2025-03-08 07:34:15,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:15,392 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 1298 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:15,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 2600 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30499 states. [2025-03-08 07:34:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30499 to 27817. [2025-03-08 07:34:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27817 states, 25302 states have (on average 1.6402655916528337) internal successors, (41502), 25983 states have internal predecessors, (41502), 1298 states have call successors, (1298), 520 states have call predecessors, (1298), 1215 states have return successors, (5468), 1377 states have call predecessors, (5468), 1295 states have call successors, (5468) [2025-03-08 07:34:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27817 states to 27817 states and 48268 transitions. [2025-03-08 07:34:16,739 INFO L78 Accepts]: Start accepts. Automaton has 27817 states and 48268 transitions. Word has length 144 [2025-03-08 07:34:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:16,739 INFO L471 AbstractCegarLoop]: Abstraction has 27817 states and 48268 transitions. [2025-03-08 07:34:16,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 27817 states and 48268 transitions. [2025-03-08 07:34:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:16,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:16,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:16,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 07:34:16,749 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:16,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1795734118, now seen corresponding path program 1 times [2025-03-08 07:34:16,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:16,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589331164] [2025-03-08 07:34:16,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:16,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:16,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:16,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:16,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:16,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:16,838 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-08 07:34:16,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:16,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589331164] [2025-03-08 07:34:16,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589331164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:16,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:16,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:16,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854228714] [2025-03-08 07:34:16,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:16,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:16,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:16,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:16,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:16,841 INFO L87 Difference]: Start difference. First operand 27817 states and 48268 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:19,889 INFO L93 Difference]: Finished difference Result 91987 states and 168585 transitions. [2025-03-08 07:34:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:19,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:20,139 INFO L225 Difference]: With dead ends: 91987 [2025-03-08 07:34:20,140 INFO L226 Difference]: Without dead ends: 65649 [2025-03-08 07:34:20,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:20,223 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 1262 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:20,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 2584 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65649 states. [2025-03-08 07:34:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65649 to 60346. [2025-03-08 07:34:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60346 states, 54997 states have (on average 1.6776551448260815) internal successors, (92266), 57072 states have internal predecessors, (92266), 2354 states have call successors, (2354), 904 states have call predecessors, (2354), 2993 states have return successors, (18812), 2497 states have call predecessors, (18812), 2351 states have call successors, (18812) [2025-03-08 07:34:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60346 states to 60346 states and 113432 transitions. [2025-03-08 07:34:23,931 INFO L78 Accepts]: Start accepts. Automaton has 60346 states and 113432 transitions. Word has length 144 [2025-03-08 07:34:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:23,931 INFO L471 AbstractCegarLoop]: Abstraction has 60346 states and 113432 transitions. [2025-03-08 07:34:23,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 60346 states and 113432 transitions. [2025-03-08 07:34:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 07:34:23,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:23,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:23,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 07:34:23,948 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:23,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:23,948 INFO L85 PathProgramCache]: Analyzing trace with hash 511822951, now seen corresponding path program 1 times [2025-03-08 07:34:23,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:23,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432569448] [2025-03-08 07:34:23,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:23,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:23,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 07:34:23,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 07:34:23,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:23,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:24,035 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-08 07:34:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432569448] [2025-03-08 07:34:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432569448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:24,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698781151] [2025-03-08 07:34:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:24,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:24,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:24,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:24,037 INFO L87 Difference]: Start difference. First operand 60346 states and 113432 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:30,618 INFO L93 Difference]: Finished difference Result 205548 states and 414723 transitions. [2025-03-08 07:34:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:30,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-03-08 07:34:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:31,583 INFO L225 Difference]: With dead ends: 205548 [2025-03-08 07:34:31,583 INFO L226 Difference]: Without dead ends: 146681 [2025-03-08 07:34:31,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:31,717 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 1228 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:31,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 2576 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146681 states.