./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3322c0c768700658989b53a570d5dd58dc6c9ba5f33ff303fa538b570ca8619 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:33:49,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:33:49,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:33:49,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:33:49,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:33:49,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:33:49,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:33:49,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:33:49,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:33:49,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:33:49,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:33:49,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:33:49,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:33:49,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:33:49,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:33:49,231 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:33:49,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:33:49,232 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:33:49,232 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:33:49,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:33:49,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:33:49,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:33:49,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:33:49,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:33:49,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:33:49,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:33:49,232 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:33:49,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:33:49,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:33:49,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:33:49,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:33:49,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:33:49,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:33:49,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:33:49,233 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 -> b3322c0c768700658989b53a570d5dd58dc6c9ba5f33ff303fa538b570ca8619 [2025-03-08 07:33:49,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:33:49,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:33:49,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:33:49,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:33:49,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:33:49,468 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.11.cil-2.c [2025-03-08 07:33:50,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d541a59/91e6e3cb13744b3887f71ce2f2a70864/FLAGdd3e5464d [2025-03-08 07:33:50,877 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:33:50,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2025-03-08 07:33:50,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d541a59/91e6e3cb13744b3887f71ce2f2a70864/FLAGdd3e5464d [2025-03-08 07:33:50,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d541a59/91e6e3cb13744b3887f71ce2f2a70864 [2025-03-08 07:33:50,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:33:50,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:33:50,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:33:50,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:33:50,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:33:50,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:33:50" (1/1) ... [2025-03-08 07:33:50,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9c457e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:50, skipping insertion in model container [2025-03-08 07:33:50,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:33:50" (1/1) ... [2025-03-08 07:33:50,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:33:51,045 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.11.cil-2.c[914,927] [2025-03-08 07:33:51,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-2.c[7115,7128] [2025-03-08 07:33:51,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:33:51,207 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:33:51,216 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.11.cil-2.c[914,927] [2025-03-08 07:33:51,233 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.11.cil-2.c[7115,7128] [2025-03-08 07:33:51,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:33:51,321 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:33:51,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51 WrapperNode [2025-03-08 07:33:51,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:33:51,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:33:51,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:33:51,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:33:51,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,384 INFO L138 Inliner]: procedures = 75, calls = 90, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 954 [2025-03-08 07:33:51,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:33:51,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:33:51,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:33:51,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:33:51,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,413 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:33:51,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:33:51,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:33:51,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:33:51,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:33:51,437 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (1/1) ... [2025-03-08 07:33:51,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:33:51,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:51,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:33:51,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:33:51,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:33:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:33:51,487 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:33:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:33:51,487 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:33:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:33:51,487 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:33:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:33:51,487 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:33:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:33:51,487 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:33:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:33:51,488 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:33:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:33:51,488 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:33:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:33:51,488 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:33:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:33:51,488 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:33:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:33:51,488 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:33:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:33:51,488 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:33:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:33:51,489 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:33:51,489 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:33:51,489 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:33:51,489 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:33:51,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:33:51,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:33:51,489 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:33:51,489 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:33:51,575 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:33:51,576 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:33:52,319 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-03-08 07:33:52,319 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:33:52,338 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:33:52,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:33:52,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:33:52 BoogieIcfgContainer [2025-03-08 07:33:52,339 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:33:52,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:33:52,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:33:52,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:33:52,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:33:50" (1/3) ... [2025-03-08 07:33:52,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91d07de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:33:52, skipping insertion in model container [2025-03-08 07:33:52,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:51" (2/3) ... [2025-03-08 07:33:52,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91d07de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:33:52, skipping insertion in model container [2025-03-08 07:33:52,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:33:52" (3/3) ... [2025-03-08 07:33:52,351 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.11.cil-2.c [2025-03-08 07:33:52,362 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:33:52,364 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.11.cil-2.c that has 15 procedures, 452 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-03-08 07:33:52,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:33:52,442 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;@141503ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:33:52,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:33:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 452 states, 398 states have (on average 1.592964824120603) internal successors, (634), 402 states have internal predecessors, (634), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 07:33:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:52,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:52,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:52,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:52,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash 617579805, now seen corresponding path program 1 times [2025-03-08 07:33:52,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:52,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513953118] [2025-03-08 07:33:52,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:52,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:52,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:52,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:52,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:52,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:52,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513953118] [2025-03-08 07:33:52,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513953118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:52,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:52,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937191785] [2025-03-08 07:33:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:52,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:52,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:52,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:52,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:52,920 INFO L87 Difference]: Start difference. First operand has 452 states, 398 states have (on average 1.592964824120603) internal successors, (634), 402 states have internal predecessors, (634), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:53,688 INFO L93 Difference]: Finished difference Result 976 states and 1530 transitions. [2025-03-08 07:33:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:33:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:53,705 INFO L225 Difference]: With dead ends: 976 [2025-03-08 07:33:53,705 INFO L226 Difference]: Without dead ends: 541 [2025-03-08 07:33:53,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:53,710 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 456 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:53,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1433 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:33:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-08 07:33:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 534. [2025-03-08 07:33:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 460 states have (on average 1.5326086956521738) internal successors, (705), 466 states have internal predecessors, (705), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2025-03-08 07:33:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 808 transitions. [2025-03-08 07:33:53,783 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 808 transitions. Word has length 62 [2025-03-08 07:33:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:53,784 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 808 transitions. [2025-03-08 07:33:53,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 808 transitions. [2025-03-08 07:33:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:53,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:53,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:53,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:33:53,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:53,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1992088832, now seen corresponding path program 1 times [2025-03-08 07:33:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:53,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962785839] [2025-03-08 07:33:53,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:53,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:53,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:53,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:53,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:53,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:53,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962785839] [2025-03-08 07:33:53,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962785839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:53,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:53,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362643692] [2025-03-08 07:33:53,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:53,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:53,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:53,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:53,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:53,979 INFO L87 Difference]: Start difference. First operand 534 states and 808 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:54,744 INFO L93 Difference]: Finished difference Result 839 states and 1227 transitions. [2025-03-08 07:33:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:33:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:54,754 INFO L225 Difference]: With dead ends: 839 [2025-03-08 07:33:54,754 INFO L226 Difference]: Without dead ends: 670 [2025-03-08 07:33:54,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:33:54,756 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 1011 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:54,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 1607 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:33:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-08 07:33:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 626. [2025-03-08 07:33:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 532 states have (on average 1.513157894736842) internal successors, (805), 540 states have internal predecessors, (805), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2025-03-08 07:33:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 938 transitions. [2025-03-08 07:33:54,794 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 938 transitions. Word has length 62 [2025-03-08 07:33:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:54,794 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 938 transitions. [2025-03-08 07:33:54,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 938 transitions. [2025-03-08 07:33:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:54,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:54,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:54,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:33:54,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:54,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:54,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1022507809, now seen corresponding path program 1 times [2025-03-08 07:33:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:54,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697574771] [2025-03-08 07:33:54,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:54,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:54,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:54,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:54,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697574771] [2025-03-08 07:33:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697574771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:54,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:54,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:54,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000837686] [2025-03-08 07:33:54,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:54,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:54,891 INFO L87 Difference]: Start difference. First operand 626 states and 938 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:54,940 INFO L93 Difference]: Finished difference Result 886 states and 1299 transitions. [2025-03-08 07:33:54,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:54,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-03-08 07:33:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:54,944 INFO L225 Difference]: With dead ends: 886 [2025-03-08 07:33:54,944 INFO L226 Difference]: Without dead ends: 631 [2025-03-08 07:33:54,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:54,947 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 0 mSDsluCounter, 2703 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:54,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-08 07:33:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2025-03-08 07:33:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 536 states have (on average 1.5055970149253732) internal successors, (807), 544 states have internal predecessors, (807), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2025-03-08 07:33:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 941 transitions. [2025-03-08 07:33:54,986 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 941 transitions. Word has length 62 [2025-03-08 07:33:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:54,986 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 941 transitions. [2025-03-08 07:33:54,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 941 transitions. [2025-03-08 07:33:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:54,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:54,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:54,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:33:54,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:54,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:54,993 INFO L85 PathProgramCache]: Analyzing trace with hash 702973088, now seen corresponding path program 1 times [2025-03-08 07:33:54,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:54,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960051251] [2025-03-08 07:33:54,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:55,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:55,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:55,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:55,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:55,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:55,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960051251] [2025-03-08 07:33:55,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960051251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:55,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:55,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:33:55,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432912002] [2025-03-08 07:33:55,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:55,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:33:55,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:55,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:33:55,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:33:55,106 INFO L87 Difference]: Start difference. First operand 631 states and 941 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:33:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:56,177 INFO L93 Difference]: Finished difference Result 1813 states and 2577 transitions. [2025-03-08 07:33:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:33:56,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-03-08 07:33:56,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:56,186 INFO L225 Difference]: With dead ends: 1813 [2025-03-08 07:33:56,186 INFO L226 Difference]: Without dead ends: 1535 [2025-03-08 07:33:56,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:33:56,188 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 2954 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2968 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:56,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2968 Valid, 1752 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:33:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-03-08 07:33:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1487. [2025-03-08 07:33:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1206 states have (on average 1.4104477611940298) internal successors, (1701), 1229 states have internal predecessors, (1701), 149 states have call successors, (149), 111 states have call predecessors, (149), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2025-03-08 07:33:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2037 transitions. [2025-03-08 07:33:56,263 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2037 transitions. Word has length 62 [2025-03-08 07:33:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:56,263 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2037 transitions. [2025-03-08 07:33:56,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:33:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2037 transitions. [2025-03-08 07:33:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:56,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:56,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:56,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:33:56,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:56,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2008730627, now seen corresponding path program 1 times [2025-03-08 07:33:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:56,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973034509] [2025-03-08 07:33:56,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:56,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:56,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:56,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:56,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:56,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:56,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973034509] [2025-03-08 07:33:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973034509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:56,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227090082] [2025-03-08 07:33:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:56,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:56,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:56,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:56,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:56,354 INFO L87 Difference]: Start difference. First operand 1487 states and 2037 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:56,440 INFO L93 Difference]: Finished difference Result 2645 states and 3558 transitions. [2025-03-08 07:33:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:56,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-03-08 07:33:56,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:56,451 INFO L225 Difference]: With dead ends: 2645 [2025-03-08 07:33:56,451 INFO L226 Difference]: Without dead ends: 1517 [2025-03-08 07:33:56,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:56,454 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 0 mSDsluCounter, 2703 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:56,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-03-08 07:33:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1517. [2025-03-08 07:33:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1230 states have (on average 1.3959349593495936) internal successors, (1717), 1253 states have internal predecessors, (1717), 149 states have call successors, (149), 111 states have call predecessors, (149), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2025-03-08 07:33:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2059 transitions. [2025-03-08 07:33:56,534 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2059 transitions. Word has length 62 [2025-03-08 07:33:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:56,534 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2059 transitions. [2025-03-08 07:33:56,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2059 transitions. [2025-03-08 07:33:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:56,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:56,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:56,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:33:56,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:56,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1977710820, now seen corresponding path program 1 times [2025-03-08 07:33:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:56,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97132170] [2025-03-08 07:33:56,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:56,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:56,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:56,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:56,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97132170] [2025-03-08 07:33:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97132170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:56,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134525657] [2025-03-08 07:33:56,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:56,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:56,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:56,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:56,647 INFO L87 Difference]: Start difference. First operand 1517 states and 2059 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:57,395 INFO L93 Difference]: Finished difference Result 2689 states and 3515 transitions. [2025-03-08 07:33:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:33:57,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:33:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:57,403 INFO L225 Difference]: With dead ends: 2689 [2025-03-08 07:33:57,403 INFO L226 Difference]: Without dead ends: 1743 [2025-03-08 07:33:57,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:33:57,405 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 996 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:57,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1413 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-03-08 07:33:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1462. [2025-03-08 07:33:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1191 states have (on average 1.3929471032745593) internal successors, (1659), 1209 states have internal predecessors, (1659), 143 states have call successors, (143), 106 states have call predecessors, (143), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2025-03-08 07:33:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1980 transitions. [2025-03-08 07:33:57,463 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1980 transitions. Word has length 62 [2025-03-08 07:33:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:57,464 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 1980 transitions. [2025-03-08 07:33:57,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1980 transitions. [2025-03-08 07:33:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:57,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:57,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:57,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:33:57,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:57,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1766359907, now seen corresponding path program 1 times [2025-03-08 07:33:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892836664] [2025-03-08 07:33:57,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:57,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:57,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:57,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:57,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:57,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:57,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892836664] [2025-03-08 07:33:57,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892836664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:57,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:57,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:33:57,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764497164] [2025-03-08 07:33:57,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:57,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:33:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:57,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:33:57,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:33:57,529 INFO L87 Difference]: Start difference. First operand 1462 states and 1980 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:57,999 INFO L93 Difference]: Finished difference Result 3593 states and 4719 transitions. [2025-03-08 07:33:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:33:58,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:33:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:58,009 INFO L225 Difference]: With dead ends: 3593 [2025-03-08 07:33:58,010 INFO L226 Difference]: Without dead ends: 2491 [2025-03-08 07:33:58,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:58,012 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 957 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:58,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 719 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2025-03-08 07:33:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 2487. [2025-03-08 07:33:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 1973 states have (on average 1.3243791180942728) internal successors, (2613), 2008 states have internal predecessors, (2613), 262 states have call successors, (262), 205 states have call predecessors, (262), 250 states have return successors, (369), 276 states have call predecessors, (369), 260 states have call successors, (369) [2025-03-08 07:33:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3244 transitions. [2025-03-08 07:33:58,108 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3244 transitions. Word has length 62 [2025-03-08 07:33:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:58,109 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3244 transitions. [2025-03-08 07:33:58,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3244 transitions. [2025-03-08 07:33:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:33:58,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:58,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:58,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:33:58,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:58,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:58,110 INFO L85 PathProgramCache]: Analyzing trace with hash -734904045, now seen corresponding path program 1 times [2025-03-08 07:33:58,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:58,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309780865] [2025-03-08 07:33:58,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:58,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:58,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:33:58,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:33:58,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:58,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:58,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309780865] [2025-03-08 07:33:58,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309780865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:58,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:58,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427861654] [2025-03-08 07:33:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:58,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:58,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:58,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:58,136 INFO L87 Difference]: Start difference. First operand 2487 states and 3244 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:58,302 INFO L93 Difference]: Finished difference Result 5471 states and 7029 transitions. [2025-03-08 07:33:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:58,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-08 07:33:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:58,317 INFO L225 Difference]: With dead ends: 5471 [2025-03-08 07:33:58,317 INFO L226 Difference]: Without dead ends: 3349 [2025-03-08 07:33:58,322 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:58,322 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 101 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:58,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1327 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2025-03-08 07:33:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3281. [2025-03-08 07:33:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 2581 states have (on average 1.3049205734211546) internal successors, (3368), 2621 states have internal predecessors, (3368), 354 states have call successors, (354), 285 states have call predecessors, (354), 344 states have return successors, (483), 377 states have call predecessors, (483), 352 states have call successors, (483) [2025-03-08 07:33:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 4205 transitions. [2025-03-08 07:33:58,494 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 4205 transitions. Word has length 63 [2025-03-08 07:33:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:58,494 INFO L471 AbstractCegarLoop]: Abstraction has 3281 states and 4205 transitions. [2025-03-08 07:33:58,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 4205 transitions. [2025-03-08 07:33:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:33:58,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:58,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:58,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:33:58,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:58,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1840850547, now seen corresponding path program 1 times [2025-03-08 07:33:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561759535] [2025-03-08 07:33:58,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:58,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:33:58,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:33:58,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:58,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:58,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:58,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561759535] [2025-03-08 07:33:58,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561759535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:58,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:58,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:33:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365805258] [2025-03-08 07:33:58,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:58,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:33:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:58,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:33:58,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:33:58,585 INFO L87 Difference]: Start difference. First operand 3281 states and 4205 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:58,922 INFO L93 Difference]: Finished difference Result 4206 states and 5323 transitions. [2025-03-08 07:33:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:33:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-03-08 07:33:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:58,940 INFO L225 Difference]: With dead ends: 4206 [2025-03-08 07:33:58,941 INFO L226 Difference]: Without dead ends: 4203 [2025-03-08 07:33:58,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:58,944 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 1264 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:58,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 781 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:33:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2025-03-08 07:33:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3731. [2025-03-08 07:33:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 2924 states have (on average 1.292065663474692) internal successors, (3778), 2967 states have internal predecessors, (3778), 404 states have call successors, (404), 329 states have call predecessors, (404), 401 states have return successors, (560), 437 states have call predecessors, (560), 403 states have call successors, (560) [2025-03-08 07:33:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4742 transitions. [2025-03-08 07:33:59,160 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4742 transitions. Word has length 68 [2025-03-08 07:33:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:59,161 INFO L471 AbstractCegarLoop]: Abstraction has 3731 states and 4742 transitions. [2025-03-08 07:33:59,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4742 transitions. [2025-03-08 07:33:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:33:59,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:59,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:59,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:33:59,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:59,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1231232207, now seen corresponding path program 1 times [2025-03-08 07:33:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645828996] [2025-03-08 07:33:59,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:59,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:33:59,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:33:59,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:59,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645828996] [2025-03-08 07:33:59,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645828996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:59,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566708263] [2025-03-08 07:33:59,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:59,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:59,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:59,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:33:59,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:33:59,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:33:59,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:33:59,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:59,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:59,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:33:59,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:59,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:33:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566708263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:33:59,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:33:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-08 07:33:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327934427] [2025-03-08 07:33:59,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:33:59,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:33:59,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:59,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:33:59,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:59,615 INFO L87 Difference]: Start difference. First operand 3731 states and 4742 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:34:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:00,239 INFO L93 Difference]: Finished difference Result 7555 states and 9418 transitions. [2025-03-08 07:34:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:34:00,240 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:34:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:00,264 INFO L225 Difference]: With dead ends: 7555 [2025-03-08 07:34:00,264 INFO L226 Difference]: Without dead ends: 7552 [2025-03-08 07:34:00,266 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:34:00,266 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 1119 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 2470 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:00,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 2470 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:34:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2025-03-08 07:34:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 7171. [2025-03-08 07:34:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7171 states, 5586 states have (on average 1.2653061224489797) internal successors, (7068), 5664 states have internal predecessors, (7068), 781 states have call successors, (781), 659 states have call predecessors, (781), 802 states have return successors, (1085), 850 states have call predecessors, (1085), 780 states have call successors, (1085) [2025-03-08 07:34:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 8934 transitions. [2025-03-08 07:34:00,627 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 8934 transitions. Word has length 69 [2025-03-08 07:34:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:00,628 INFO L471 AbstractCegarLoop]: Abstraction has 7171 states and 8934 transitions. [2025-03-08 07:34:00,628 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:34:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 8934 transitions. [2025-03-08 07:34:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:34:00,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:00,629 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:34:00,636 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:34:00,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 07:34:00,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:00,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1946505650, now seen corresponding path program 2 times [2025-03-08 07:34:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852385025] [2025-03-08 07:34:00,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:34:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:00,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 07:34:00,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 07:34:00,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:34:00,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:00,869 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:34:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:00,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852385025] [2025-03-08 07:34:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852385025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:00,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418328691] [2025-03-08 07:34:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:00,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:00,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:00,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:00,871 INFO L87 Difference]: Start difference. First operand 7171 states and 8934 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:34:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:01,056 INFO L93 Difference]: Finished difference Result 9466 states and 11827 transitions. [2025-03-08 07:34:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:01,060 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:34:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:01,085 INFO L225 Difference]: With dead ends: 9466 [2025-03-08 07:34:01,085 INFO L226 Difference]: Without dead ends: 3530 [2025-03-08 07:34:01,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:01,097 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 649 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 865 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:34:01,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 865 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2025-03-08 07:34:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 2799. [2025-03-08 07:34:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2799 states, 2216 states have (on average 1.2820397111913358) internal successors, (2841), 2240 states have internal predecessors, (2841), 302 states have call successors, (302), 243 states have call predecessors, (302), 279 states have return successors, (387), 318 states have call predecessors, (387), 301 states have call successors, (387) [2025-03-08 07:34:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 3530 transitions. [2025-03-08 07:34:01,247 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 3530 transitions. Word has length 71 [2025-03-08 07:34:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:01,247 INFO L471 AbstractCegarLoop]: Abstraction has 2799 states and 3530 transitions. [2025-03-08 07:34:01,248 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:34:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 3530 transitions. [2025-03-08 07:34:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:34:01,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:01,249 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:34:01,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:34:01,250 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:01,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1899076548, now seen corresponding path program 1 times [2025-03-08 07:34:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614402249] [2025-03-08 07:34:01,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:01,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:34:01,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:34:01,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:01,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:01,335 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:34:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614402249] [2025-03-08 07:34:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614402249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:01,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384795419] [2025-03-08 07:34:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:01,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:01,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:01,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:01,336 INFO L87 Difference]: Start difference. First operand 2799 states and 3530 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:34:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:02,462 INFO L93 Difference]: Finished difference Result 7719 states and 9543 transitions. [2025-03-08 07:34:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 07:34:02,462 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:34:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:02,479 INFO L225 Difference]: With dead ends: 7719 [2025-03-08 07:34:02,479 INFO L226 Difference]: Without dead ends: 4531 [2025-03-08 07:34:02,486 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:34:02,487 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 809 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:02,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1815 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:34:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2025-03-08 07:34:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4354. [2025-03-08 07:34:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4354 states, 3401 states have (on average 1.2419876506909733) internal successors, (4224), 3455 states have internal predecessors, (4224), 477 states have call successors, (477), 397 states have call predecessors, (477), 474 states have return successors, (677), 504 states have call predecessors, (677), 476 states have call successors, (677) [2025-03-08 07:34:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 5378 transitions. [2025-03-08 07:34:02,737 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 5378 transitions. Word has length 80 [2025-03-08 07:34:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:02,737 INFO L471 AbstractCegarLoop]: Abstraction has 4354 states and 5378 transitions. [2025-03-08 07:34:02,737 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:34:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 5378 transitions. [2025-03-08 07:34:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:34:02,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:02,739 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:34:02,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:34:02,739 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:02,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 320487819, now seen corresponding path program 1 times [2025-03-08 07:34:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231068386] [2025-03-08 07:34:02,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:02,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:34:02,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:34:02,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:02,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:02,825 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:34:02,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:02,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231068386] [2025-03-08 07:34:02,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231068386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:02,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:02,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:34:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116621074] [2025-03-08 07:34:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:02,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:34:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:02,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:34:02,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:34:02,826 INFO L87 Difference]: Start difference. First operand 4354 states and 5378 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:34:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:03,779 INFO L93 Difference]: Finished difference Result 7301 states and 8953 transitions. [2025-03-08 07:34:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:34:03,780 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:34:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:03,801 INFO L225 Difference]: With dead ends: 7301 [2025-03-08 07:34:03,801 INFO L226 Difference]: Without dead ends: 3523 [2025-03-08 07:34:03,809 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:34:03,809 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 1609 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:03,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 1885 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:34:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2025-03-08 07:34:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 3202. [2025-03-08 07:34:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 2507 states have (on average 1.2353410450737934) internal successors, (3097), 2548 states have internal predecessors, (3097), 346 states have call successors, (346), 280 states have call predecessors, (346), 347 states have return successors, (466), 376 states have call predecessors, (466), 345 states have call successors, (466) [2025-03-08 07:34:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 3909 transitions. [2025-03-08 07:34:04,004 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 3909 transitions. Word has length 86 [2025-03-08 07:34:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:04,005 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 3909 transitions. [2025-03-08 07:34:04,005 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:34:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 3909 transitions. [2025-03-08 07:34:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 07:34:04,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:04,009 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:34:04,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:34:04,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:04,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1779683366, now seen corresponding path program 1 times [2025-03-08 07:34:04,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:04,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492279892] [2025-03-08 07:34:04,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:04,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:34:04,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:34:04,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:04,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:04,130 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:34:04,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492279892] [2025-03-08 07:34:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492279892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:34:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029217294] [2025-03-08 07:34:04,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:04,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:04,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:04,135 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:34:04,136 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:34:04,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:34:04,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:34:04,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:04,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:04,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 07:34:04,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:34:04,278 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:34:04,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:34:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029217294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:04,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:34:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 07:34:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696007003] [2025-03-08 07:34:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:04,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:04,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:04,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:34:04,280 INFO L87 Difference]: Start difference. First operand 3202 states and 3909 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:34:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:04,363 INFO L93 Difference]: Finished difference Result 4680 states and 5673 transitions. [2025-03-08 07:34:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:04,364 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:34:04,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:04,372 INFO L225 Difference]: With dead ends: 4680 [2025-03-08 07:34:04,372 INFO L226 Difference]: Without dead ends: 1843 [2025-03-08 07:34:04,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:34:04,376 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 0 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3361 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:34:04,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3361 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-08 07:34:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1830. [2025-03-08 07:34:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1496 states have (on average 1.2693850267379678) internal successors, (1899), 1510 states have internal predecessors, (1899), 170 states have call successors, (170), 125 states have call predecessors, (170), 162 states have return successors, (228), 195 states have call predecessors, (228), 169 states have call successors, (228) [2025-03-08 07:34:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2297 transitions. [2025-03-08 07:34:04,485 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2297 transitions. Word has length 139 [2025-03-08 07:34:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:04,485 INFO L471 AbstractCegarLoop]: Abstraction has 1830 states and 2297 transitions. [2025-03-08 07:34:04,485 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:34:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2297 transitions. [2025-03-08 07:34:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 07:34:04,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:04,488 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:34:04,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:34:04,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 07:34:04,692 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:04,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1468181842, now seen corresponding path program 1 times [2025-03-08 07:34:04,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:04,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678060181] [2025-03-08 07:34:04,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:04,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:04,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 07:34:04,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 07:34:04,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:04,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:04,729 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:34:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:04,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678060181] [2025-03-08 07:34:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678060181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:04,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:04,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192971349] [2025-03-08 07:34:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:04,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:04,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:04,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:04,731 INFO L87 Difference]: Start difference. First operand 1830 states and 2297 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:34:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:04,790 INFO L93 Difference]: Finished difference Result 2974 states and 3665 transitions. [2025-03-08 07:34:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:04,790 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:34:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:04,797 INFO L225 Difference]: With dead ends: 2974 [2025-03-08 07:34:04,797 INFO L226 Difference]: Without dead ends: 1678 [2025-03-08 07:34:04,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:04,800 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 119 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:04,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1227 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2025-03-08 07:34:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2025-03-08 07:34:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1380 states have (on average 1.2833333333333334) internal successors, (1771), 1394 states have internal predecessors, (1771), 152 states have call successors, (152), 109 states have call predecessors, (152), 144 states have return successors, (205), 175 states have call predecessors, (205), 151 states have call successors, (205) [2025-03-08 07:34:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2128 transitions. [2025-03-08 07:34:04,874 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2128 transitions. Word has length 141 [2025-03-08 07:34:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:04,874 INFO L471 AbstractCegarLoop]: Abstraction has 1678 states and 2128 transitions. [2025-03-08 07:34:04,875 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:34:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2128 transitions. [2025-03-08 07:34:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 07:34:04,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:04,877 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:34:04,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:34:04,877 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:04,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash -563877687, now seen corresponding path program 1 times [2025-03-08 07:34:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:04,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328591066] [2025-03-08 07:34:04,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:04,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 07:34:04,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 07:34:04,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:04,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:04,945 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:34:04,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:04,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328591066] [2025-03-08 07:34:04,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328591066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:04,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:04,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:04,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972588469] [2025-03-08 07:34:04,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:04,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:04,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:04,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:04,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:04,946 INFO L87 Difference]: Start difference. First operand 1678 states and 2128 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:34:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:05,485 INFO L93 Difference]: Finished difference Result 2873 states and 3556 transitions. [2025-03-08 07:34:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:05,486 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:34:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:05,493 INFO L225 Difference]: With dead ends: 2873 [2025-03-08 07:34:05,493 INFO L226 Difference]: Without dead ends: 1628 [2025-03-08 07:34:05,495 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:34:05,496 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 342 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:05,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1384 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-03-08 07:34:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1538. [2025-03-08 07:34:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1268 states have (on average 1.2988958990536277) internal successors, (1647), 1281 states have internal predecessors, (1647), 138 states have call successors, (138), 97 states have call predecessors, (138), 130 states have return successors, (185), 160 states have call predecessors, (185), 137 states have call successors, (185) [2025-03-08 07:34:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1970 transitions. [2025-03-08 07:34:05,598 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1970 transitions. Word has length 150 [2025-03-08 07:34:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:05,599 INFO L471 AbstractCegarLoop]: Abstraction has 1538 states and 1970 transitions. [2025-03-08 07:34:05,600 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:34:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1970 transitions. [2025-03-08 07:34:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 07:34:05,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:05,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:05,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:34:05,602 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:05,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1008830723, now seen corresponding path program 1 times [2025-03-08 07:34:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:05,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124459019] [2025-03-08 07:34:05,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:05,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:34:05,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:34:05,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:05,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:05,844 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:34:05,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:05,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124459019] [2025-03-08 07:34:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124459019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:34:05,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898715192] [2025-03-08 07:34:05,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:05,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:05,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:05,847 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:34:05,849 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:34:05,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:34:05,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:34:05,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:05,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:05,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 07:34:05,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:34:06,103 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:34:06,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:34:06,307 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:34:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898715192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:34:06,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:34:06,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-08 07:34:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130328043] [2025-03-08 07:34:06,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:34:06,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 07:34:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:06,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 07:34:06,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:34:06,309 INFO L87 Difference]: Start difference. First operand 1538 states and 1970 transitions. Second operand has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-08 07:34:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:07,646 INFO L93 Difference]: Finished difference Result 3284 states and 4143 transitions. [2025-03-08 07:34:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 07:34:07,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 153 [2025-03-08 07:34:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:07,655 INFO L225 Difference]: With dead ends: 3284 [2025-03-08 07:34:07,655 INFO L226 Difference]: Without dead ends: 2023 [2025-03-08 07:34:07,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-03-08 07:34:07,658 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 1310 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:07,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 2584 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:34:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2025-03-08 07:34:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1812. [2025-03-08 07:34:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1467 states have (on average 1.2583503749147922) internal successors, (1846), 1481 states have internal predecessors, (1846), 178 states have call successors, (178), 135 states have call predecessors, (178), 165 states have return successors, (254), 196 states have call predecessors, (254), 177 states have call successors, (254) [2025-03-08 07:34:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2278 transitions. [2025-03-08 07:34:07,757 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2278 transitions. Word has length 153 [2025-03-08 07:34:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:07,758 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2278 transitions. [2025-03-08 07:34:07,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-08 07:34:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2278 transitions. [2025-03-08 07:34:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:07,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:07,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:07,769 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:34:07,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:07,961 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:07,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1088343972, now seen corresponding path program 1 times [2025-03-08 07:34:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:07,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134459228] [2025-03-08 07:34:07,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:07,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:07,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:07,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:07,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:07,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:08,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:08,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134459228] [2025-03-08 07:34:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134459228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:08,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936504994] [2025-03-08 07:34:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:08,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:08,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:08,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:08,010 INFO L87 Difference]: Start difference. First operand 1812 states and 2278 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:08,112 INFO L93 Difference]: Finished difference Result 2156 states and 2822 transitions. [2025-03-08 07:34:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:08,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:34:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:08,119 INFO L225 Difference]: With dead ends: 2156 [2025-03-08 07:34:08,119 INFO L226 Difference]: Without dead ends: 1812 [2025-03-08 07:34:08,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:08,121 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 546 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:08,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 798 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-03-08 07:34:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1812. [2025-03-08 07:34:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1467 states have (on average 1.2576687116564418) internal successors, (1845), 1481 states have internal predecessors, (1845), 178 states have call successors, (178), 135 states have call predecessors, (178), 165 states have return successors, (254), 196 states have call predecessors, (254), 177 states have call successors, (254) [2025-03-08 07:34:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2277 transitions. [2025-03-08 07:34:08,211 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2277 transitions. Word has length 165 [2025-03-08 07:34:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:08,211 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2277 transitions. [2025-03-08 07:34:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2277 transitions. [2025-03-08 07:34:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:08,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:08,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:08,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:34:08,214 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:08,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash 915929891, now seen corresponding path program 1 times [2025-03-08 07:34:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496802472] [2025-03-08 07:34:08,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:08,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:08,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:08,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:08,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:08,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496802472] [2025-03-08 07:34:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496802472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102259336] [2025-03-08 07:34:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:08,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:08,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:08,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:08,257 INFO L87 Difference]: Start difference. First operand 1812 states and 2277 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:08,329 INFO L93 Difference]: Finished difference Result 2148 states and 2805 transitions. [2025-03-08 07:34:08,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:08,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-03-08 07:34:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:08,337 INFO L225 Difference]: With dead ends: 2148 [2025-03-08 07:34:08,337 INFO L226 Difference]: Without dead ends: 1812 [2025-03-08 07:34:08,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:08,339 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 537 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:08,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 797 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-03-08 07:34:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1812. [2025-03-08 07:34:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1467 states have (on average 1.2569870483980914) internal successors, (1844), 1481 states have internal predecessors, (1844), 178 states have call successors, (178), 135 states have call predecessors, (178), 165 states have return successors, (254), 196 states have call predecessors, (254), 177 states have call successors, (254) [2025-03-08 07:34:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2276 transitions. [2025-03-08 07:34:08,434 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2276 transitions. Word has length 165 [2025-03-08 07:34:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:08,434 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2276 transitions. [2025-03-08 07:34:08,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:34:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2276 transitions. [2025-03-08 07:34:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:08,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:08,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:08,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:34:08,437 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:08,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash 722998690, now seen corresponding path program 1 times [2025-03-08 07:34:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048838366] [2025-03-08 07:34:08,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:08,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:08,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:08,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:08,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:08,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048838366] [2025-03-08 07:34:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048838366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:08,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:08,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:08,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842730035] [2025-03-08 07:34:08,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:08,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:08,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:08,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:08,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:08,530 INFO L87 Difference]: Start difference. First operand 1812 states and 2276 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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:34:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:09,093 INFO L93 Difference]: Finished difference Result 2518 states and 3404 transitions. [2025-03-08 07:34:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:09,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:09,102 INFO L225 Difference]: With dead ends: 2518 [2025-03-08 07:34:09,102 INFO L226 Difference]: Without dead ends: 2187 [2025-03-08 07:34:09,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:09,104 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 1223 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:09,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 1667 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:34:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2025-03-08 07:34:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2160. [2025-03-08 07:34:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 1788 states have (on average 1.3182326621923937) internal successors, (2357), 1803 states have internal predecessors, (2357), 198 states have call successors, (198), 141 states have call predecessors, (198), 172 states have return successors, (275), 216 states have call predecessors, (275), 197 states have call successors, (275) [2025-03-08 07:34:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 2830 transitions. [2025-03-08 07:34:09,214 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 2830 transitions. Word has length 165 [2025-03-08 07:34:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:09,214 INFO L471 AbstractCegarLoop]: Abstraction has 2160 states and 2830 transitions. [2025-03-08 07:34:09,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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:34:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 2830 transitions. [2025-03-08 07:34:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:09,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:09,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:09,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:34:09,218 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1148099300, now seen corresponding path program 1 times [2025-03-08 07:34:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72374113] [2025-03-08 07:34:09,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:09,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:09,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:09,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:09,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:09,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72374113] [2025-03-08 07:34:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72374113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:09,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:09,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:09,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794341087] [2025-03-08 07:34:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:09,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:09,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:09,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:09,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:09,332 INFO L87 Difference]: Start difference. First operand 2160 states and 2830 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:10,040 INFO L93 Difference]: Finished difference Result 3285 states and 4645 transitions. [2025-03-08 07:34:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:10,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:10,048 INFO L225 Difference]: With dead ends: 3285 [2025-03-08 07:34:10,048 INFO L226 Difference]: Without dead ends: 2606 [2025-03-08 07:34:10,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:10,051 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 1231 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 3120 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:10,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 3120 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2025-03-08 07:34:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2483. [2025-03-08 07:34:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2084 states have (on average 1.3531669865642995) internal successors, (2820), 2100 states have internal predecessors, (2820), 218 states have call successors, (218), 147 states have call predecessors, (218), 179 states have return successors, (298), 237 states have call predecessors, (298), 217 states have call successors, (298) [2025-03-08 07:34:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3336 transitions. [2025-03-08 07:34:10,197 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3336 transitions. Word has length 165 [2025-03-08 07:34:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:10,197 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3336 transitions. [2025-03-08 07:34:10,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3336 transitions. [2025-03-08 07:34:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:10,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:10,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:10,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:34:10,200 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:10,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1269599101, now seen corresponding path program 1 times [2025-03-08 07:34:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:10,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775045376] [2025-03-08 07:34:10,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:10,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:10,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:10,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:10,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:10,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:10,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775045376] [2025-03-08 07:34:10,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775045376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:10,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:10,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58038087] [2025-03-08 07:34:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:10,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:10,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:10,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:10,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:10,301 INFO L87 Difference]: Start difference. First operand 2483 states and 3336 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:11,063 INFO L93 Difference]: Finished difference Result 4318 states and 6290 transitions. [2025-03-08 07:34:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:11,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:11,076 INFO L225 Difference]: With dead ends: 4318 [2025-03-08 07:34:11,076 INFO L226 Difference]: Without dead ends: 3316 [2025-03-08 07:34:11,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:11,081 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 1226 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 3104 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:11,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 3104 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2025-03-08 07:34:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 3174. [2025-03-08 07:34:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3174 states, 2719 states have (on average 1.4082383229128357) internal successors, (3829), 2739 states have internal predecessors, (3829), 258 states have call successors, (258), 159 states have call predecessors, (258), 195 states have return successors, (350), 279 states have call predecessors, (350), 257 states have call successors, (350) [2025-03-08 07:34:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4437 transitions. [2025-03-08 07:34:11,265 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4437 transitions. Word has length 165 [2025-03-08 07:34:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:11,265 INFO L471 AbstractCegarLoop]: Abstraction has 3174 states and 4437 transitions. [2025-03-08 07:34:11,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4437 transitions. [2025-03-08 07:34:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:11,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:11,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:11,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:34:11,268 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:11,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1347589372, now seen corresponding path program 1 times [2025-03-08 07:34:11,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:11,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457898437] [2025-03-08 07:34:11,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:11,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:11,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:11,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:11,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:11,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457898437] [2025-03-08 07:34:11,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457898437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:11,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:11,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:11,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672522199] [2025-03-08 07:34:11,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:11,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:11,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:11,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:11,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:11,364 INFO L87 Difference]: Start difference. First operand 3174 states and 4437 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:12,069 INFO L93 Difference]: Finished difference Result 6559 states and 9933 transitions. [2025-03-08 07:34:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:12,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:12,084 INFO L225 Difference]: With dead ends: 6559 [2025-03-08 07:34:12,084 INFO L226 Difference]: Without dead ends: 4866 [2025-03-08 07:34:12,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:12,090 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 1221 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:12,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 3092 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4866 states. [2025-03-08 07:34:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4866 to 4685. [2025-03-08 07:34:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4685 states, 4112 states have (on average 1.4798151750972763) internal successors, (6085), 4146 states have internal predecessors, (6085), 338 states have call successors, (338), 183 states have call predecessors, (338), 233 states have return successors, (478), 363 states have call predecessors, (478), 337 states have call successors, (478) [2025-03-08 07:34:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6901 transitions. [2025-03-08 07:34:12,359 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6901 transitions. Word has length 165 [2025-03-08 07:34:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:12,359 INFO L471 AbstractCegarLoop]: Abstraction has 4685 states and 6901 transitions. [2025-03-08 07:34:12,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6901 transitions. [2025-03-08 07:34:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:12,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:12,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:12,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:34:12,363 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:12,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1005199459, now seen corresponding path program 1 times [2025-03-08 07:34:12,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:12,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573021506] [2025-03-08 07:34:12,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:12,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:12,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:12,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:12,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:12,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573021506] [2025-03-08 07:34:12,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573021506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:12,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:12,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:12,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51850826] [2025-03-08 07:34:12,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:12,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:12,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:12,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:12,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:12,488 INFO L87 Difference]: Start difference. First operand 4685 states and 6901 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:13,296 INFO L93 Difference]: Finished difference Result 11538 states and 18255 transitions. [2025-03-08 07:34:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:13,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:13,320 INFO L225 Difference]: With dead ends: 11538 [2025-03-08 07:34:13,321 INFO L226 Difference]: Without dead ends: 8334 [2025-03-08 07:34:13,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:13,330 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1216 mSDsluCounter, 2313 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:13,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 3080 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2025-03-08 07:34:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 8076. [2025-03-08 07:34:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8076 states, 7249 states have (on average 1.5556628500482825) internal successors, (11277), 7329 states have internal predecessors, (11277), 498 states have call successors, (498), 231 states have call predecessors, (498), 327 states have return successors, (830), 531 states have call predecessors, (830), 497 states have call successors, (830) [2025-03-08 07:34:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8076 states to 8076 states and 12605 transitions. [2025-03-08 07:34:13,680 INFO L78 Accepts]: Start accepts. Automaton has 8076 states and 12605 transitions. Word has length 165 [2025-03-08 07:34:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:13,680 INFO L471 AbstractCegarLoop]: Abstraction has 8076 states and 12605 transitions. [2025-03-08 07:34:13,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8076 states and 12605 transitions. [2025-03-08 07:34:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:13,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:13,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:13,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:34:13,685 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:13,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash 111264548, now seen corresponding path program 1 times [2025-03-08 07:34:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:13,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764192306] [2025-03-08 07:34:13,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:13,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:13,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:13,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:13,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:13,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764192306] [2025-03-08 07:34:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764192306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:13,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:13,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498058761] [2025-03-08 07:34:13,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:13,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:13,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:13,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:13,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:13,762 INFO L87 Difference]: Start difference. First operand 8076 states and 12605 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:34:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:14,408 INFO L93 Difference]: Finished difference Result 16331 states and 26816 transitions. [2025-03-08 07:34:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:14,435 INFO L225 Difference]: With dead ends: 16331 [2025-03-08 07:34:14,435 INFO L226 Difference]: Without dead ends: 9736 [2025-03-08 07:34:14,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:14,449 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 907 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:14,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1231 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9736 states. [2025-03-08 07:34:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9736 to 8076. [2025-03-08 07:34:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8076 states, 7249 states have (on average 1.5533176989929645) internal successors, (11260), 7329 states have internal predecessors, (11260), 498 states have call successors, (498), 231 states have call predecessors, (498), 327 states have return successors, (830), 531 states have call predecessors, (830), 497 states have call successors, (830) [2025-03-08 07:34:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8076 states to 8076 states and 12588 transitions. [2025-03-08 07:34:14,777 INFO L78 Accepts]: Start accepts. Automaton has 8076 states and 12588 transitions. Word has length 165 [2025-03-08 07:34:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:14,777 INFO L471 AbstractCegarLoop]: Abstraction has 8076 states and 12588 transitions. [2025-03-08 07:34:14,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:34:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 8076 states and 12588 transitions. [2025-03-08 07:34:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:14,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:14,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:14,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 07:34:14,782 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:14,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1190806595, now seen corresponding path program 1 times [2025-03-08 07:34:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:14,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997072370] [2025-03-08 07:34:14,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:14,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:14,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:14,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:14,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:14,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:14,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997072370] [2025-03-08 07:34:14,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997072370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:14,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:14,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:14,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761351997] [2025-03-08 07:34:14,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:14,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:14,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:14,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:14,864 INFO L87 Difference]: Start difference. First operand 8076 states and 12588 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:34:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:15,516 INFO L93 Difference]: Finished difference Result 16248 states and 26616 transitions. [2025-03-08 07:34:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:15,544 INFO L225 Difference]: With dead ends: 16248 [2025-03-08 07:34:15,545 INFO L226 Difference]: Without dead ends: 9653 [2025-03-08 07:34:15,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:15,561 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 904 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:15,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 1223 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2025-03-08 07:34:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 8076. [2025-03-08 07:34:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8076 states, 7249 states have (on average 1.5509725479376466) internal successors, (11243), 7329 states have internal predecessors, (11243), 498 states have call successors, (498), 231 states have call predecessors, (498), 327 states have return successors, (830), 531 states have call predecessors, (830), 497 states have call successors, (830) [2025-03-08 07:34:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8076 states to 8076 states and 12571 transitions. [2025-03-08 07:34:16,038 INFO L78 Accepts]: Start accepts. Automaton has 8076 states and 12571 transitions. Word has length 165 [2025-03-08 07:34:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:16,038 INFO L471 AbstractCegarLoop]: Abstraction has 8076 states and 12571 transitions. [2025-03-08 07:34:16,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:34:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8076 states and 12571 transitions. [2025-03-08 07:34:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:16,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:16,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:16,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 07:34:16,043 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:16,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1225630532, now seen corresponding path program 1 times [2025-03-08 07:34:16,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:16,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543974946] [2025-03-08 07:34:16,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:16,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:16,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:16,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:16,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:16,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:16,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:16,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543974946] [2025-03-08 07:34:16,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543974946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:16,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500351117] [2025-03-08 07:34:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:16,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:16,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:16,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:16,143 INFO L87 Difference]: Start difference. First operand 8076 states and 12571 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:34:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:16,846 INFO L93 Difference]: Finished difference Result 16165 states and 26416 transitions. [2025-03-08 07:34:16,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:16,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:16,871 INFO L225 Difference]: With dead ends: 16165 [2025-03-08 07:34:16,871 INFO L226 Difference]: Without dead ends: 9570 [2025-03-08 07:34:16,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:16,885 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 901 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:16,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1215 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9570 states. [2025-03-08 07:34:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9570 to 8076. [2025-03-08 07:34:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8076 states, 7249 states have (on average 1.5486273968823285) internal successors, (11226), 7329 states have internal predecessors, (11226), 498 states have call successors, (498), 231 states have call predecessors, (498), 327 states have return successors, (830), 531 states have call predecessors, (830), 497 states have call successors, (830) [2025-03-08 07:34:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8076 states to 8076 states and 12554 transitions. [2025-03-08 07:34:17,259 INFO L78 Accepts]: Start accepts. Automaton has 8076 states and 12554 transitions. Word has length 165 [2025-03-08 07:34:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:17,259 INFO L471 AbstractCegarLoop]: Abstraction has 8076 states and 12554 transitions. [2025-03-08 07:34:17,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:34:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 8076 states and 12554 transitions. [2025-03-08 07:34:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:17,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:17,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:17,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 07:34:17,263 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:17,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:17,263 INFO L85 PathProgramCache]: Analyzing trace with hash -712908765, now seen corresponding path program 1 times [2025-03-08 07:34:17,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:17,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497556420] [2025-03-08 07:34:17,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:17,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:17,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:17,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:17,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:17,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:17,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497556420] [2025-03-08 07:34:17,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497556420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:17,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:17,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602905608] [2025-03-08 07:34:17,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:17,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:17,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:17,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:17,358 INFO L87 Difference]: Start difference. First operand 8076 states and 12554 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:18,399 INFO L93 Difference]: Finished difference Result 22613 states and 37232 transitions. [2025-03-08 07:34:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:18,441 INFO L225 Difference]: With dead ends: 22613 [2025-03-08 07:34:18,441 INFO L226 Difference]: Without dead ends: 16018 [2025-03-08 07:34:18,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:18,456 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1187 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:18,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 3011 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16018 states. [2025-03-08 07:34:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16018 to 15668. [2025-03-08 07:34:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15668 states, 14279 states have (on average 1.6115974508018769) internal successors, (23012), 14505 states have internal predecessors, (23012), 818 states have call successors, (818), 327 states have call predecessors, (818), 569 states have return successors, (1918), 867 states have call predecessors, (1918), 817 states have call successors, (1918) [2025-03-08 07:34:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 25748 transitions. [2025-03-08 07:34:19,118 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 25748 transitions. Word has length 165 [2025-03-08 07:34:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:19,118 INFO L471 AbstractCegarLoop]: Abstraction has 15668 states and 25748 transitions. [2025-03-08 07:34:19,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 25748 transitions. [2025-03-08 07:34:19,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:19,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:19,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:19,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 07:34:19,124 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:19,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2134051684, now seen corresponding path program 1 times [2025-03-08 07:34:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420343470] [2025-03-08 07:34:19,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:19,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:19,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:19,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:19,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:19,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:19,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420343470] [2025-03-08 07:34:19,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420343470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:19,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:19,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:19,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305000481] [2025-03-08 07:34:19,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:19,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:19,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:19,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:19,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:19,183 INFO L87 Difference]: Start difference. First operand 15668 states and 25748 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:34:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:20,291 INFO L93 Difference]: Finished difference Result 33775 states and 57936 transitions. [2025-03-08 07:34:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:20,344 INFO L225 Difference]: With dead ends: 33775 [2025-03-08 07:34:20,344 INFO L226 Difference]: Without dead ends: 19588 [2025-03-08 07:34:20,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:20,374 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 897 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:20,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1201 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19588 states. [2025-03-08 07:34:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19588 to 15668. [2025-03-08 07:34:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15668 states, 14279 states have (on average 1.609286364591358) internal successors, (22979), 14505 states have internal predecessors, (22979), 818 states have call successors, (818), 327 states have call predecessors, (818), 569 states have return successors, (1918), 867 states have call predecessors, (1918), 817 states have call successors, (1918) [2025-03-08 07:34:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 25715 transitions. [2025-03-08 07:34:21,462 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 25715 transitions. Word has length 165 [2025-03-08 07:34:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:21,462 INFO L471 AbstractCegarLoop]: Abstraction has 15668 states and 25715 transitions. [2025-03-08 07:34:21,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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:34:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 25715 transitions. [2025-03-08 07:34:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:21,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:21,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:21,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 07:34:21,468 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:21,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash -822152189, now seen corresponding path program 1 times [2025-03-08 07:34:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:21,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885409403] [2025-03-08 07:34:21,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:21,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:21,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:21,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:21,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:21,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885409403] [2025-03-08 07:34:21,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885409403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:21,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585967862] [2025-03-08 07:34:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:21,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:21,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:21,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:21,549 INFO L87 Difference]: Start difference. First operand 15668 states and 25715 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:23,104 INFO L93 Difference]: Finished difference Result 47859 states and 82689 transitions. [2025-03-08 07:34:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:23,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:23,191 INFO L225 Difference]: With dead ends: 47859 [2025-03-08 07:34:23,191 INFO L226 Difference]: Without dead ends: 33672 [2025-03-08 07:34:23,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:23,231 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1174 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:23,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 2980 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33672 states. [2025-03-08 07:34:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33672 to 33120. [2025-03-08 07:34:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33120 states, 30445 states have (on average 1.660469699458039) internal successors, (50553), 31125 states have internal predecessors, (50553), 1458 states have call successors, (1458), 519 states have call predecessors, (1458), 1215 states have return successors, (5630), 1539 states have call predecessors, (5630), 1457 states have call successors, (5630) [2025-03-08 07:34:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33120 states to 33120 states and 57641 transitions. [2025-03-08 07:34:24,577 INFO L78 Accepts]: Start accepts. Automaton has 33120 states and 57641 transitions. Word has length 165 [2025-03-08 07:34:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:24,577 INFO L471 AbstractCegarLoop]: Abstraction has 33120 states and 57641 transitions. [2025-03-08 07:34:24,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33120 states and 57641 transitions. [2025-03-08 07:34:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:24,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:24,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:24,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 07:34:24,586 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:24,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:24,586 INFO L85 PathProgramCache]: Analyzing trace with hash -640418940, now seen corresponding path program 1 times [2025-03-08 07:34:24,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:24,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067896886] [2025-03-08 07:34:24,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:24,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:24,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:24,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:24,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:24,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:24,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:24,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067896886] [2025-03-08 07:34:24,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067896886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:24,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:24,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:24,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637070063] [2025-03-08 07:34:24,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:24,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:24,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:24,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:24,659 INFO L87 Difference]: Start difference. First operand 33120 states and 57641 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:28,124 INFO L93 Difference]: Finished difference Result 107189 states and 197069 transitions. [2025-03-08 07:34:28,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:28,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:28,409 INFO L225 Difference]: With dead ends: 107189 [2025-03-08 07:34:28,409 INFO L226 Difference]: Without dead ends: 75550 [2025-03-08 07:34:28,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:28,529 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 1169 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:28,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2968 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:28,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75550 states. [2025-03-08 07:34:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75550 to 74585. [2025-03-08 07:34:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74585 states, 68852 states have (on average 1.7041335037471679) internal successors, (117333), 70926 states have internal predecessors, (117333), 2738 states have call successors, (2738), 903 states have call predecessors, (2738), 2993 states have return successors, (19198), 2883 states have call predecessors, (19198), 2737 states have call successors, (19198) [2025-03-08 07:34:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74585 states to 74585 states and 139269 transitions. [2025-03-08 07:34:32,182 INFO L78 Accepts]: Start accepts. Automaton has 74585 states and 139269 transitions. Word has length 165 [2025-03-08 07:34:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:32,183 INFO L471 AbstractCegarLoop]: Abstraction has 74585 states and 139269 transitions. [2025-03-08 07:34:32,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 74585 states and 139269 transitions. [2025-03-08 07:34:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:34:32,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:32,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:32,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 07:34:32,198 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:32,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:32,198 INFO L85 PathProgramCache]: Analyzing trace with hash -496009245, now seen corresponding path program 1 times [2025-03-08 07:34:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:32,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834277125] [2025-03-08 07:34:32,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:32,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:34:32,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:34:32,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:32,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:32,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:32,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834277125] [2025-03-08 07:34:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834277125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:32,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319291093] [2025-03-08 07:34:32,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:32,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:32,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:32,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:32,274 INFO L87 Difference]: Start difference. First operand 74585 states and 139269 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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:34:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:40,151 INFO L93 Difference]: Finished difference Result 261070 states and 516200 transitions. [2025-03-08 07:34:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:40,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:34:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:40,906 INFO L225 Difference]: With dead ends: 261070 [2025-03-08 07:34:40,906 INFO L226 Difference]: Without dead ends: 187966 [2025-03-08 07:34:41,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:41,195 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 1508 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:41,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 2943 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187966 states.