./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.04.cil-1.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_1.cil-2+token_ring.04.cil-1.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 82bdcd0599c1cc352b3450b4e917b8a69eeb254589d3b948d4951dae1b33e3d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:31:13,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:31:13,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:31:13,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:31:13,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:31:13,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:31:13,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:31:13,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:31:13,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:31:13,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:31:13,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:31:13,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:31:13,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:31:13,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:31:13,084 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:31:13,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:31:13,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:31:13,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:31:13,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:31:13,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:31:13,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:31:13,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:31:13,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:31:13,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:31:13,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:31:13,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:31:13,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:31:13,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:31:13,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:31:13,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:31:13,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:31:13,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:31:13,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:31:13,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:31:13,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:31:13,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:31:13,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:31:13,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:31:13,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:31:13,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:31:13,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:31:13,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:31:13,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:31:13,087 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 -> 82bdcd0599c1cc352b3450b4e917b8a69eeb254589d3b948d4951dae1b33e3d4 [2025-03-08 07:31:13,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:31:13,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:31:13,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:31:13,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:31:13,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:31:13,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.04.cil-1.c [2025-03-08 07:31:14,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6cc84639/fa17867042284f36a36bbfaec8856fba/FLAG083cefa24 [2025-03-08 07:31:14,846 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:31:14,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.04.cil-1.c [2025-03-08 07:31:14,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6cc84639/fa17867042284f36a36bbfaec8856fba/FLAG083cefa24 [2025-03-08 07:31:14,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6cc84639/fa17867042284f36a36bbfaec8856fba [2025-03-08 07:31:14,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:31:14,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:31:14,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:31:14,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:31:14,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:31:14,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204bb8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14, skipping insertion in model container [2025-03-08 07:31:14,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:31:15,056 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_1.cil-2+token_ring.04.cil-1.c[913,926] [2025-03-08 07:31:15,098 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_1.cil-2+token_ring.04.cil-1.c[5977,5990] [2025-03-08 07:31:15,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:31:15,158 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:31:15,170 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_1.cil-2+token_ring.04.cil-1.c[913,926] [2025-03-08 07:31:15,184 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_1.cil-2+token_ring.04.cil-1.c[5977,5990] [2025-03-08 07:31:15,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:31:15,225 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:31:15,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15 WrapperNode [2025-03-08 07:31:15,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:31:15,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:31:15,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:31:15,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:31:15,231 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:31:15" (1/1) ... [2025-03-08 07:31:15,238 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:31:15" (1/1) ... [2025-03-08 07:31:15,260 INFO L138 Inliner]: procedures = 56, calls = 60, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 570 [2025-03-08 07:31:15,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:31:15,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:31:15,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:31:15,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:31:15,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,283 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:31:15,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:31:15,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:31:15,300 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:31:15,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:31:15,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (1/1) ... [2025-03-08 07:31:15,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:31:15,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:15,327 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:31:15,330 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:31:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:31:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:31:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:31:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-08 07:31:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-08 07:31:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:31:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:31:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:31:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:31:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:31:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:31:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:31:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:31:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:31:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:31:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:31:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:31:15,355 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:31:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:31:15,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:31:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:31:15,356 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:31:15,433 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:31:15,434 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:31:15,882 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-03-08 07:31:15,883 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:31:15,894 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:31:15,894 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:31:15,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:31:15 BoogieIcfgContainer [2025-03-08 07:31:15,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:31:15,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:31:15,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:31:15,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:31:15,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:31:14" (1/3) ... [2025-03-08 07:31:15,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3107f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:31:15, skipping insertion in model container [2025-03-08 07:31:15,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:15" (2/3) ... [2025-03-08 07:31:15,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3107f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:31:15, skipping insertion in model container [2025-03-08 07:31:15,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:31:15" (3/3) ... [2025-03-08 07:31:15,902 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.04.cil-1.c [2025-03-08 07:31:15,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:31:15,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.04.cil-1.c that has 10 procedures, 248 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-03-08 07:31:15,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:31:15,965 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;@36219ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:31:15,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:31:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 214 states have (on average 1.5467289719626167) internal successors, (331), 217 states have internal predecessors, (331), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 07:31:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 07:31:15,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:15,977 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] [2025-03-08 07:31:15,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:15,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash 371288734, now seen corresponding path program 1 times [2025-03-08 07:31:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806239900] [2025-03-08 07:31:15,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:16,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 07:31:16,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 07:31:16,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:16,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,195 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:31:16,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:16,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806239900] [2025-03-08 07:31:16,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806239900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:16,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599590834] [2025-03-08 07:31:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:16,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:16,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:16,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:16,220 INFO L87 Difference]: Start difference. First operand has 248 states, 214 states have (on average 1.5467289719626167) internal successors, (331), 217 states have internal predecessors, (331), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:16,301 INFO L93 Difference]: Finished difference Result 534 states and 818 transitions. [2025-03-08 07:31:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-08 07:31:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:16,309 INFO L225 Difference]: With dead ends: 534 [2025-03-08 07:31:16,310 INFO L226 Difference]: Without dead ends: 293 [2025-03-08 07:31:16,313 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:31:16,315 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 343 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:16,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 457 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-08 07:31:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2025-03-08 07:31:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 249 states have (on average 1.4859437751004017) internal successors, (370), 252 states have internal predecessors, (370), 28 states have call successors, (28), 11 states have call predecessors, (28), 10 states have return successors, (30), 26 states have call predecessors, (30), 26 states have call successors, (30) [2025-03-08 07:31:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 428 transitions. [2025-03-08 07:31:16,372 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 428 transitions. Word has length 41 [2025-03-08 07:31:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:16,372 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 428 transitions. [2025-03-08 07:31:16,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 428 transitions. [2025-03-08 07:31:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 07:31:16,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:16,374 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] [2025-03-08 07:31:16,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:31:16,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:16,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1372814425, now seen corresponding path program 1 times [2025-03-08 07:31:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:16,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631428604] [2025-03-08 07:31:16,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:16,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 07:31:16,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 07:31:16,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:16,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,427 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:31:16,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:16,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631428604] [2025-03-08 07:31:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631428604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:16,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:16,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590393969] [2025-03-08 07:31:16,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:16,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:16,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:16,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:16,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:16,430 INFO L87 Difference]: Start difference. First operand 289 states and 428 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:16,471 INFO L93 Difference]: Finished difference Result 482 states and 701 transitions. [2025-03-08 07:31:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-08 07:31:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:16,475 INFO L225 Difference]: With dead ends: 482 [2025-03-08 07:31:16,475 INFO L226 Difference]: Without dead ends: 375 [2025-03-08 07:31:16,475 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:31:16,476 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 66 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:16,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 709 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-08 07:31:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 350. [2025-03-08 07:31:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 304 states have (on average 1.4736842105263157) internal successors, (448), 307 states have internal predecessors, (448), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (34), 29 states have call predecessors, (34), 29 states have call successors, (34) [2025-03-08 07:31:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 513 transitions. [2025-03-08 07:31:16,502 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 513 transitions. Word has length 42 [2025-03-08 07:31:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:16,502 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 513 transitions. [2025-03-08 07:31:16,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 513 transitions. [2025-03-08 07:31:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 07:31:16,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:16,503 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] [2025-03-08 07:31:16,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:31:16,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:16,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash -842236341, now seen corresponding path program 1 times [2025-03-08 07:31:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:16,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689742034] [2025-03-08 07:31:16,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:16,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:16,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 07:31:16,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 07:31:16,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:16,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,558 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:31:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689742034] [2025-03-08 07:31:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689742034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:16,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:16,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:16,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903803246] [2025-03-08 07:31:16,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:16,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:16,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:16,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:16,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:16,560 INFO L87 Difference]: Start difference. First operand 350 states and 513 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:16,597 INFO L93 Difference]: Finished difference Result 675 states and 973 transitions. [2025-03-08 07:31:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:16,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-08 07:31:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:16,600 INFO L225 Difference]: With dead ends: 675 [2025-03-08 07:31:16,600 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 07:31:16,601 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:31:16,602 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 331 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:16,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 437 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 07:31:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 495. [2025-03-08 07:31:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 431 states have (on average 1.4338747099767981) internal successors, (618), 436 states have internal predecessors, (618), 42 states have call successors, (42), 21 states have call predecessors, (42), 20 states have return successors, (50), 38 states have call predecessors, (50), 40 states have call successors, (50) [2025-03-08 07:31:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 710 transitions. [2025-03-08 07:31:16,634 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 710 transitions. Word has length 43 [2025-03-08 07:31:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:16,634 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 710 transitions. [2025-03-08 07:31:16,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 710 transitions. [2025-03-08 07:31:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:31:16,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:16,638 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] [2025-03-08 07:31:16,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:31:16,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:16,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash -932076722, now seen corresponding path program 1 times [2025-03-08 07:31:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473147371] [2025-03-08 07:31:16,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:16,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:31:16,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:31:16,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:16,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,751 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:31:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:16,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473147371] [2025-03-08 07:31:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473147371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:16,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12682880] [2025-03-08 07:31:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:16,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:16,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:16,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:16,752 INFO L87 Difference]: Start difference. First operand 495 states and 710 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:31:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:16,798 INFO L93 Difference]: Finished difference Result 966 states and 1366 transitions. [2025-03-08 07:31:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:16,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2025-03-08 07:31:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:16,802 INFO L225 Difference]: With dead ends: 966 [2025-03-08 07:31:16,802 INFO L226 Difference]: Without dead ends: 653 [2025-03-08 07:31:16,803 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:31:16,804 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 53 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:16,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 753 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-08 07:31:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-03-08 07:31:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 567 states have (on average 1.382716049382716) internal successors, (784), 572 states have internal predecessors, (784), 56 states have call successors, (56), 29 states have call predecessors, (56), 28 states have return successors, (72), 52 states have call predecessors, (72), 54 states have call successors, (72) [2025-03-08 07:31:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 912 transitions. [2025-03-08 07:31:16,840 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 912 transitions. Word has length 58 [2025-03-08 07:31:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:16,840 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 912 transitions. [2025-03-08 07:31:16,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:31:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 912 transitions. [2025-03-08 07:31:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:31:16,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:16,842 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:31:16,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:31:16,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:16,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2096441823, now seen corresponding path program 1 times [2025-03-08 07:31:16,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:16,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315440232] [2025-03-08 07:31:16,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:16,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:16,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:16,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:16,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:16,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:31:16,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:16,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315440232] [2025-03-08 07:31:16,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315440232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:16,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858862005] [2025-03-08 07:31:16,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:16,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:16,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:16,996 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:31:16,997 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:31:17,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:17,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:17,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:17,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:17,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:31:17,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:31:17,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:31:17,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858862005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:17,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:31:17,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:31:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523619293] [2025-03-08 07:31:17,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:17,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:17,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:17,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:17,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:31:17,146 INFO L87 Difference]: Start difference. First operand 653 states and 912 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:31:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:17,192 INFO L93 Difference]: Finished difference Result 1155 states and 1589 transitions. [2025-03-08 07:31:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:17,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-03-08 07:31:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:17,196 INFO L225 Difference]: With dead ends: 1155 [2025-03-08 07:31:17,196 INFO L226 Difference]: Without dead ends: 772 [2025-03-08 07:31:17,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:31:17,197 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 310 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:17,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 431 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-08 07:31:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2025-03-08 07:31:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 672 states have (on average 1.3556547619047619) internal successors, (911), 677 states have internal predecessors, (911), 64 states have call successors, (64), 35 states have call predecessors, (64), 34 states have return successors, (84), 60 states have call predecessors, (84), 62 states have call successors, (84) [2025-03-08 07:31:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1059 transitions. [2025-03-08 07:31:17,223 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1059 transitions. Word has length 63 [2025-03-08 07:31:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:17,224 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1059 transitions. [2025-03-08 07:31:17,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:31:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1059 transitions. [2025-03-08 07:31:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:31:17,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:17,225 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:31:17,232 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:31:17,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:17,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:17,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1210505342, now seen corresponding path program 1 times [2025-03-08 07:31:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:17,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981947764] [2025-03-08 07:31:17,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:17,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:17,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:17,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:17,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:31:17,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:17,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981947764] [2025-03-08 07:31:17,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981947764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:17,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116926892] [2025-03-08 07:31:17,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:17,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:17,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:17,514 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:31:17,515 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:31:17,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:17,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:17,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:17,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:17,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 07:31:17,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:17,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:31:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:31:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116926892] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:17,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:31:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-08 07:31:17,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224454951] [2025-03-08 07:31:17,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:17,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:31:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:17,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:31:17,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:31:17,714 INFO L87 Difference]: Start difference. First operand 772 states and 1059 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:31:17,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:17,864 INFO L93 Difference]: Finished difference Result 822 states and 1121 transitions. [2025-03-08 07:31:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:31:17,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-03-08 07:31:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:17,868 INFO L225 Difference]: With dead ends: 822 [2025-03-08 07:31:17,869 INFO L226 Difference]: Without dead ends: 819 [2025-03-08 07:31:17,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:31:17,870 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 625 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:17,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 439 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:31:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-08 07:31:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2025-03-08 07:31:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 672 states have (on average 1.3526785714285714) internal successors, (909), 676 states have internal predecessors, (909), 63 states have call successors, (63), 35 states have call predecessors, (63), 34 states have return successors, (84), 60 states have call predecessors, (84), 62 states have call successors, (84) [2025-03-08 07:31:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1056 transitions. [2025-03-08 07:31:17,911 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1056 transitions. Word has length 63 [2025-03-08 07:31:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:17,911 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1056 transitions. [2025-03-08 07:31:17,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:31:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1056 transitions. [2025-03-08 07:31:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:31:17,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:17,913 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:31:17,919 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:31:18,114 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,SelfDestructingSolverStorable5 [2025-03-08 07:31:18,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:18,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1129361111, now seen corresponding path program 1 times [2025-03-08 07:31:18,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:18,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763094078] [2025-03-08 07:31:18,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:18,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:31:18,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:31:18,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:18,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:31:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763094078] [2025-03-08 07:31:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763094078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402929978] [2025-03-08 07:31:18,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:18,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:18,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:18,187 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:31:18,188 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:31:18,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:31:18,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:31:18,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:18,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:18,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:31:18,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:18,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:31:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:31:18,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402929978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:31:18,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:31:18,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-08 07:31:18,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832867396] [2025-03-08 07:31:18,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:31:18,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:31:18,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:18,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:31:18,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:31:18,560 INFO L87 Difference]: Start difference. First operand 771 states and 1056 transitions. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:31:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:18,924 INFO L93 Difference]: Finished difference Result 2008 states and 2733 transitions. [2025-03-08 07:31:18,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 07:31:18,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 64 [2025-03-08 07:31:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:18,930 INFO L225 Difference]: With dead ends: 2008 [2025-03-08 07:31:18,931 INFO L226 Difference]: Without dead ends: 1551 [2025-03-08 07:31:18,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:31:18,933 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 812 mSDsluCounter, 2121 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:18,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2558 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:31:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2025-03-08 07:31:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1106. [2025-03-08 07:31:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 971 states have (on average 1.322348094747683) internal successors, (1284), 980 states have internal predecessors, (1284), 83 states have call successors, (83), 49 states have call predecessors, (83), 50 states have return successors, (115), 77 states have call predecessors, (115), 82 states have call successors, (115) [2025-03-08 07:31:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1482 transitions. [2025-03-08 07:31:19,004 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1482 transitions. Word has length 64 [2025-03-08 07:31:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:19,004 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1482 transitions. [2025-03-08 07:31:19,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:31:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1482 transitions. [2025-03-08 07:31:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 07:31:19,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:19,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 07:31:19,014 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:31:19,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:19,208 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:19,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1816081381, now seen corresponding path program 1 times [2025-03-08 07:31:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:19,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379818952] [2025-03-08 07:31:19,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:19,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:31:19,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:31:19,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:19,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 07:31:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379818952] [2025-03-08 07:31:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379818952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071143381] [2025-03-08 07:31:19,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:19,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:19,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:19,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:31:19,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 07:31:19,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:31:19,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:31:19,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:19,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:19,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 07:31:19,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:31:19,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:31:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071143381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:19,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:31:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:31:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369862969] [2025-03-08 07:31:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:19,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:19,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:19,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:19,402 INFO L87 Difference]: Start difference. First operand 1106 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 07:31:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:19,455 INFO L93 Difference]: Finished difference Result 1706 states and 2277 transitions. [2025-03-08 07:31:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:19,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2025-03-08 07:31:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:19,472 INFO L225 Difference]: With dead ends: 1706 [2025-03-08 07:31:19,472 INFO L226 Difference]: Without dead ends: 994 [2025-03-08 07:31:19,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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:31:19,474 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 315 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:19,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 453 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-08 07:31:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 985. [2025-03-08 07:31:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 864 states have (on average 1.3194444444444444) internal successors, (1140), 874 states have internal predecessors, (1140), 75 states have call successors, (75), 43 states have call predecessors, (75), 44 states have return successors, (103), 68 states have call predecessors, (103), 74 states have call successors, (103) [2025-03-08 07:31:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1318 transitions. [2025-03-08 07:31:19,514 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1318 transitions. Word has length 82 [2025-03-08 07:31:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:19,514 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1318 transitions. [2025-03-08 07:31:19,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 07:31:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1318 transitions. [2025-03-08 07:31:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:19,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:19,516 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] [2025-03-08 07:31:19,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 07:31:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:19,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:19,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash 83583034, now seen corresponding path program 1 times [2025-03-08 07:31:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503229760] [2025-03-08 07:31:19,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:19,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:19,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:19,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:19,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:19,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:31:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503229760] [2025-03-08 07:31:19,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503229760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:19,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:19,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:31:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649390718] [2025-03-08 07:31:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:19,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:31:19,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:19,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:31:19,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:31:19,804 INFO L87 Difference]: Start difference. First operand 985 states and 1318 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:20,178 INFO L93 Difference]: Finished difference Result 1327 states and 1844 transitions. [2025-03-08 07:31:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:31:20,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:20,183 INFO L225 Difference]: With dead ends: 1327 [2025-03-08 07:31:20,183 INFO L226 Difference]: Without dead ends: 1164 [2025-03-08 07:31:20,184 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:31:20,184 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 581 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:20,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 858 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:31:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-03-08 07:31:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1151. [2025-03-08 07:31:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1010 states have (on average 1.3524752475247526) internal successors, (1366), 1021 states have internal predecessors, (1366), 88 states have call successors, (88), 49 states have call predecessors, (88), 51 states have return successors, (117), 81 states have call predecessors, (117), 87 states have call successors, (117) [2025-03-08 07:31:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1571 transitions. [2025-03-08 07:31:20,223 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1571 transitions. Word has length 88 [2025-03-08 07:31:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:20,223 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1571 transitions. [2025-03-08 07:31:20,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1571 transitions. [2025-03-08 07:31:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:20,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:20,225 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] [2025-03-08 07:31:20,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:31:20,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 89675772, now seen corresponding path program 1 times [2025-03-08 07:31:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:20,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724188222] [2025-03-08 07:31:20,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:20,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:20,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:20,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:20,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724188222] [2025-03-08 07:31:20,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724188222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:20,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:20,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554729290] [2025-03-08 07:31:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:20,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:20,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:20,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:20,314 INFO L87 Difference]: Start difference. First operand 1151 states and 1571 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:20,846 INFO L93 Difference]: Finished difference Result 1688 states and 2399 transitions. [2025-03-08 07:31:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:20,853 INFO L225 Difference]: With dead ends: 1688 [2025-03-08 07:31:20,853 INFO L226 Difference]: Without dead ends: 1359 [2025-03-08 07:31:20,855 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:31:20,856 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 575 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:20,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1523 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-03-08 07:31:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1306. [2025-03-08 07:31:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1145 states have (on average 1.3711790393013101) internal successors, (1570), 1157 states have internal predecessors, (1570), 101 states have call successors, (101), 55 states have call predecessors, (101), 58 states have return successors, (133), 95 states have call predecessors, (133), 100 states have call successors, (133) [2025-03-08 07:31:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1804 transitions. [2025-03-08 07:31:20,924 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1804 transitions. Word has length 88 [2025-03-08 07:31:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:20,924 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1804 transitions. [2025-03-08 07:31:20,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1804 transitions. [2025-03-08 07:31:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:20,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:20,928 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] [2025-03-08 07:31:20,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:31:20,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2019357477, now seen corresponding path program 1 times [2025-03-08 07:31:20,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:20,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746598611] [2025-03-08 07:31:20,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:20,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:20,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:20,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:20,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:21,048 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:31:21,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:21,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746598611] [2025-03-08 07:31:21,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746598611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:21,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:21,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:21,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104390272] [2025-03-08 07:31:21,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:21,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:21,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:21,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:21,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:21,050 INFO L87 Difference]: Start difference. First operand 1306 states and 1804 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:21,576 INFO L93 Difference]: Finished difference Result 2175 states and 3141 transitions. [2025-03-08 07:31:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:21,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:21,586 INFO L225 Difference]: With dead ends: 2175 [2025-03-08 07:31:21,586 INFO L226 Difference]: Without dead ends: 1691 [2025-03-08 07:31:21,589 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:31:21,590 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 570 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:21,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1507 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2025-03-08 07:31:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1633. [2025-03-08 07:31:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1430 states have (on average 1.402097902097902) internal successors, (2005), 1446 states have internal predecessors, (2005), 127 states have call successors, (127), 67 states have call predecessors, (127), 74 states have return successors, (171), 123 states have call predecessors, (171), 126 states have call successors, (171) [2025-03-08 07:31:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2303 transitions. [2025-03-08 07:31:21,684 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2303 transitions. Word has length 88 [2025-03-08 07:31:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:21,685 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2303 transitions. [2025-03-08 07:31:21,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2303 transitions. [2025-03-08 07:31:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:21,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:21,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, 1, 1, 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:31:21,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:31:21,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1791934492, now seen corresponding path program 1 times [2025-03-08 07:31:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055818422] [2025-03-08 07:31:21,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:21,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:21,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:21,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:21,767 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:31:21,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:21,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055818422] [2025-03-08 07:31:21,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055818422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:21,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:21,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:21,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875916623] [2025-03-08 07:31:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:21,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:21,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:21,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:21,770 INFO L87 Difference]: Start difference. First operand 1633 states and 2303 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:22,253 INFO L93 Difference]: Finished difference Result 3212 states and 4754 transitions. [2025-03-08 07:31:22,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:22,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:22,262 INFO L225 Difference]: With dead ends: 3212 [2025-03-08 07:31:22,262 INFO L226 Difference]: Without dead ends: 2401 [2025-03-08 07:31:22,265 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:31:22,265 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 565 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:22,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1495 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-03-08 07:31:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2332. [2025-03-08 07:31:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 2039 states have (on average 1.4443354585581167) internal successors, (2945), 2069 states have internal predecessors, (2945), 179 states have call successors, (179), 91 states have call predecessors, (179), 112 states have return successors, (271), 179 states have call predecessors, (271), 178 states have call successors, (271) [2025-03-08 07:31:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3395 transitions. [2025-03-08 07:31:22,392 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3395 transitions. Word has length 88 [2025-03-08 07:31:22,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:22,393 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 3395 transitions. [2025-03-08 07:31:22,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3395 transitions. [2025-03-08 07:31:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:22,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:22,396 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] [2025-03-08 07:31:22,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:31:22,397 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:22,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1548803909, now seen corresponding path program 1 times [2025-03-08 07:31:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:22,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234242365] [2025-03-08 07:31:22,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:22,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:22,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:22,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:22,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:22,487 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:31:22,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:22,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234242365] [2025-03-08 07:31:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234242365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:22,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:22,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:22,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272514051] [2025-03-08 07:31:22,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:22,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:22,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:22,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:22,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:22,489 INFO L87 Difference]: Start difference. First operand 2332 states and 3395 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:23,049 INFO L93 Difference]: Finished difference Result 5447 states and 8344 transitions. [2025-03-08 07:31:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:23,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:23,084 INFO L225 Difference]: With dead ends: 5447 [2025-03-08 07:31:23,084 INFO L226 Difference]: Without dead ends: 3937 [2025-03-08 07:31:23,088 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:31:23,089 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 560 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:23,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1483 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2025-03-08 07:31:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3847. [2025-03-08 07:31:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3847 states, 3356 states have (on average 1.4901668653158522) internal successors, (5001), 3432 states have internal predecessors, (5001), 283 states have call successors, (283), 139 states have call predecessors, (283), 206 states have return successors, (567), 291 states have call predecessors, (567), 282 states have call successors, (567) [2025-03-08 07:31:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 5851 transitions. [2025-03-08 07:31:23,303 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 5851 transitions. Word has length 88 [2025-03-08 07:31:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:23,304 INFO L471 AbstractCegarLoop]: Abstraction has 3847 states and 5851 transitions. [2025-03-08 07:31:23,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:23,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 5851 transitions. [2025-03-08 07:31:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:23,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:23,309 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] [2025-03-08 07:31:23,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:31:23,309 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:23,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1795116996, now seen corresponding path program 1 times [2025-03-08 07:31:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:23,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292293271] [2025-03-08 07:31:23,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:23,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:23,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:23,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:23,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:23,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:23,399 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:31:23,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:23,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292293271] [2025-03-08 07:31:23,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292293271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:23,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:23,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:23,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185489710] [2025-03-08 07:31:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:23,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:23,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:23,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:23,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:23,401 INFO L87 Difference]: Start difference. First operand 3847 states and 5851 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:24,099 INFO L93 Difference]: Finished difference Result 10854 states and 17379 transitions. [2025-03-08 07:31:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:24,138 INFO L225 Difference]: With dead ends: 10854 [2025-03-08 07:31:24,138 INFO L226 Difference]: Without dead ends: 7829 [2025-03-08 07:31:24,147 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:31:24,148 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 689 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:24,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1458 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7829 states. [2025-03-08 07:31:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7829 to 7126. [2025-03-08 07:31:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7126 states, 6201 states have (on average 1.5328172875342687) internal successors, (9505), 6423 states have internal predecessors, (9505), 475 states have call successors, (475), 235 states have call predecessors, (475), 448 states have return successors, (1527), 499 states have call predecessors, (1527), 474 states have call successors, (1527) [2025-03-08 07:31:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7126 states to 7126 states and 11507 transitions. [2025-03-08 07:31:24,621 INFO L78 Accepts]: Start accepts. Automaton has 7126 states and 11507 transitions. Word has length 88 [2025-03-08 07:31:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:24,621 INFO L471 AbstractCegarLoop]: Abstraction has 7126 states and 11507 transitions. [2025-03-08 07:31:24,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 7126 states and 11507 transitions. [2025-03-08 07:31:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:24,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:24,633 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] [2025-03-08 07:31:24,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:31:24,633 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:24,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash 829336731, now seen corresponding path program 1 times [2025-03-08 07:31:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322155120] [2025-03-08 07:31:24,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:24,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:24,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:24,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:24,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:24,725 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:31:24,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:24,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322155120] [2025-03-08 07:31:24,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322155120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:24,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:24,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183082781] [2025-03-08 07:31:24,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:24,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:24,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:24,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:24,727 INFO L87 Difference]: Start difference. First operand 7126 states and 11507 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:25,651 INFO L93 Difference]: Finished difference Result 21753 states and 37377 transitions. [2025-03-08 07:31:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:25,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:25,733 INFO L225 Difference]: With dead ends: 21753 [2025-03-08 07:31:25,733 INFO L226 Difference]: Without dead ends: 15449 [2025-03-08 07:31:25,755 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:31:25,756 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 653 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:25,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1442 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15449 states. [2025-03-08 07:31:26,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15449 to 14237. [2025-03-08 07:31:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14237 states, 12298 states have (on average 1.5622865506586436) internal successors, (19213), 12974 states have internal predecessors, (19213), 843 states have call successors, (843), 427 states have call predecessors, (843), 1094 states have return successors, (4967), 899 states have call predecessors, (4967), 842 states have call successors, (4967) [2025-03-08 07:31:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14237 states to 14237 states and 25023 transitions. [2025-03-08 07:31:26,756 INFO L78 Accepts]: Start accepts. Automaton has 14237 states and 25023 transitions. Word has length 88 [2025-03-08 07:31:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:26,756 INFO L471 AbstractCegarLoop]: Abstraction has 14237 states and 25023 transitions. [2025-03-08 07:31:26,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14237 states and 25023 transitions. [2025-03-08 07:31:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:26,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:26,767 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] [2025-03-08 07:31:26,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:31:26,767 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:26,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash 221259868, now seen corresponding path program 1 times [2025-03-08 07:31:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180446376] [2025-03-08 07:31:26,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:26,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:26,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:26,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:26,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:26,864 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:31:26,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:26,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180446376] [2025-03-08 07:31:26,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180446376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:26,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:26,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:26,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664024693] [2025-03-08 07:31:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:26,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:26,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:26,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:26,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:26,865 INFO L87 Difference]: Start difference. First operand 14237 states and 25023 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:28,428 INFO L93 Difference]: Finished difference Result 44052 states and 84527 transitions. [2025-03-08 07:31:28,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:28,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:28,568 INFO L225 Difference]: With dead ends: 44052 [2025-03-08 07:31:28,568 INFO L226 Difference]: Without dead ends: 30637 [2025-03-08 07:31:28,617 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:31:28,618 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 586 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:28,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1420 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30637 states. [2025-03-08 07:31:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30637 to 29463. [2025-03-08 07:31:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29463 states, 25042 states have (on average 1.5670872933471767) internal successors, (39243), 27112 states have internal predecessors, (39243), 1547 states have call successors, (1547), 811 states have call predecessors, (1547), 2872 states have return successors, (17959), 1667 states have call predecessors, (17959), 1546 states have call successors, (17959) [2025-03-08 07:31:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29463 states to 29463 states and 58749 transitions. [2025-03-08 07:31:31,089 INFO L78 Accepts]: Start accepts. Automaton has 29463 states and 58749 transitions. Word has length 88 [2025-03-08 07:31:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:31,090 INFO L471 AbstractCegarLoop]: Abstraction has 29463 states and 58749 transitions. [2025-03-08 07:31:31,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 29463 states and 58749 transitions. [2025-03-08 07:31:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:31,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:31,106 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] [2025-03-08 07:31:31,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:31:31,106 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:31,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1525653597, now seen corresponding path program 1 times [2025-03-08 07:31:31,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065986246] [2025-03-08 07:31:31,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:31,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:31,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:31,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:31,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:31,184 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:31:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:31,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065986246] [2025-03-08 07:31:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065986246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051607555] [2025-03-08 07:31:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:31,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:31,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:31,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:31,186 INFO L87 Difference]: Start difference. First operand 29463 states and 58749 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:34,583 INFO L93 Difference]: Finished difference Result 91850 states and 210147 transitions. [2025-03-08 07:31:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:35,022 INFO L225 Difference]: With dead ends: 91850 [2025-03-08 07:31:35,022 INFO L226 Difference]: Without dead ends: 63209 [2025-03-08 07:31:35,132 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:31:35,133 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 551 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:35,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1408 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63209 states. [2025-03-08 07:31:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63209 to 61910. [2025-03-08 07:31:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61910 states, 51131 states have (on average 1.5472218419354207) internal successors, (79111), 57447 states have internal predecessors, (79111), 2891 states have call successors, (2891), 1579 states have call predecessors, (2891), 7886 states have return successors, (68455), 3139 states have call predecessors, (68455), 2890 states have call successors, (68455) [2025-03-08 07:31:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61910 states to 61910 states and 150457 transitions. [2025-03-08 07:31:40,518 INFO L78 Accepts]: Start accepts. Automaton has 61910 states and 150457 transitions. Word has length 88 [2025-03-08 07:31:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:40,518 INFO L471 AbstractCegarLoop]: Abstraction has 61910 states and 150457 transitions. [2025-03-08 07:31:40,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:40,519 INFO L276 IsEmpty]: Start isEmpty. Operand 61910 states and 150457 transitions. [2025-03-08 07:31:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:31:40,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:40,762 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] [2025-03-08 07:31:40,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:31:40,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:40,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:40,763 INFO L85 PathProgramCache]: Analyzing trace with hash -649026500, now seen corresponding path program 1 times [2025-03-08 07:31:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:40,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903688552] [2025-03-08 07:31:40,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:40,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:40,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:31:40,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:31:40,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:40,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:40,802 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:31:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:40,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903688552] [2025-03-08 07:31:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903688552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:40,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:31:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584750006] [2025-03-08 07:31:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:40,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:31:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:40,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:31:40,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:31:40,804 INFO L87 Difference]: Start difference. First operand 61910 states and 150457 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:46,532 INFO L93 Difference]: Finished difference Result 157321 states and 380648 transitions. [2025-03-08 07:31:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:31:46,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-03-08 07:31:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:47,222 INFO L225 Difference]: With dead ends: 157321 [2025-03-08 07:31:47,222 INFO L226 Difference]: Without dead ends: 96234 [2025-03-08 07:31:47,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:31:47,460 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 536 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:47,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1076 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:31:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96234 states. [2025-03-08 07:31:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96234 to 88329. [2025-03-08 07:31:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88329 states, 73230 states have (on average 1.5350539396422231) internal successors, (112412), 81735 states have internal predecessors, (112412), 4377 states have call successors, (4377), 2353 states have call predecessors, (4377), 10720 states have return successors, (86198), 4496 states have call predecessors, (86198), 4376 states have call successors, (86198) [2025-03-08 07:31:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88329 states to 88329 states and 202987 transitions. [2025-03-08 07:31:55,635 INFO L78 Accepts]: Start accepts. Automaton has 88329 states and 202987 transitions. Word has length 88 [2025-03-08 07:31:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:55,635 INFO L471 AbstractCegarLoop]: Abstraction has 88329 states and 202987 transitions. [2025-03-08 07:31:55,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 88329 states and 202987 transitions. [2025-03-08 07:31:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 07:31:55,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:55,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:31:55,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:31:55,669 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:55,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1602715701, now seen corresponding path program 1 times [2025-03-08 07:31:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930933645] [2025-03-08 07:31:55,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:55,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:55,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:31:55,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:31:55,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:55,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 07:31:55,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930933645] [2025-03-08 07:31:55,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930933645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098002136] [2025-03-08 07:31:55,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:55,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:55,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:55,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:31:55,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:31:55,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:31:55,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:31:55,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:55,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:55,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:31:55,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 07:31:55,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:31:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098002136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:31:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:31:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972702592] [2025-03-08 07:31:55,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:55,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:55,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:55,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:55,810 INFO L87 Difference]: Start difference. First operand 88329 states and 202987 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)