./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.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_2.cil-1+token_ring.02.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 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:32:41,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:32:42,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:32:42,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:32:42,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:32:42,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:32:42,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:32:42,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:32:42,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:32:42,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:32:42,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:32:42,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:32:42,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:32:42,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:32:42,036 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:32:42,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:32:42,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:32:42,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:32:42,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:32:42,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:32:42,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:32:42,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:32:42,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:32:42,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:32:42,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:32:42,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:32:42,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:32:42,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:32:42,038 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 -> 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 [2025-03-08 07:32:42,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:32:42,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:32:42,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:32:42,252 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:32:42,253 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:32:42,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2025-03-08 07:32:43,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32908e8c0/56092e66da0841e8adb3ce3d367760bf/FLAG4a0f1edce [2025-03-08 07:32:43,634 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:32:43,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2025-03-08 07:32:43,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32908e8c0/56092e66da0841e8adb3ce3d367760bf/FLAG4a0f1edce [2025-03-08 07:32:43,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32908e8c0/56092e66da0841e8adb3ce3d367760bf [2025-03-08 07:32:43,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:32:43,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:32:43,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:32:43,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:32:43,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:32:43,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:43" (1/1) ... [2025-03-08 07:32:43,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e2ce4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:43, skipping insertion in model container [2025-03-08 07:32:43,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:43" (1/1) ... [2025-03-08 07:32:44,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:32:44,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2025-03-08 07:32:44,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2025-03-08 07:32:44,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:32:44,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:32:44,196 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2025-03-08 07:32:44,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2025-03-08 07:32:44,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:32:44,240 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:32:44,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44 WrapperNode [2025-03-08 07:32:44,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:32:44,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:32:44,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:32:44,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:32:44,247 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:32:44" (1/1) ... [2025-03-08 07:32:44,259 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:32:44" (1/1) ... [2025-03-08 07:32:44,284 INFO L138 Inliner]: procedures = 57, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 441 [2025-03-08 07:32:44,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:32:44,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:32:44,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:32:44,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:32:44,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,304 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:32:44,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:32:44,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:32:44,313 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:32:44,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:32:44,314 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (1/1) ... [2025-03-08 07:32:44,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:32:44,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:44,338 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:32:44,340 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:32:44,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:32:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:32:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:32:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:32:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:32:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:32:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:32:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:32:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:32:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:32:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:32:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:32:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:32:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:32:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:32:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:32:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:32:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:32:44,356 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:32:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:32:44,356 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:32:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:32:44,356 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:32:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:32:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:32:44,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:32:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:32:44,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:32:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:32:44,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:32:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:32:44,356 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:32:44,434 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:32:44,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:32:44,909 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-08 07:32:44,909 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:32:44,920 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:32:44,920 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:32:44,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:44 BoogieIcfgContainer [2025-03-08 07:32:44,921 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:32:44,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:32:44,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:32:44,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:32:44,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:32:43" (1/3) ... [2025-03-08 07:32:44,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a73d96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:44, skipping insertion in model container [2025-03-08 07:32:44,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:44" (2/3) ... [2025-03-08 07:32:44,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a73d96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:44, skipping insertion in model container [2025-03-08 07:32:44,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:44" (3/3) ... [2025-03-08 07:32:44,927 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2025-03-08 07:32:44,938 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:32:44,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c that has 15 procedures, 227 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-08 07:32:44,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:32:45,004 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;@3134d86d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:32:45,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:32:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 182 states have (on average 1.5054945054945055) internal successors, (274), 186 states have internal predecessors, (274), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 07:32:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:32:45,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:45,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:45,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:45,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:45,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1850954776, now seen corresponding path program 1 times [2025-03-08 07:32:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:45,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758760720] [2025-03-08 07:32:45,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:45,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:45,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:32:45,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:32:45,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:45,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:45,359 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:32:45,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:45,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758760720] [2025-03-08 07:32:45,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758760720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:45,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:45,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282159384] [2025-03-08 07:32:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:45,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:45,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:45,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:45,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:45,385 INFO L87 Difference]: Start difference. First operand has 227 states, 182 states have (on average 1.5054945054945055) internal successors, (274), 186 states have internal predecessors, (274), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:32:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:45,884 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2025-03-08 07:32:45,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:32:45,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:32:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:45,893 INFO L225 Difference]: With dead ends: 535 [2025-03-08 07:32:45,893 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 07:32:45,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:45,897 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 276 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:45,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 760 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 07:32:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 309. [2025-03-08 07:32:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 244 states have (on average 1.4508196721311475) internal successors, (354), 250 states have internal predecessors, (354), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2025-03-08 07:32:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 439 transitions. [2025-03-08 07:32:45,953 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 439 transitions. Word has length 62 [2025-03-08 07:32:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:45,954 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 439 transitions. [2025-03-08 07:32:45,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:32:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 439 transitions. [2025-03-08 07:32:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:32:45,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:45,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:45,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:32:45,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:45,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1279342428, now seen corresponding path program 1 times [2025-03-08 07:32:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:45,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576231957] [2025-03-08 07:32:45,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:45,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:32:45,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:32:45,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:45,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:46,112 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:32:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:46,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576231957] [2025-03-08 07:32:46,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576231957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:46,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:46,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:46,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411696515] [2025-03-08 07:32:46,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:46,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:46,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:46,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:46,115 INFO L87 Difference]: Start difference. First operand 309 states and 439 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:32:46,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:46,639 INFO L93 Difference]: Finished difference Result 614 states and 858 transitions. [2025-03-08 07:32:46,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:46,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:32:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:46,643 INFO L225 Difference]: With dead ends: 614 [2025-03-08 07:32:46,643 INFO L226 Difference]: Without dead ends: 445 [2025-03-08 07:32:46,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:32:46,645 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 471 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:46,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 914 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-08 07:32:46,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 401. [2025-03-08 07:32:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 316 states have (on average 1.4367088607594938) internal successors, (454), 324 states have internal predecessors, (454), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (63), 52 states have call predecessors, (63), 50 states have call successors, (63) [2025-03-08 07:32:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 569 transitions. [2025-03-08 07:32:46,695 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 569 transitions. Word has length 62 [2025-03-08 07:32:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:46,695 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 569 transitions. [2025-03-08 07:32:46,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:32:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 569 transitions. [2025-03-08 07:32:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:32:46,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:46,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:46,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:32:46,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:46,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2046043845, now seen corresponding path program 1 times [2025-03-08 07:32:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:46,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800311172] [2025-03-08 07:32:46,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:46,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:32:46,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:32:46,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:46,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:46,784 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:32:46,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800311172] [2025-03-08 07:32:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800311172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:46,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:46,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:46,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792192227] [2025-03-08 07:32:46,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:46,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:46,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:46,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:46,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:46,786 INFO L87 Difference]: Start difference. First operand 401 states and 569 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:32:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:46,820 INFO L93 Difference]: Finished difference Result 661 states and 930 transitions. [2025-03-08 07:32:46,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:32:46,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-03-08 07:32:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:46,824 INFO L225 Difference]: With dead ends: 661 [2025-03-08 07:32:46,824 INFO L226 Difference]: Without dead ends: 406 [2025-03-08 07:32:46,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:46,826 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 0 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:46,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1535 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-08 07:32:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-03-08 07:32:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 320 states have (on average 1.425) internal successors, (456), 328 states have internal predecessors, (456), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (64), 53 states have call predecessors, (64), 50 states have call successors, (64) [2025-03-08 07:32:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 572 transitions. [2025-03-08 07:32:46,854 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 572 transitions. Word has length 62 [2025-03-08 07:32:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:46,854 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 572 transitions. [2025-03-08 07:32:46,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:32:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 572 transitions. [2025-03-08 07:32:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:32:46,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:46,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:46,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:32:46,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:46,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash -320562948, now seen corresponding path program 1 times [2025-03-08 07:32:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:46,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24221679] [2025-03-08 07:32:46,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:46,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:46,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:32:46,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:32:46,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:46,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:46,936 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:32:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24221679] [2025-03-08 07:32:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24221679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:46,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:46,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:32:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199037922] [2025-03-08 07:32:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:46,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:32:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:46,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:32:46,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:32:46,938 INFO L87 Difference]: Start difference. First operand 406 states and 572 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:32:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:47,789 INFO L93 Difference]: Finished difference Result 1588 states and 2208 transitions. [2025-03-08 07:32:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:32:47,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-03-08 07:32:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:47,799 INFO L225 Difference]: With dead ends: 1588 [2025-03-08 07:32:47,799 INFO L226 Difference]: Without dead ends: 1310 [2025-03-08 07:32:47,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:32:47,802 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 1541 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:47,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 1059 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:32:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-03-08 07:32:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1262. [2025-03-08 07:32:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 990 states have (on average 1.3636363636363635) internal successors, (1350), 1013 states have internal predecessors, (1350), 140 states have call successors, (140), 111 states have call predecessors, (140), 130 states have return successors, (178), 140 states have call predecessors, (178), 138 states have call successors, (178) [2025-03-08 07:32:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1668 transitions. [2025-03-08 07:32:47,889 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1668 transitions. Word has length 62 [2025-03-08 07:32:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:47,890 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1668 transitions. [2025-03-08 07:32:47,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:32:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1668 transitions. [2025-03-08 07:32:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:32:47,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:47,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:47,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:32:47,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:47,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1262700633, now seen corresponding path program 1 times [2025-03-08 07:32:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86252344] [2025-03-08 07:32:47,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:47,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:47,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:32:47,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:32:47,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:47,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:47,988 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:32:47,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:47,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86252344] [2025-03-08 07:32:47,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86252344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:47,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:47,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894502994] [2025-03-08 07:32:47,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:47,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:47,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:47,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:47,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:47,990 INFO L87 Difference]: Start difference. First operand 1262 states and 1668 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:32:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:48,052 INFO L93 Difference]: Finished difference Result 2420 states and 3189 transitions. [2025-03-08 07:32:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:32:48,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-03-08 07:32:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:48,061 INFO L225 Difference]: With dead ends: 2420 [2025-03-08 07:32:48,061 INFO L226 Difference]: Without dead ends: 1292 [2025-03-08 07:32:48,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:48,064 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 0 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:48,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1535 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-03-08 07:32:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2025-03-08 07:32:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1014 states have (on average 1.3471400394477318) internal successors, (1366), 1037 states have internal predecessors, (1366), 140 states have call successors, (140), 111 states have call predecessors, (140), 136 states have return successors, (184), 146 states have call predecessors, (184), 138 states have call successors, (184) [2025-03-08 07:32:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1690 transitions. [2025-03-08 07:32:48,132 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1690 transitions. Word has length 62 [2025-03-08 07:32:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:48,133 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1690 transitions. [2025-03-08 07:32:48,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:32:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1690 transitions. [2025-03-08 07:32:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:32:48,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:48,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:48,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:32:48,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:48,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1293720440, now seen corresponding path program 1 times [2025-03-08 07:32:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:48,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403099329] [2025-03-08 07:32:48,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:48,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:48,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:32:48,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:32:48,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:48,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:48,276 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:32:48,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:48,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403099329] [2025-03-08 07:32:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403099329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:48,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:48,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613544671] [2025-03-08 07:32:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:48,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:48,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:48,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:48,278 INFO L87 Difference]: Start difference. First operand 1292 states and 1690 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:32:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:48,792 INFO L93 Difference]: Finished difference Result 2464 states and 3146 transitions. [2025-03-08 07:32:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:32:48,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:32:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:48,799 INFO L225 Difference]: With dead ends: 2464 [2025-03-08 07:32:48,800 INFO L226 Difference]: Without dead ends: 1518 [2025-03-08 07:32:48,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:48,803 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 456 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:48,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 715 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2025-03-08 07:32:48,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1237. [2025-03-08 07:32:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 975 states have (on average 1.3415384615384616) internal successors, (1308), 993 states have internal predecessors, (1308), 134 states have call successors, (134), 106 states have call predecessors, (134), 126 states have return successors, (169), 139 states have call predecessors, (169), 132 states have call successors, (169) [2025-03-08 07:32:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1611 transitions. [2025-03-08 07:32:48,898 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1611 transitions. Word has length 62 [2025-03-08 07:32:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:48,898 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1611 transitions. [2025-03-08 07:32:48,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:32:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1611 transitions. [2025-03-08 07:32:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:32:48,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:48,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:48,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:32:48,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:48,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1505071353, now seen corresponding path program 1 times [2025-03-08 07:32:48,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:48,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291762407] [2025-03-08 07:32:48,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:48,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:48,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:32:48,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:32:48,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:48,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:48,944 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:32:48,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:48,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291762407] [2025-03-08 07:32:48,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291762407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:48,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:48,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:32:48,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203469511] [2025-03-08 07:32:48,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:48,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:32:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:48,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:32:48,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:32:48,946 INFO L87 Difference]: Start difference. First operand 1237 states and 1611 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:32:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:49,261 INFO L93 Difference]: Finished difference Result 3368 states and 4350 transitions. [2025-03-08 07:32:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:32:49,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:32:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:49,271 INFO L225 Difference]: With dead ends: 3368 [2025-03-08 07:32:49,272 INFO L226 Difference]: Without dead ends: 2266 [2025-03-08 07:32:49,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:49,275 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 417 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:49,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 368 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2025-03-08 07:32:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2262. [2025-03-08 07:32:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2262 states, 1757 states have (on average 1.2874217416050084) internal successors, (2262), 1792 states have internal predecessors, (2262), 253 states have call successors, (253), 205 states have call predecessors, (253), 250 states have return successors, (360), 267 states have call predecessors, (360), 251 states have call successors, (360) [2025-03-08 07:32:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2875 transitions. [2025-03-08 07:32:49,400 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2875 transitions. Word has length 62 [2025-03-08 07:32:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:49,401 INFO L471 AbstractCegarLoop]: Abstraction has 2262 states and 2875 transitions. [2025-03-08 07:32:49,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:32:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2875 transitions. [2025-03-08 07:32:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:32:49,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:49,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:49,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:32:49,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:49,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1895491653, now seen corresponding path program 1 times [2025-03-08 07:32:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132150999] [2025-03-08 07:32:49,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:49,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:49,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:49,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:49,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:49,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:49,448 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:32:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:49,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132150999] [2025-03-08 07:32:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132150999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:49,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:49,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547047788] [2025-03-08 07:32:49,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:49,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:49,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:49,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:49,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:49,452 INFO L87 Difference]: Start difference. First operand 2262 states and 2875 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:32:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:49,584 INFO L93 Difference]: Finished difference Result 5246 states and 6660 transitions. [2025-03-08 07:32:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:49,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-08 07:32:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:49,601 INFO L225 Difference]: With dead ends: 5246 [2025-03-08 07:32:49,601 INFO L226 Difference]: Without dead ends: 3124 [2025-03-08 07:32:49,607 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:32:49,608 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 101 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:49,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 589 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2025-03-08 07:32:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3056. [2025-03-08 07:32:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3056 states, 2365 states have (on average 1.2756871035940804) internal successors, (3017), 2405 states have internal predecessors, (3017), 345 states have call successors, (345), 285 states have call predecessors, (345), 344 states have return successors, (474), 368 states have call predecessors, (474), 343 states have call successors, (474) [2025-03-08 07:32:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 3836 transitions. [2025-03-08 07:32:49,779 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 3836 transitions. Word has length 63 [2025-03-08 07:32:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:49,779 INFO L471 AbstractCegarLoop]: Abstraction has 3056 states and 3836 transitions. [2025-03-08 07:32:49,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:32:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 3836 transitions. [2025-03-08 07:32:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:32:49,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:49,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:49,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:32:49,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:49,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:49,781 INFO L85 PathProgramCache]: Analyzing trace with hash -682149105, now seen corresponding path program 1 times [2025-03-08 07:32:49,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:49,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633697463] [2025-03-08 07:32:49,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:49,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:32:49,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:32:49,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:49,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:49,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633697463] [2025-03-08 07:32:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633697463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:32:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905249987] [2025-03-08 07:32:49,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:49,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:32:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:49,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:32:49,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:32:49,908 INFO L87 Difference]: Start difference. First operand 3056 states and 3836 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:32:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:50,280 INFO L93 Difference]: Finished difference Result 3981 states and 4954 transitions. [2025-03-08 07:32:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:50,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-03-08 07:32:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:50,298 INFO L225 Difference]: With dead ends: 3981 [2025-03-08 07:32:50,298 INFO L226 Difference]: Without dead ends: 3978 [2025-03-08 07:32:50,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:50,301 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 562 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:50,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 412 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:32:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2025-03-08 07:32:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3506. [2025-03-08 07:32:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3506 states, 2708 states have (on average 1.265509601181684) internal successors, (3427), 2751 states have internal predecessors, (3427), 395 states have call successors, (395), 329 states have call predecessors, (395), 401 states have return successors, (551), 428 states have call predecessors, (551), 394 states have call successors, (551) [2025-03-08 07:32:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 4373 transitions. [2025-03-08 07:32:50,547 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 4373 transitions. Word has length 68 [2025-03-08 07:32:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:50,547 INFO L471 AbstractCegarLoop]: Abstraction has 3506 states and 4373 transitions. [2025-03-08 07:32:50,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:32:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 4373 transitions. [2025-03-08 07:32:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:32:50,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:50,549 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] [2025-03-08 07:32:50,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:32:50,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:50,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1829721532, now seen corresponding path program 1 times [2025-03-08 07:32:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646685123] [2025-03-08 07:32:50,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:50,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:32:50,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:32:50,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:50,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:50,617 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:32:50,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:50,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646685123] [2025-03-08 07:32:50,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646685123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:50,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424059630] [2025-03-08 07:32:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:50,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:50,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:50,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:50,619 INFO L87 Difference]: Start difference. First operand 3506 states and 4373 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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:32:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:51,052 INFO L93 Difference]: Finished difference Result 3744 states and 4727 transitions. [2025-03-08 07:32:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:32:51,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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 66 [2025-03-08 07:32:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:51,065 INFO L225 Difference]: With dead ends: 3744 [2025-03-08 07:32:51,065 INFO L226 Difference]: Without dead ends: 3629 [2025-03-08 07:32:51,066 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:32:51,066 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 462 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:51,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 635 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:32:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2025-03-08 07:32:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3620. [2025-03-08 07:32:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 2804 states have (on average 1.2735378031383737) internal successors, (3571), 2848 states have internal predecessors, (3571), 406 states have call successors, (406), 335 states have call predecessors, (406), 408 states have return successors, (563), 439 states have call predecessors, (563), 405 states have call successors, (563) [2025-03-08 07:32:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 4540 transitions. [2025-03-08 07:32:51,269 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 4540 transitions. Word has length 66 [2025-03-08 07:32:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:51,269 INFO L471 AbstractCegarLoop]: Abstraction has 3620 states and 4540 transitions. [2025-03-08 07:32:51,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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:32:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 4540 transitions. [2025-03-08 07:32:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:32:51,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:51,271 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] [2025-03-08 07:32:51,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:32:51,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:51,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1148952702, now seen corresponding path program 1 times [2025-03-08 07:32:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733447947] [2025-03-08 07:32:51,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:51,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:32:51,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:32:51,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:51,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:51,366 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:32:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733447947] [2025-03-08 07:32:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733447947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:51,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:51,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771739089] [2025-03-08 07:32:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:51,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:51,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:51,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:51,369 INFO L87 Difference]: Start difference. First operand 3620 states and 4540 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:52,074 INFO L93 Difference]: Finished difference Result 3989 states and 5086 transitions. [2025-03-08 07:32:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-08 07:32:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:52,086 INFO L225 Difference]: With dead ends: 3989 [2025-03-08 07:32:52,086 INFO L226 Difference]: Without dead ends: 3760 [2025-03-08 07:32:52,087 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:32:52,088 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 452 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:52,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1075 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2025-03-08 07:32:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3727. [2025-03-08 07:32:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3727 states, 2893 states have (on average 1.2792948496370549) internal successors, (3701), 2938 states have internal predecessors, (3701), 417 states have call successors, (417), 341 states have call predecessors, (417), 415 states have return successors, (577), 451 states have call predecessors, (577), 416 states have call successors, (577) [2025-03-08 07:32:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 4695 transitions. [2025-03-08 07:32:52,329 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 4695 transitions. Word has length 66 [2025-03-08 07:32:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:52,329 INFO L471 AbstractCegarLoop]: Abstraction has 3727 states and 4695 transitions. [2025-03-08 07:32:52,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 4695 transitions. [2025-03-08 07:32:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:32:52,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:52,331 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] [2025-03-08 07:32:52,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:32:52,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:52,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1918122717, now seen corresponding path program 1 times [2025-03-08 07:32:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:52,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280407851] [2025-03-08 07:32:52,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:52,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:32:52,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:32:52,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:52,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:52,409 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:32:52,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280407851] [2025-03-08 07:32:52,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280407851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:52,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:52,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420897750] [2025-03-08 07:32:52,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:52,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:52,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:52,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:52,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:52,411 INFO L87 Difference]: Start difference. First operand 3727 states and 4695 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:52,991 INFO L93 Difference]: Finished difference Result 4320 states and 5570 transitions. [2025-03-08 07:32:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:52,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-08 07:32:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:53,006 INFO L225 Difference]: With dead ends: 4320 [2025-03-08 07:32:53,006 INFO L226 Difference]: Without dead ends: 3984 [2025-03-08 07:32:53,009 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:32:53,009 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 447 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:53,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1059 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2025-03-08 07:32:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3950. [2025-03-08 07:32:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3950 states, 3078 states have (on average 1.290448343079922) internal successors, (3972), 3127 states have internal predecessors, (3972), 439 states have call successors, (439), 353 states have call predecessors, (439), 431 states have return successors, (611), 475 states have call predecessors, (611), 438 states have call successors, (611) [2025-03-08 07:32:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5022 transitions. [2025-03-08 07:32:53,237 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5022 transitions. Word has length 66 [2025-03-08 07:32:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:53,238 INFO L471 AbstractCegarLoop]: Abstraction has 3950 states and 5022 transitions. [2025-03-08 07:32:53,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5022 transitions. [2025-03-08 07:32:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:32:53,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:53,240 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] [2025-03-08 07:32:53,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:32:53,241 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1243653986, now seen corresponding path program 1 times [2025-03-08 07:32:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115922749] [2025-03-08 07:32:53,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:32:53,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:32:53,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:53,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:53,332 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:32:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115922749] [2025-03-08 07:32:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115922749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:53,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:53,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854020205] [2025-03-08 07:32:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:53,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:53,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:53,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:53,333 INFO L87 Difference]: Start difference. First operand 3950 states and 5022 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:54,094 INFO L93 Difference]: Finished difference Result 5089 states and 6712 transitions. [2025-03-08 07:32:54,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:54,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-08 07:32:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:54,113 INFO L225 Difference]: With dead ends: 5089 [2025-03-08 07:32:54,114 INFO L226 Difference]: Without dead ends: 4530 [2025-03-08 07:32:54,118 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:32:54,118 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 516 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:54,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1034 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states. [2025-03-08 07:32:54,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 4405. [2025-03-08 07:32:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4405 states, 3455 states have (on average 1.310564399421129) internal successors, (4528), 3518 states have internal predecessors, (4528), 479 states have call successors, (479), 377 states have call predecessors, (479), 469 states have return successors, (699), 519 states have call predecessors, (699), 478 states have call successors, (699) [2025-03-08 07:32:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 4405 states and 5706 transitions. [2025-03-08 07:32:54,371 INFO L78 Accepts]: Start accepts. Automaton has 4405 states and 5706 transitions. Word has length 66 [2025-03-08 07:32:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:54,371 INFO L471 AbstractCegarLoop]: Abstraction has 4405 states and 5706 transitions. [2025-03-08 07:32:54,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4405 states and 5706 transitions. [2025-03-08 07:32:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:32:54,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:54,373 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] [2025-03-08 07:32:54,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:32:54,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:54,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1484194115, now seen corresponding path program 1 times [2025-03-08 07:32:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:54,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813162357] [2025-03-08 07:32:54,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:54,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:54,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:32:54,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:32:54,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:54,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:54,435 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:32:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813162357] [2025-03-08 07:32:54,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813162357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:54,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:54,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83975006] [2025-03-08 07:32:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:54,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:54,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:54,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:54,437 INFO L87 Difference]: Start difference. First operand 4405 states and 5706 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:55,097 INFO L93 Difference]: Finished difference Result 6516 states and 8918 transitions. [2025-03-08 07:32:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-08 07:32:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:55,121 INFO L225 Difference]: With dead ends: 6516 [2025-03-08 07:32:55,121 INFO L226 Difference]: Without dead ends: 5502 [2025-03-08 07:32:55,127 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:32:55,127 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 480 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:55,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1018 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5502 states. [2025-03-08 07:32:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5502 to 5316. [2025-03-08 07:32:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5316 states, 4196 states have (on average 1.336510962821735) internal successors, (5608), 4305 states have internal predecessors, (5608), 555 states have call successors, (555), 425 states have call predecessors, (555), 563 states have return successors, (967), 603 states have call predecessors, (967), 554 states have call successors, (967) [2025-03-08 07:32:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 7130 transitions. [2025-03-08 07:32:55,432 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 7130 transitions. Word has length 66 [2025-03-08 07:32:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:55,432 INFO L471 AbstractCegarLoop]: Abstraction has 5316 states and 7130 transitions. [2025-03-08 07:32:55,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 7130 transitions. [2025-03-08 07:32:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:32:55,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:55,435 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] [2025-03-08 07:32:55,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:32:55,435 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:55,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:55,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1491953474, now seen corresponding path program 1 times [2025-03-08 07:32:55,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:55,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13689170] [2025-03-08 07:32:55,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:55,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:55,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:32:55,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:32:55,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:55,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:55,500 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:32:55,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:55,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13689170] [2025-03-08 07:32:55,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13689170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:55,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:55,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:55,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359435116] [2025-03-08 07:32:55,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:55,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:55,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:55,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:55,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:55,502 INFO L87 Difference]: Start difference. First operand 5316 states and 7130 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:56,358 INFO L93 Difference]: Finished difference Result 9307 states and 13528 transitions. [2025-03-08 07:32:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:56,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-08 07:32:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:56,384 INFO L225 Difference]: With dead ends: 9307 [2025-03-08 07:32:56,385 INFO L226 Difference]: Without dead ends: 7382 [2025-03-08 07:32:56,391 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:32:56,391 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 446 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:56,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1010 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2025-03-08 07:32:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7215. [2025-03-08 07:32:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7215 states, 5717 states have (on average 1.3636522651740424) internal successors, (7796), 5972 states have internal predecessors, (7796), 695 states have call successors, (695), 517 states have call predecessors, (695), 801 states have return successors, (1875), 759 states have call predecessors, (1875), 694 states have call successors, (1875) [2025-03-08 07:32:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7215 states to 7215 states and 10366 transitions. [2025-03-08 07:32:56,863 INFO L78 Accepts]: Start accepts. Automaton has 7215 states and 10366 transitions. Word has length 66 [2025-03-08 07:32:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:56,863 INFO L471 AbstractCegarLoop]: Abstraction has 7215 states and 10366 transitions. [2025-03-08 07:32:56,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:32:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7215 states and 10366 transitions. [2025-03-08 07:32:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 07:32:56,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:56,867 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] [2025-03-08 07:32:56,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:32:56,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:56,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:56,867 INFO L85 PathProgramCache]: Analyzing trace with hash -522372451, now seen corresponding path program 1 times [2025-03-08 07:32:56,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:56,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95591238] [2025-03-08 07:32:56,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:56,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:56,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 07:32:56,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 07:32:56,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:56,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:56,908 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:32:56,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:56,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95591238] [2025-03-08 07:32:56,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95591238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:56,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:56,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:32:56,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727050102] [2025-03-08 07:32:56,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:56,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:32:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:56,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:32:56,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:32:56,911 INFO L87 Difference]: Start difference. First operand 7215 states and 10366 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:32:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:57,441 INFO L93 Difference]: Finished difference Result 13096 states and 19911 transitions. [2025-03-08 07:32:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:57,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 66 [2025-03-08 07:32:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:57,470 INFO L225 Difference]: With dead ends: 13096 [2025-03-08 07:32:57,470 INFO L226 Difference]: Without dead ends: 9273 [2025-03-08 07:32:57,483 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:32:57,484 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 429 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:57,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 826 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:32:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2025-03-08 07:32:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 9040. [2025-03-08 07:32:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9040 states, 7202 states have (on average 1.3675367953346294) internal successors, (9849), 7540 states have internal predecessors, (9849), 867 states have call successors, (867), 619 states have call predecessors, (867), 969 states have return successors, (2288), 914 states have call predecessors, (2288), 866 states have call successors, (2288) [2025-03-08 07:32:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9040 states to 9040 states and 13004 transitions. [2025-03-08 07:32:58,318 INFO L78 Accepts]: Start accepts. Automaton has 9040 states and 13004 transitions. Word has length 66 [2025-03-08 07:32:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:58,318 INFO L471 AbstractCegarLoop]: Abstraction has 9040 states and 13004 transitions. [2025-03-08 07:32:58,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:32:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 9040 states and 13004 transitions. [2025-03-08 07:32:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:32:58,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:58,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:32:58,322 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:58,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash 327928769, now seen corresponding path program 1 times [2025-03-08 07:32:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:58,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934642104] [2025-03-08 07:32:58,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:58,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:32:58,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:32:58,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:58,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934642104] [2025-03-08 07:32:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934642104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366889077] [2025-03-08 07:32:58,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:58,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:58,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:58,403 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:32:58,405 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:32:58,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:32:58,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:32:58,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:58,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:58,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:32:58,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:58,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:32:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:58,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366889077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:32:58,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:32:58,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-08 07:32:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840023359] [2025-03-08 07:32:58,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:32:58,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:32:58,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:58,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:32:58,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:32:58,790 INFO L87 Difference]: Start difference. First operand 9040 states and 13004 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 07:32:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:59,780 INFO L93 Difference]: Finished difference Result 12864 states and 17680 transitions. [2025-03-08 07:32:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:32:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 69 [2025-03-08 07:32:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:59,820 INFO L225 Difference]: With dead ends: 12864 [2025-03-08 07:32:59,820 INFO L226 Difference]: Without dead ends: 12861 [2025-03-08 07:32:59,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:32:59,825 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 777 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:59,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1729 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2025-03-08 07:33:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12480. [2025-03-08 07:33:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12480 states, 9864 states have (on average 1.3320154095701542) internal successors, (13139), 10237 states have internal predecessors, (13139), 1244 states have call successors, (1244), 949 states have call predecessors, (1244), 1370 states have return successors, (2813), 1327 states have call predecessors, (2813), 1243 states have call successors, (2813) [2025-03-08 07:33:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12480 states to 12480 states and 17196 transitions. [2025-03-08 07:33:00,686 INFO L78 Accepts]: Start accepts. Automaton has 12480 states and 17196 transitions. Word has length 69 [2025-03-08 07:33:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:00,686 INFO L471 AbstractCegarLoop]: Abstraction has 12480 states and 17196 transitions. [2025-03-08 07:33:00,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 07:33:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 12480 states and 17196 transitions. [2025-03-08 07:33:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:33:00,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:00,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:00,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:33:00,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 07:33:00,896 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:00,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:00,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1464077796, now seen corresponding path program 2 times [2025-03-08 07:33:00,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:00,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182883005] [2025-03-08 07:33:00,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:33:00,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:00,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 07:33:00,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 07:33:00,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:33:00,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:00,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:00,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182883005] [2025-03-08 07:33:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182883005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:00,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273945072] [2025-03-08 07:33:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:00,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:00,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:00,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:00,930 INFO L87 Difference]: Start difference. First operand 12480 states and 17196 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:01,843 INFO L93 Difference]: Finished difference Result 14775 states and 20089 transitions. [2025-03-08 07:33:01,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:01,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-03-08 07:33:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:01,876 INFO L225 Difference]: With dead ends: 14775 [2025-03-08 07:33:01,876 INFO L226 Difference]: Without dead ends: 8839 [2025-03-08 07:33:01,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:01,891 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 279 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:01,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 495 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2025-03-08 07:33:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8108. [2025-03-08 07:33:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8108 states, 6494 states have (on average 1.3723437018786573) internal successors, (8912), 6813 states have internal predecessors, (8912), 765 states have call successors, (765), 533 states have call predecessors, (765), 847 states have return successors, (2115), 795 states have call predecessors, (2115), 764 states have call successors, (2115) [2025-03-08 07:33:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8108 states to 8108 states and 11792 transitions. [2025-03-08 07:33:02,571 INFO L78 Accepts]: Start accepts. Automaton has 8108 states and 11792 transitions. Word has length 71 [2025-03-08 07:33:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:02,571 INFO L471 AbstractCegarLoop]: Abstraction has 8108 states and 11792 transitions. [2025-03-08 07:33:02,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8108 states and 11792 transitions. [2025-03-08 07:33:02,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:33:02,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:02,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:02,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:33:02,577 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:02,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1570532760, now seen corresponding path program 1 times [2025-03-08 07:33:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:02,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784351667] [2025-03-08 07:33:02,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:02,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:02,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:33:02,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:33:02,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:02,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:33:02,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:02,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784351667] [2025-03-08 07:33:02,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784351667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:02,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:02,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046568996] [2025-03-08 07:33:02,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:02,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:02,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:02,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:02,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:02,644 INFO L87 Difference]: Start difference. First operand 8108 states and 11792 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:03,688 INFO L93 Difference]: Finished difference Result 13028 states and 17805 transitions. [2025-03-08 07:33:03,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 07:33:03,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-03-08 07:33:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:03,724 INFO L225 Difference]: With dead ends: 13028 [2025-03-08 07:33:03,725 INFO L226 Difference]: Without dead ends: 9840 [2025-03-08 07:33:03,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:33:03,736 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 629 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:03,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 919 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9840 states. [2025-03-08 07:33:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9840 to 9663. [2025-03-08 07:33:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9663 states, 7679 states have (on average 1.3406693579893216) internal successors, (10295), 8028 states have internal predecessors, (10295), 940 states have call successors, (940), 687 states have call predecessors, (940), 1042 states have return successors, (2405), 981 states have call predecessors, (2405), 939 states have call successors, (2405) [2025-03-08 07:33:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9663 states to 9663 states and 13640 transitions. [2025-03-08 07:33:04,432 INFO L78 Accepts]: Start accepts. Automaton has 9663 states and 13640 transitions. Word has length 80 [2025-03-08 07:33:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:04,433 INFO L471 AbstractCegarLoop]: Abstraction has 9663 states and 13640 transitions. [2025-03-08 07:33:04,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 9663 states and 13640 transitions. [2025-03-08 07:33:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:33:04,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:04,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:04,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:33:04,439 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:04,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash -347825369, now seen corresponding path program 1 times [2025-03-08 07:33:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:04,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73784635] [2025-03-08 07:33:04,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:04,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:33:04,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:33:04,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:04,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 07:33:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:04,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73784635] [2025-03-08 07:33:04,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73784635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:04,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:04,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:33:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201615390] [2025-03-08 07:33:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:04,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:33:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:04,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:33:04,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:04,507 INFO L87 Difference]: Start difference. First operand 9663 states and 13640 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:05,561 INFO L93 Difference]: Finished difference Result 12610 states and 17215 transitions. [2025-03-08 07:33:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:33:05,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-03-08 07:33:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:05,588 INFO L225 Difference]: With dead ends: 12610 [2025-03-08 07:33:05,588 INFO L226 Difference]: Without dead ends: 8832 [2025-03-08 07:33:05,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:33:05,598 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1068 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:05,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 998 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8832 states. [2025-03-08 07:33:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8832 to 8511. [2025-03-08 07:33:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8511 states, 6785 states have (on average 1.3512159174649963) internal successors, (9168), 7121 states have internal predecessors, (9168), 809 states have call successors, (809), 570 states have call predecessors, (809), 915 states have return successors, (2194), 853 states have call predecessors, (2194), 808 states have call successors, (2194) [2025-03-08 07:33:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8511 states to 8511 states and 12171 transitions. [2025-03-08 07:33:06,135 INFO L78 Accepts]: Start accepts. Automaton has 8511 states and 12171 transitions. Word has length 86 [2025-03-08 07:33:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:06,136 INFO L471 AbstractCegarLoop]: Abstraction has 8511 states and 12171 transitions. [2025-03-08 07:33:06,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 8511 states and 12171 transitions. [2025-03-08 07:33:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 07:33:06,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:06,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:06,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:33:06,151 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:06,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1833880693, now seen corresponding path program 1 times [2025-03-08 07:33:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:06,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200415537] [2025-03-08 07:33:06,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:06,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:06,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 07:33:06,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 07:33:06,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:06,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:33:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:06,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200415537] [2025-03-08 07:33:06,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200415537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:06,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72844309] [2025-03-08 07:33:06,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:06,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:06,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:06,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:33:06,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:33:06,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 07:33:06,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 07:33:06,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:06,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:06,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:33:06,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 07:33:06,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:33:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72844309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:06,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:33:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 07:33:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129389492] [2025-03-08 07:33:06,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:06,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:06,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:06,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:06,308 INFO L87 Difference]: Start difference. First operand 8511 states and 12171 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:07,374 INFO L93 Difference]: Finished difference Result 19616 states and 29621 transitions. [2025-03-08 07:33:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:07,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2025-03-08 07:33:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:07,428 INFO L225 Difference]: With dead ends: 19616 [2025-03-08 07:33:07,428 INFO L226 Difference]: Without dead ends: 13968 [2025-03-08 07:33:07,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:07,447 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 262 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:07,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 459 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13968 states. [2025-03-08 07:33:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13968 to 13916. [2025-03-08 07:33:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13916 states, 11166 states have (on average 1.376768762314168) internal successors, (15373), 11797 states have internal predecessors, (15373), 1263 states have call successors, (1263), 862 states have call predecessors, (1263), 1485 states have return successors, (3882), 1290 states have call predecessors, (3882), 1262 states have call successors, (3882) [2025-03-08 07:33:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13916 states to 13916 states and 20518 transitions. [2025-03-08 07:33:08,397 INFO L78 Accepts]: Start accepts. Automaton has 13916 states and 20518 transitions. Word has length 107 [2025-03-08 07:33:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:08,398 INFO L471 AbstractCegarLoop]: Abstraction has 13916 states and 20518 transitions. [2025-03-08 07:33:08,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 13916 states and 20518 transitions. [2025-03-08 07:33:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 07:33:08,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:08,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:08,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:33:08,614 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,SelfDestructingSolverStorable20 [2025-03-08 07:33:08,615 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1485766481, now seen corresponding path program 1 times [2025-03-08 07:33:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:08,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568444648] [2025-03-08 07:33:08,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:08,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 07:33:08,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 07:33:08,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:08,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:33:08,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:08,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568444648] [2025-03-08 07:33:08,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568444648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:08,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345644265] [2025-03-08 07:33:08,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:08,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:08,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:08,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:33:08,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:33:08,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 07:33:08,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 07:33:08,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:08,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:33:08,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 07:33:08,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:33:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345644265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:08,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:33:08,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 07:33:08,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001074073] [2025-03-08 07:33:08,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:08,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:08,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:08,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:08,773 INFO L87 Difference]: Start difference. First operand 13916 states and 20518 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:10,028 INFO L93 Difference]: Finished difference Result 35629 states and 54504 transitions. [2025-03-08 07:33:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:10,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2025-03-08 07:33:10,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:10,116 INFO L225 Difference]: With dead ends: 35629 [2025-03-08 07:33:10,116 INFO L226 Difference]: Without dead ends: 24576 [2025-03-08 07:33:10,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:10,153 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 268 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:10,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 459 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24576 states. [2025-03-08 07:33:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24576 to 24474. [2025-03-08 07:33:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24474 states, 19718 states have (on average 1.3907597119383304) internal successors, (27423), 20939 states have internal predecessors, (27423), 2137 states have call successors, (2137), 1438 states have call predecessors, (2137), 2617 states have return successors, (7224), 2130 states have call predecessors, (7224), 2136 states have call successors, (7224) [2025-03-08 07:33:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24474 states to 24474 states and 36784 transitions. [2025-03-08 07:33:11,733 INFO L78 Accepts]: Start accepts. Automaton has 24474 states and 36784 transitions. Word has length 107 [2025-03-08 07:33:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:11,733 INFO L471 AbstractCegarLoop]: Abstraction has 24474 states and 36784 transitions. [2025-03-08 07:33:11,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 24474 states and 36784 transitions. [2025-03-08 07:33:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 07:33:11,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:11,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:11,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:33:11,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:11,957 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:11,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash 4563305, now seen corresponding path program 1 times [2025-03-08 07:33:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549709812] [2025-03-08 07:33:11,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:11,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:11,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 07:33:11,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 07:33:11,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:11,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:33:12,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549709812] [2025-03-08 07:33:12,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549709812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:12,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653169763] [2025-03-08 07:33:12,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:12,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:12,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:12,092 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:33:12,093 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:33:12,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 07:33:12,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 07:33:12,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:12,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:12,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:33:12,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 07:33:12,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:33:12,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653169763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:12,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:33:12,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:33:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217991145] [2025-03-08 07:33:12,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:12,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:12,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:12,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:12,188 INFO L87 Difference]: Start difference. First operand 24474 states and 36784 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 07:33:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:14,933 INFO L93 Difference]: Finished difference Result 66464 states and 102944 transitions. [2025-03-08 07:33:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 107 [2025-03-08 07:33:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:15,110 INFO L225 Difference]: With dead ends: 66464 [2025-03-08 07:33:15,110 INFO L226 Difference]: Without dead ends: 44854 [2025-03-08 07:33:15,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:15,165 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 153 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 764 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:33:15,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 764 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44854 states. [2025-03-08 07:33:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44854 to 44854. [2025-03-08 07:33:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44854 states, 36291 states have (on average 1.3950015155272657) internal successors, (50626), 38625 states have internal predecessors, (50626), 3742 states have call successors, (3742), 2528 states have call predecessors, (3742), 4819 states have return successors, (14199), 3766 states have call predecessors, (14199), 3741 states have call successors, (14199) [2025-03-08 07:33:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44854 states to 44854 states and 68567 transitions. [2025-03-08 07:33:18,404 INFO L78 Accepts]: Start accepts. Automaton has 44854 states and 68567 transitions. Word has length 107 [2025-03-08 07:33:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:18,405 INFO L471 AbstractCegarLoop]: Abstraction has 44854 states and 68567 transitions. [2025-03-08 07:33:18,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 07:33:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 44854 states and 68567 transitions. [2025-03-08 07:33:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 07:33:18,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:18,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:18,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 07:33:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:18,698 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1059887441, now seen corresponding path program 1 times [2025-03-08 07:33:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709975512] [2025-03-08 07:33:18,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:18,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:33:18,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:33:18,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:18,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 07:33:18,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:18,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709975512] [2025-03-08 07:33:18,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709975512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:18,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346604573] [2025-03-08 07:33:18,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:18,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:18,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:18,820 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:33:18,823 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:33:18,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:33:18,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:33:18,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:18,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:18,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 07:33:18,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:33:18,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:33:18,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346604573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:18,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:33:18,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 07:33:18,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562602250] [2025-03-08 07:33:18,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:18,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:18,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:18,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:33:18,967 INFO L87 Difference]: Start difference. First operand 44854 states and 68567 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:33:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:21,540 INFO L93 Difference]: Finished difference Result 46332 states and 70331 transitions. [2025-03-08 07:33:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:21,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-03-08 07:33:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:21,700 INFO L225 Difference]: With dead ends: 46332 [2025-03-08 07:33:21,700 INFO L226 Difference]: Without dead ends: 43495 [2025-03-08 07:33:21,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:33:21,728 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 0 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:21,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1511 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43495 states. [2025-03-08 07:33:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43495 to 43482. [2025-03-08 07:33:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43482 states, 35280 states have (on average 1.4010204081632653) internal successors, (49428), 37587 states have internal predecessors, (49428), 3566 states have call successors, (3566), 2373 states have call predecessors, (3566), 4634 states have return successors, (13961), 3585 states have call predecessors, (13961), 3565 states have call successors, (13961) [2025-03-08 07:33:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43482 states to 43482 states and 66955 transitions. [2025-03-08 07:33:24,443 INFO L78 Accepts]: Start accepts. Automaton has 43482 states and 66955 transitions. Word has length 139 [2025-03-08 07:33:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:24,444 INFO L471 AbstractCegarLoop]: Abstraction has 43482 states and 66955 transitions. [2025-03-08 07:33:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:33:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 43482 states and 66955 transitions. [2025-03-08 07:33:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 07:33:24,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:24,518 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:24,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 07:33:24,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 07:33:24,722 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:24,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:24,722 INFO L85 PathProgramCache]: Analyzing trace with hash 384867101, now seen corresponding path program 1 times [2025-03-08 07:33:24,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:24,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248901952] [2025-03-08 07:33:24,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:24,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:24,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 07:33:24,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 07:33:24,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:24,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 07:33:24,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248901952] [2025-03-08 07:33:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248901952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:24,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:24,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438210912] [2025-03-08 07:33:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:24,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:24,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:24,747 INFO L87 Difference]: Start difference. First operand 43482 states and 66955 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 07:33:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:27,259 INFO L93 Difference]: Finished difference Result 44626 states and 68323 transitions. [2025-03-08 07:33:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 141 [2025-03-08 07:33:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:27,446 INFO L225 Difference]: With dead ends: 44626 [2025-03-08 07:33:27,446 INFO L226 Difference]: Without dead ends: 43330 [2025-03-08 07:33:27,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:27,470 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 119 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:27,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 487 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43330 states. [2025-03-08 07:33:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43330 to 43330. [2025-03-08 07:33:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43330 states, 35164 states have (on average 1.4020020475486292) internal successors, (49300), 37471 states have internal predecessors, (49300), 3548 states have call successors, (3548), 2357 states have call predecessors, (3548), 4616 states have return successors, (13938), 3565 states have call predecessors, (13938), 3547 states have call successors, (13938) [2025-03-08 07:33:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43330 states to 43330 states and 66786 transitions. [2025-03-08 07:33:30,972 INFO L78 Accepts]: Start accepts. Automaton has 43330 states and 66786 transitions. Word has length 141 [2025-03-08 07:33:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:30,973 INFO L471 AbstractCegarLoop]: Abstraction has 43330 states and 66786 transitions. [2025-03-08 07:33:30,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 07:33:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 43330 states and 66786 transitions. [2025-03-08 07:33:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 07:33:31,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:31,068 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:31,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 07:33:31,068 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:31,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash 536980995, now seen corresponding path program 1 times [2025-03-08 07:33:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095953611] [2025-03-08 07:33:31,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:31,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 07:33:31,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 07:33:31,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:31,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 07:33:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:31,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095953611] [2025-03-08 07:33:31,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095953611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:31,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:31,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383268024] [2025-03-08 07:33:31,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:31,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:31,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:31,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:31,129 INFO L87 Difference]: Start difference. First operand 43330 states and 66786 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 07:33:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:33,415 INFO L93 Difference]: Finished difference Result 44525 states and 68214 transitions. [2025-03-08 07:33:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 150 [2025-03-08 07:33:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:33,560 INFO L225 Difference]: With dead ends: 44525 [2025-03-08 07:33:33,560 INFO L226 Difference]: Without dead ends: 43280 [2025-03-08 07:33:33,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:33,581 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 162 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:33,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 669 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:33:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43280 states. [2025-03-08 07:33:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43280 to 43190. [2025-03-08 07:33:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43190 states, 35052 states have (on average 1.402944197192742) internal successors, (49176), 37358 states have internal predecessors, (49176), 3534 states have call successors, (3534), 2345 states have call predecessors, (3534), 4602 states have return successors, (13918), 3550 states have call predecessors, (13918), 3533 states have call successors, (13918) [2025-03-08 07:33:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43190 states to 43190 states and 66628 transitions. [2025-03-08 07:33:36,305 INFO L78 Accepts]: Start accepts. Automaton has 43190 states and 66628 transitions. Word has length 150 [2025-03-08 07:33:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:36,306 INFO L471 AbstractCegarLoop]: Abstraction has 43190 states and 66628 transitions. [2025-03-08 07:33:36,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 07:33:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 43190 states and 66628 transitions. [2025-03-08 07:33:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 07:33:36,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:36,380 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:36,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 07:33:36,380 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:36,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:36,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1664067512, now seen corresponding path program 1 times [2025-03-08 07:33:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:36,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780058021] [2025-03-08 07:33:36,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:36,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:33:36,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:33:36,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:36,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 07:33:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780058021] [2025-03-08 07:33:36,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780058021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741119251] [2025-03-08 07:33:36,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:36,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:36,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:36,485 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:33:36,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 07:33:36,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:33:36,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:33:36,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:36,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:36,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 07:33:36,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 07:33:36,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:33:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-08 07:33:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741119251] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:33:36,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:33:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-08 07:33:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887432446] [2025-03-08 07:33:36,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:33:36,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 07:33:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:36,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 07:33:36,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:33:36,882 INFO L87 Difference]: Start difference. First operand 43190 states and 66628 transitions. Second operand has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35)