./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.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.13.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 030c097c5e5981a6b9166b6af780aa84c84c48bf3e4236dc73dc256776dad070 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:34:09,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:34:09,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:34:09,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:34:09,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:34:09,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:34:09,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:34:09,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:34:09,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:34:09,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:34:09,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:34:09,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:34:09,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:34:09,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:34:09,341 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:34:09,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:34:09,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:34:09,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:34:09,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:34:09,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:34:09,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:34:09,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:34:09,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:34:09,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:34:09,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:34:09,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:34:09,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:34:09,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:34:09,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:34:09,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:34:09,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:34:09,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:34:09,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:34:09,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:34:09,344 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 -> 030c097c5e5981a6b9166b6af780aa84c84c48bf3e4236dc73dc256776dad070 [2025-03-08 07:34:09,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:34:09,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:34:09,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:34:09,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:34:09,691 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:34:09,691 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.13.cil-2.c [2025-03-08 07:34:10,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d99bfee/69a7ad5ed4e64708841909e504f8401a/FLAGa2b9f0b5d [2025-03-08 07:34:11,136 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:34:11,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2025-03-08 07:34:11,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d99bfee/69a7ad5ed4e64708841909e504f8401a/FLAGa2b9f0b5d [2025-03-08 07:34:11,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d99bfee/69a7ad5ed4e64708841909e504f8401a [2025-03-08 07:34:11,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:34:11,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:34:11,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:34:11,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:34:11,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:34:11,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4338f2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11, skipping insertion in model container [2025-03-08 07:34:11,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:34:11,569 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.13.cil-2.c[914,927] [2025-03-08 07:34:11,624 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.13.cil-2.c[7115,7128] [2025-03-08 07:34:11,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:34:11,746 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:34:11,754 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.13.cil-2.c[914,927] [2025-03-08 07:34:11,768 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.13.cil-2.c[7115,7128] [2025-03-08 07:34:11,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:34:11,828 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:34:11,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11 WrapperNode [2025-03-08 07:34:11,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:34:11,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:34:11,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:34:11,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:34:11,834 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:34:11" (1/1) ... [2025-03-08 07:34:11,849 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:34:11" (1/1) ... [2025-03-08 07:34:11,889 INFO L138 Inliner]: procedures = 79, calls = 96, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1068 [2025-03-08 07:34:11,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:34:11,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:34:11,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:34:11,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:34:11,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,929 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:34:11,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:34:11,953 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:34:11,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:34:11,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:34:11,955 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (1/1) ... [2025-03-08 07:34:11,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:34:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:11,982 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:34:11,984 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:34:12,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:34:12,000 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:34:12,000 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:34:12,000 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:34:12,000 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:34:12,000 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:34:12,000 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:34:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:34:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:34:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:34:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:34:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:34:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:34:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:34:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:34:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:34:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:34:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:34:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:34:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:34:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:34:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:34:12,002 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:34:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:34:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:34:12,002 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:34:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:34:12,002 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:34:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:34:12,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:34:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:34:12,002 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:34:12,093 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:34:12,094 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:34:12,878 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-03-08 07:34:12,878 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:34:12,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:34:12,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:34:12,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:34:12 BoogieIcfgContainer [2025-03-08 07:34:12,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:34:12,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:34:12,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:34:12,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:34:12,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:34:11" (1/3) ... [2025-03-08 07:34:12,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c27404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:34:12, skipping insertion in model container [2025-03-08 07:34:12,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:34:11" (2/3) ... [2025-03-08 07:34:12,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c27404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:34:12, skipping insertion in model container [2025-03-08 07:34:12,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:34:12" (3/3) ... [2025-03-08 07:34:12,909 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2025-03-08 07:34:12,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:34:12,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.13.cil-2.c that has 15 procedures, 502 locations, 1 initial locations, 20 loop locations, and 2 error locations. [2025-03-08 07:34:12,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:34:12,984 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;@7f06c0b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:34:12,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:34:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 502 states, 446 states have (on average 1.600896860986547) internal successors, (714), 450 states have internal predecessors, (714), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 07:34:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:12,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:12,996 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:34:12,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:13,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash 367813669, now seen corresponding path program 1 times [2025-03-08 07:34:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008102186] [2025-03-08 07:34:13,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:13,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:13,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:13,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:13,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:13,393 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,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:13,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008102186] [2025-03-08 07:34:13,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008102186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:13,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:13,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:13,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435039605] [2025-03-08 07:34:13,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:13,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:13,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:13,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:13,417 INFO L87 Difference]: Start difference. First operand has 502 states, 446 states have (on average 1.600896860986547) internal successors, (714), 450 states have internal predecessors, (714), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) 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:34:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:14,257 INFO L93 Difference]: Finished difference Result 1074 states and 1694 transitions. [2025-03-08 07:34:14,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:14,259 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:34:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:14,273 INFO L225 Difference]: With dead ends: 1074 [2025-03-08 07:34:14,273 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 07:34:14,278 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:34:14,280 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 496 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:14,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1591 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:34:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 07:34:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 584. [2025-03-08 07:34:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 508 states have (on average 1.5413385826771653) internal successors, (783), 514 states have internal predecessors, (783), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2025-03-08 07:34:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 890 transitions. [2025-03-08 07:34:14,348 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 890 transitions. Word has length 62 [2025-03-08 07:34:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:14,349 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 890 transitions. [2025-03-08 07:34:14,349 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:34:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 890 transitions. [2025-03-08 07:34:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:14,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:14,352 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:34:14,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:34:14,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2053112328, now seen corresponding path program 1 times [2025-03-08 07:34:14,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:14,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802737020] [2025-03-08 07:34:14,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:14,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:14,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:14,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:14,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:14,545 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,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:14,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802737020] [2025-03-08 07:34:14,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802737020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:14,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:14,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:14,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139738054] [2025-03-08 07:34:14,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:14,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:14,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:14,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:14,548 INFO L87 Difference]: Start difference. First operand 584 states and 890 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:34:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:15,332 INFO L93 Difference]: Finished difference Result 889 states and 1309 transitions. [2025-03-08 07:34:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:15,333 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:34:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:15,340 INFO L225 Difference]: With dead ends: 889 [2025-03-08 07:34:15,340 INFO L226 Difference]: Without dead ends: 720 [2025-03-08 07:34:15,341 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:34:15,342 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1131 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:15,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 1761 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:34:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-08 07:34:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 676. [2025-03-08 07:34:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 580 states have (on average 1.5224137931034483) internal successors, (883), 588 states have internal predecessors, (883), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2025-03-08 07:34:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1020 transitions. [2025-03-08 07:34:15,392 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1020 transitions. Word has length 62 [2025-03-08 07:34:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:15,392 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1020 transitions. [2025-03-08 07:34:15,393 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:34:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1020 transitions. [2025-03-08 07:34:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:15,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:15,395 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:34:15,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:34:15,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1272273945, now seen corresponding path program 1 times [2025-03-08 07:34:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139517288] [2025-03-08 07:34:15,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:15,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:15,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:15,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:15,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:15,488 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:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:15,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139517288] [2025-03-08 07:34:15,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139517288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:15,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:15,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567851709] [2025-03-08 07:34:15,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:15,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:15,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:15,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:15,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:15,490 INFO L87 Difference]: Start difference. First operand 676 states and 1020 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:34:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:15,531 INFO L93 Difference]: Finished difference Result 936 states and 1381 transitions. [2025-03-08 07:34:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:15,532 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:34:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:15,535 INFO L225 Difference]: With dead ends: 936 [2025-03-08 07:34:15,535 INFO L226 Difference]: Without dead ends: 681 [2025-03-08 07:34:15,536 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:34:15,537 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 0 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3790 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:34:15,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3790 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-08 07:34:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2025-03-08 07:34:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 584 states have (on average 1.5154109589041096) internal successors, (885), 592 states have internal predecessors, (885), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (75), 64 states have call predecessors, (75), 61 states have call successors, (75) [2025-03-08 07:34:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1023 transitions. [2025-03-08 07:34:15,564 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1023 transitions. Word has length 62 [2025-03-08 07:34:15,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:15,564 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1023 transitions. [2025-03-08 07:34:15,564 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:34:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1023 transitions. [2025-03-08 07:34:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:15,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:15,566 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:34:15,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:34:15,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:15,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:15,567 INFO L85 PathProgramCache]: Analyzing trace with hash 453206952, now seen corresponding path program 1 times [2025-03-08 07:34:15,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:15,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845552542] [2025-03-08 07:34:15,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:15,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:15,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:15,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:15,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:15,699 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:15,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:15,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845552542] [2025-03-08 07:34:15,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845552542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:15,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:15,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:34:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747218835] [2025-03-08 07:34:15,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:15,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:34:15,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:15,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:34:15,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:34:15,702 INFO L87 Difference]: Start difference. First operand 681 states and 1023 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:34:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:16,758 INFO L93 Difference]: Finished difference Result 1863 states and 2659 transitions. [2025-03-08 07:34:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:34:16,759 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:34:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:16,766 INFO L225 Difference]: With dead ends: 1863 [2025-03-08 07:34:16,766 INFO L226 Difference]: Without dead ends: 1585 [2025-03-08 07:34:16,768 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:34:16,768 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 3268 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3282 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:16,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3282 Valid, 1906 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:34:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-03-08 07:34:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1537. [2025-03-08 07:34:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1254 states have (on average 1.4186602870813396) internal successors, (1779), 1277 states have internal predecessors, (1779), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (189), 151 states have call predecessors, (189), 149 states have call successors, (189) [2025-03-08 07:34:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2119 transitions. [2025-03-08 07:34:16,847 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2119 transitions. Word has length 62 [2025-03-08 07:34:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:16,847 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 2119 transitions. [2025-03-08 07:34:16,847 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:34:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2119 transitions. [2025-03-08 07:34:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:16,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:16,848 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:34:16,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:34:16,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:16,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2036470533, now seen corresponding path program 1 times [2025-03-08 07:34:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659721735] [2025-03-08 07:34:16,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:16,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:16,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:16,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:16,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:16,915 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,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659721735] [2025-03-08 07:34:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659721735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:16,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:16,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733233937] [2025-03-08 07:34:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:16,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:16,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:16,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:16,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:16,916 INFO L87 Difference]: Start difference. First operand 1537 states and 2119 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:34:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:16,983 INFO L93 Difference]: Finished difference Result 2695 states and 3640 transitions. [2025-03-08 07:34:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:16,986 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:34:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:16,994 INFO L225 Difference]: With dead ends: 2695 [2025-03-08 07:34:16,994 INFO L226 Difference]: Without dead ends: 1567 [2025-03-08 07:34:16,997 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:34:16,998 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 0 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3790 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:34:16,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3790 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-03-08 07:34:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2025-03-08 07:34:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1278 states have (on average 1.4045383411580594) internal successors, (1795), 1301 states have internal predecessors, (1795), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (195), 157 states have call predecessors, (195), 149 states have call successors, (195) [2025-03-08 07:34:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2141 transitions. [2025-03-08 07:34:17,085 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2141 transitions. Word has length 62 [2025-03-08 07:34:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:17,086 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2141 transitions. [2025-03-08 07:34:17,086 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:34:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2141 transitions. [2025-03-08 07:34:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:17,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:17,087 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:34:17,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:34:17,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:17,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:17,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2067490340, now seen corresponding path program 1 times [2025-03-08 07:34:17,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:17,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94912084] [2025-03-08 07:34:17,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:17,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:17,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:17,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:17,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:17,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:17,225 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,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94912084] [2025-03-08 07:34:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94912084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:17,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:17,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:17,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760909414] [2025-03-08 07:34:17,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:17,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:17,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:17,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:17,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:17,227 INFO L87 Difference]: Start difference. First operand 1567 states and 2141 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:34:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:18,089 INFO L93 Difference]: Finished difference Result 2739 states and 3597 transitions. [2025-03-08 07:34:18,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:34:18,089 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:34:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:18,097 INFO L225 Difference]: With dead ends: 2739 [2025-03-08 07:34:18,097 INFO L226 Difference]: Without dead ends: 1793 [2025-03-08 07:34:18,099 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:34:18,099 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 1116 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:18,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 1567 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:34:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-03-08 07:34:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1512. [2025-03-08 07:34:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1239 states have (on average 1.4019370460048426) internal successors, (1737), 1257 states have internal predecessors, (1737), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (180), 150 states have call predecessors, (180), 143 states have call successors, (180) [2025-03-08 07:34:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2062 transitions. [2025-03-08 07:34:18,177 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2062 transitions. Word has length 62 [2025-03-08 07:34:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:18,178 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2062 transitions. [2025-03-08 07:34:18,178 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:34:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2062 transitions. [2025-03-08 07:34:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:34:18,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:18,179 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:34:18,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:34:18,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:18,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2016126043, now seen corresponding path program 1 times [2025-03-08 07:34:18,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:18,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805384454] [2025-03-08 07:34:18,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:18,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:34:18,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:34:18,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:18,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:18,237 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:18,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:18,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805384454] [2025-03-08 07:34:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805384454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:18,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:18,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:34:18,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352250956] [2025-03-08 07:34:18,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:18,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:34:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:18,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:34:18,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:34:18,240 INFO L87 Difference]: Start difference. First operand 1512 states and 2062 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:34:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:18,773 INFO L93 Difference]: Finished difference Result 3643 states and 4801 transitions. [2025-03-08 07:34:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:34:18,773 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:34:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:18,785 INFO L225 Difference]: With dead ends: 3643 [2025-03-08 07:34:18,785 INFO L226 Difference]: Without dead ends: 2541 [2025-03-08 07:34:18,787 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:34:18,789 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1077 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:18,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 796 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:34:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2025-03-08 07:34:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 2537. [2025-03-08 07:34:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2021 states have (on average 1.3315190499752598) internal successors, (2691), 2056 states have internal predecessors, (2691), 264 states have call successors, (264), 205 states have call predecessors, (264), 250 states have return successors, (371), 278 states have call predecessors, (371), 262 states have call successors, (371) [2025-03-08 07:34:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3326 transitions. [2025-03-08 07:34:18,912 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3326 transitions. Word has length 62 [2025-03-08 07:34:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:18,912 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 3326 transitions. [2025-03-08 07:34:18,912 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:34:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3326 transitions. [2025-03-08 07:34:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:34:18,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:18,913 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:34:18,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:34:18,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:18,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash 112219343, now seen corresponding path program 1 times [2025-03-08 07:34:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536247506] [2025-03-08 07:34:18,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:18,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:34:18,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:34:18,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:18,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:18,940 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:18,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:18,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536247506] [2025-03-08 07:34:18,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536247506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:18,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:18,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:18,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891597003] [2025-03-08 07:34:18,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:18,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:18,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:18,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:18,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:18,942 INFO L87 Difference]: Start difference. First operand 2537 states and 3326 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:34:19,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:19,078 INFO L93 Difference]: Finished difference Result 5521 states and 7111 transitions. [2025-03-08 07:34:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:19,079 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:34:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:19,091 INFO L225 Difference]: With dead ends: 5521 [2025-03-08 07:34:19,091 INFO L226 Difference]: Without dead ends: 3399 [2025-03-08 07:34:19,095 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:19,096 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 101 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1491 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:34:19,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1491 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:34:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2025-03-08 07:34:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3331. [2025-03-08 07:34:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 2629 states have (on average 1.3107645492582731) internal successors, (3446), 2669 states have internal predecessors, (3446), 356 states have call successors, (356), 285 states have call predecessors, (356), 344 states have return successors, (485), 379 states have call predecessors, (485), 354 states have call successors, (485) [2025-03-08 07:34:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4287 transitions. [2025-03-08 07:34:19,285 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4287 transitions. Word has length 63 [2025-03-08 07:34:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:19,285 INFO L471 AbstractCegarLoop]: Abstraction has 3331 states and 4287 transitions. [2025-03-08 07:34:19,285 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:34:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4287 transitions. [2025-03-08 07:34:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:34:19,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:19,286 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:34:19,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:34:19,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:19,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash 969861371, now seen corresponding path program 1 times [2025-03-08 07:34:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174323138] [2025-03-08 07:34:19,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:19,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:19,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:34:19,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:34:19,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:19,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:19,378 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:34:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:19,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174323138] [2025-03-08 07:34:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174323138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:19,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:19,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:34:19,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603021990] [2025-03-08 07:34:19,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:19,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:34:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:19,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:34:19,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:34:19,381 INFO L87 Difference]: Start difference. First operand 3331 states and 4287 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:34:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:19,733 INFO L93 Difference]: Finished difference Result 4256 states and 5405 transitions. [2025-03-08 07:34:19,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:19,733 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:34:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:19,750 INFO L225 Difference]: With dead ends: 4256 [2025-03-08 07:34:19,750 INFO L226 Difference]: Without dead ends: 4253 [2025-03-08 07:34:19,751 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:34:19,753 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 1420 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:19,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 863 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:34:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2025-03-08 07:34:19,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 3781. [2025-03-08 07:34:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 2972 states have (on average 1.297442799461642) internal successors, (3856), 3015 states have internal predecessors, (3856), 406 states have call successors, (406), 329 states have call predecessors, (406), 401 states have return successors, (562), 439 states have call predecessors, (562), 405 states have call successors, (562) [2025-03-08 07:34:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 4824 transitions. [2025-03-08 07:34:19,997 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 4824 transitions. Word has length 68 [2025-03-08 07:34:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:19,997 INFO L471 AbstractCegarLoop]: Abstraction has 3781 states and 4824 transitions. [2025-03-08 07:34:19,997 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:34:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 4824 transitions. [2025-03-08 07:34:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:34:19,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:19,998 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:34:19,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:34:19,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash 310539, now seen corresponding path program 1 times [2025-03-08 07:34:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619682533] [2025-03-08 07:34:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:20,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:34:20,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:34:20,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:20,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:20,079 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:34:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619682533] [2025-03-08 07:34:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619682533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:34:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218957108] [2025-03-08 07:34:20,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:20,082 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:34:20,084 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:34:20,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:34:20,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:34:20,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:20,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:20,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:34:20,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:34:20,357 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:34:20,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:34:20,423 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:34:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218957108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:34:20,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:34:20,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-08 07:34:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221380804] [2025-03-08 07:34:20,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:34:20,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:34:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:20,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:34:20,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:34:20,424 INFO L87 Difference]: Start difference. First operand 3781 states and 4824 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:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:21,136 INFO L93 Difference]: Finished difference Result 7605 states and 9500 transitions. [2025-03-08 07:34:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:34:21,137 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:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:21,168 INFO L225 Difference]: With dead ends: 7605 [2025-03-08 07:34:21,168 INFO L226 Difference]: Without dead ends: 7602 [2025-03-08 07:34:21,173 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:21,174 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 1739 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:21,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 2709 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:34:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7602 states. [2025-03-08 07:34:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7602 to 7221. [2025-03-08 07:34:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7221 states, 5634 states have (on average 1.268370607028754) internal successors, (7146), 5712 states have internal predecessors, (7146), 783 states have call successors, (783), 659 states have call predecessors, (783), 802 states have return successors, (1087), 852 states have call predecessors, (1087), 782 states have call successors, (1087) [2025-03-08 07:34:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7221 states to 7221 states and 9016 transitions. [2025-03-08 07:34:21,591 INFO L78 Accepts]: Start accepts. Automaton has 7221 states and 9016 transitions. Word has length 69 [2025-03-08 07:34:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:21,592 INFO L471 AbstractCegarLoop]: Abstraction has 7221 states and 9016 transitions. [2025-03-08 07:34:21,592 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:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7221 states and 9016 transitions. [2025-03-08 07:34:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:34:21,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:21,594 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:21,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 07:34:21,794 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:21,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:21,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:21,795 INFO L85 PathProgramCache]: Analyzing trace with hash 144837486, now seen corresponding path program 2 times [2025-03-08 07:34:21,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:21,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324516546] [2025-03-08 07:34:21,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:34:21,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:21,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 07:34:21,810 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:21,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:34:21,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:21,829 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:21,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:21,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324516546] [2025-03-08 07:34:21,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324516546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:21,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:21,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:21,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643898176] [2025-03-08 07:34:21,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:21,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:21,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:21,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:21,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:21,831 INFO L87 Difference]: Start difference. First operand 7221 states and 9016 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:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:21,987 INFO L93 Difference]: Finished difference Result 9516 states and 11909 transitions. [2025-03-08 07:34:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:21,987 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:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:22,006 INFO L225 Difference]: With dead ends: 9516 [2025-03-08 07:34:22,007 INFO L226 Difference]: Without dead ends: 3580 [2025-03-08 07:34:22,020 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:22,021 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 731 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 947 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:22,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 947 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:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2025-03-08 07:34:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 2849. [2025-03-08 07:34:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2264 states have (on average 1.2893109540636043) internal successors, (2919), 2288 states have internal predecessors, (2919), 304 states have call successors, (304), 243 states have call predecessors, (304), 279 states have return successors, (389), 320 states have call predecessors, (389), 303 states have call successors, (389) [2025-03-08 07:34:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 3612 transitions. [2025-03-08 07:34:22,217 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 3612 transitions. Word has length 71 [2025-03-08 07:34:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:22,217 INFO L471 AbstractCegarLoop]: Abstraction has 2849 states and 3612 transitions. [2025-03-08 07:34:22,218 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:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3612 transitions. [2025-03-08 07:34:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:34:22,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:22,221 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:22,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:34:22,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash 193210692, now seen corresponding path program 1 times [2025-03-08 07:34:22,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:22,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249826288] [2025-03-08 07:34:22,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:22,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:34:22,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:34:22,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:22,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:22,305 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:22,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:22,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249826288] [2025-03-08 07:34:22,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249826288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:22,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:22,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:22,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769806937] [2025-03-08 07:34:22,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:22,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:22,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:22,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:22,307 INFO L87 Difference]: Start difference. First operand 2849 states and 3612 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:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:23,488 INFO L93 Difference]: Finished difference Result 7769 states and 9625 transitions. [2025-03-08 07:34:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 07:34:23,489 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:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:23,505 INFO L225 Difference]: With dead ends: 7769 [2025-03-08 07:34:23,505 INFO L226 Difference]: Without dead ends: 4581 [2025-03-08 07:34:23,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:34:23,513 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 849 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:23,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 2013 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:34:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2025-03-08 07:34:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4404. [2025-03-08 07:34:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4404 states, 3449 states have (on average 1.2473180632067267) internal successors, (4302), 3503 states have internal predecessors, (4302), 479 states have call successors, (479), 397 states have call predecessors, (479), 474 states have return successors, (679), 506 states have call predecessors, (679), 478 states have call successors, (679) [2025-03-08 07:34:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 5460 transitions. [2025-03-08 07:34:23,841 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 5460 transitions. Word has length 80 [2025-03-08 07:34:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:23,841 INFO L471 AbstractCegarLoop]: Abstraction has 4404 states and 5460 transitions. [2025-03-08 07:34:23,841 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:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 5460 transitions. [2025-03-08 07:34:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:34:23,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:23,842 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:23,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:34:23,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:23,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1439872493, now seen corresponding path program 1 times [2025-03-08 07:34:23,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:23,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166348774] [2025-03-08 07:34:23,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:23,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:34:23,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:34:23,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:23,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:23,922 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:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166348774] [2025-03-08 07:34:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166348774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:23,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:34:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162027291] [2025-03-08 07:34:23,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:23,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:34:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:23,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:34:23,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:34:23,923 INFO L87 Difference]: Start difference. First operand 4404 states and 5460 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:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:24,954 INFO L93 Difference]: Finished difference Result 7351 states and 9035 transitions. [2025-03-08 07:34:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:34:24,955 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:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:24,973 INFO L225 Difference]: With dead ends: 7351 [2025-03-08 07:34:24,974 INFO L226 Difference]: Without dead ends: 3573 [2025-03-08 07:34:24,981 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:24,982 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 1729 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:24,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 2081 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:34:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2025-03-08 07:34:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3252. [2025-03-08 07:34:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3252 states, 2555 states have (on average 1.2426614481409002) internal successors, (3175), 2596 states have internal predecessors, (3175), 348 states have call successors, (348), 280 states have call predecessors, (348), 347 states have return successors, (468), 378 states have call predecessors, (468), 347 states have call successors, (468) [2025-03-08 07:34:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 3991 transitions. [2025-03-08 07:34:25,146 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 3991 transitions. Word has length 86 [2025-03-08 07:34:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:25,147 INFO L471 AbstractCegarLoop]: Abstraction has 3252 states and 3991 transitions. [2025-03-08 07:34:25,147 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:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 3991 transitions. [2025-03-08 07:34:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 07:34:25,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:25,152 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:25,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:34:25,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:25,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1939638016, now seen corresponding path program 1 times [2025-03-08 07:34:25,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:25,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567006164] [2025-03-08 07:34:25,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:25,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:34:25,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:34:25,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:25,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:25,271 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:25,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567006164] [2025-03-08 07:34:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567006164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:34:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644231426] [2025-03-08 07:34:25,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:25,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:25,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:25,274 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:25,276 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:25,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:34:25,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:34:25,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:25,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:25,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 07:34:25,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:34:25,413 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:25,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:34:25,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644231426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:25,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:34:25,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 07:34:25,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441461597] [2025-03-08 07:34:25,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:25,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:25,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:25,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:25,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:34:25,415 INFO L87 Difference]: Start difference. First operand 3252 states and 3991 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:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:25,528 INFO L93 Difference]: Finished difference Result 4730 states and 5755 transitions. [2025-03-08 07:34:25,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:25,530 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:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:25,537 INFO L225 Difference]: With dead ends: 4730 [2025-03-08 07:34:25,537 INFO L226 Difference]: Without dead ends: 1893 [2025-03-08 07:34:25,542 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:25,542 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 0 mSDsluCounter, 3015 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3771 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:25,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3771 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:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2025-03-08 07:34:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1880. [2025-03-08 07:34:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1544 states have (on average 1.2804404145077721) internal successors, (1977), 1558 states have internal predecessors, (1977), 172 states have call successors, (172), 125 states have call predecessors, (172), 162 states have return successors, (230), 197 states have call predecessors, (230), 171 states have call successors, (230) [2025-03-08 07:34:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2379 transitions. [2025-03-08 07:34:25,625 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2379 transitions. Word has length 139 [2025-03-08 07:34:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:25,625 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 2379 transitions. [2025-03-08 07:34:25,625 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:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2379 transitions. [2025-03-08 07:34:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 07:34:25,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:25,629 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:25,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:34:25,829 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:25,830 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:25,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1879970496, now seen corresponding path program 1 times [2025-03-08 07:34:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737702490] [2025-03-08 07:34:25,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:25,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:25,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 07:34:25,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 07:34:25,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:25,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:25,864 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:25,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:25,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737702490] [2025-03-08 07:34:25,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737702490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:25,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:25,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:25,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630165528] [2025-03-08 07:34:25,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:25,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:25,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:25,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:25,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:25,866 INFO L87 Difference]: Start difference. First operand 1880 states and 2379 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:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:25,929 INFO L93 Difference]: Finished difference Result 3024 states and 3747 transitions. [2025-03-08 07:34:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:25,929 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:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:25,936 INFO L225 Difference]: With dead ends: 3024 [2025-03-08 07:34:25,937 INFO L226 Difference]: Without dead ends: 1728 [2025-03-08 07:34:25,939 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:25,939 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 119 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1391 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:25,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1391 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:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-03-08 07:34:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1728. [2025-03-08 07:34:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1428 states have (on average 1.2948179271708684) internal successors, (1849), 1442 states have internal predecessors, (1849), 154 states have call successors, (154), 109 states have call predecessors, (154), 144 states have return successors, (207), 177 states have call predecessors, (207), 153 states have call successors, (207) [2025-03-08 07:34:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2210 transitions. [2025-03-08 07:34:26,015 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2210 transitions. Word has length 141 [2025-03-08 07:34:26,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:26,015 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2210 transitions. [2025-03-08 07:34:26,016 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:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2210 transitions. [2025-03-08 07:34:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 07:34:26,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:26,018 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:26,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:34:26,018 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:26,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2054798581, now seen corresponding path program 1 times [2025-03-08 07:34:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:26,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152510527] [2025-03-08 07:34:26,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:26,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 07:34:26,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 07:34:26,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:26,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:26,092 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:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:26,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152510527] [2025-03-08 07:34:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152510527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:26,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:26,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543486248] [2025-03-08 07:34:26,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:26,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:26,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:26,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:26,094 INFO L87 Difference]: Start difference. First operand 1728 states and 2210 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:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:26,688 INFO L93 Difference]: Finished difference Result 2923 states and 3638 transitions. [2025-03-08 07:34:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:26,688 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:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:26,696 INFO L225 Difference]: With dead ends: 2923 [2025-03-08 07:34:26,696 INFO L226 Difference]: Without dead ends: 1678 [2025-03-08 07:34:26,699 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:26,699 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 382 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:26,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1542 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2025-03-08 07:34:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1588. [2025-03-08 07:34:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1316 states have (on average 1.310790273556231) internal successors, (1725), 1329 states have internal predecessors, (1725), 140 states have call successors, (140), 97 states have call predecessors, (140), 130 states have return successors, (187), 162 states have call predecessors, (187), 139 states have call successors, (187) [2025-03-08 07:34:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2052 transitions. [2025-03-08 07:34:26,795 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2052 transitions. Word has length 150 [2025-03-08 07:34:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:26,795 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 2052 transitions. [2025-03-08 07:34:26,796 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:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2052 transitions. [2025-03-08 07:34:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 07:34:26,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:26,798 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:26,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:34:26,798 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:26,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -17933349, now seen corresponding path program 1 times [2025-03-08 07:34:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22796533] [2025-03-08 07:34:26,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:26,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:26,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:34:26,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:34:26,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:26,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:27,001 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:27,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:27,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22796533] [2025-03-08 07:34:27,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22796533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:34:27,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876113948] [2025-03-08 07:34:27,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:27,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:34:27,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:34:27,004 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:27,006 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:27,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 07:34:27,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 07:34:27,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:27,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:27,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 07:34:27,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:34:27,239 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:27,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:34:27,437 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:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876113948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:34:27,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:34:27,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-08 07:34:27,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324552013] [2025-03-08 07:34:27,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:34:27,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 07:34:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:27,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 07:34:27,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:34:27,440 INFO L87 Difference]: Start difference. First operand 1588 states and 2052 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:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:28,630 INFO L93 Difference]: Finished difference Result 3334 states and 4225 transitions. [2025-03-08 07:34:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 07:34:28,630 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:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:28,638 INFO L225 Difference]: With dead ends: 3334 [2025-03-08 07:34:28,639 INFO L226 Difference]: Without dead ends: 2073 [2025-03-08 07:34:28,642 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:28,642 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1838 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1869 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:28,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1869 Valid, 2502 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:34:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2025-03-08 07:34:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1862. [2025-03-08 07:34:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1515 states have (on average 1.26996699669967) internal successors, (1924), 1529 states have internal predecessors, (1924), 180 states have call successors, (180), 135 states have call predecessors, (180), 165 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2025-03-08 07:34:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2360 transitions. [2025-03-08 07:34:28,735 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2360 transitions. Word has length 153 [2025-03-08 07:34:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:28,735 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2360 transitions. [2025-03-08 07:34:28,735 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:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2360 transitions. [2025-03-08 07:34:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:28,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:28,738 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, 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:28,745 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:28,938 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:28,939 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:28,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash 209531798, now seen corresponding path program 1 times [2025-03-08 07:34:28,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:28,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877000287] [2025-03-08 07:34:28,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:28,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:28,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:28,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:28,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:29,023 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:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877000287] [2025-03-08 07:34:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877000287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:29,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848552436] [2025-03-08 07:34:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:29,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:29,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:29,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:29,025 INFO L87 Difference]: Start difference. First operand 1862 states and 2360 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:29,167 INFO L93 Difference]: Finished difference Result 2255 states and 2984 transitions. [2025-03-08 07:34:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:29,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:29,175 INFO L225 Difference]: With dead ends: 2255 [2025-03-08 07:34:29,175 INFO L226 Difference]: Without dead ends: 1862 [2025-03-08 07:34:29,176 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:29,177 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 627 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 880 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:29,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 880 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:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-03-08 07:34:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1862. [2025-03-08 07:34:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1515 states have (on average 1.2693069306930693) internal successors, (1923), 1529 states have internal predecessors, (1923), 180 states have call successors, (180), 135 states have call predecessors, (180), 165 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2025-03-08 07:34:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2359 transitions. [2025-03-08 07:34:29,324 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2359 transitions. Word has length 187 [2025-03-08 07:34:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:29,324 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2359 transitions. [2025-03-08 07:34:29,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2359 transitions. [2025-03-08 07:34:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:29,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:29,327 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, 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:29,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:34:29,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:29,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1192525175, now seen corresponding path program 1 times [2025-03-08 07:34:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067710167] [2025-03-08 07:34:29,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:29,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:29,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:29,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:29,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:29,385 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:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:29,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067710167] [2025-03-08 07:34:29,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067710167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:29,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:29,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:34:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942728855] [2025-03-08 07:34:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:29,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:34:29,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:29,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:34:29,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:34:29,387 INFO L87 Difference]: Start difference. First operand 1862 states and 2359 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:29,467 INFO L93 Difference]: Finished difference Result 2247 states and 2967 transitions. [2025-03-08 07:34:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:34:29,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:29,474 INFO L225 Difference]: With dead ends: 2247 [2025-03-08 07:34:29,474 INFO L226 Difference]: Without dead ends: 1862 [2025-03-08 07:34:29,476 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:29,476 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 618 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 879 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:29,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 879 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:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-03-08 07:34:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1862. [2025-03-08 07:34:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1515 states have (on average 1.2686468646864686) internal successors, (1922), 1529 states have internal predecessors, (1922), 180 states have call successors, (180), 135 states have call predecessors, (180), 165 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2025-03-08 07:34:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2358 transitions. [2025-03-08 07:34:29,567 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2358 transitions. Word has length 187 [2025-03-08 07:34:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:29,567 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2358 transitions. [2025-03-08 07:34:29,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2358 transitions. [2025-03-08 07:34:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:29,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:29,570 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, 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:29,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:34:29,572 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:29,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1944074328, now seen corresponding path program 1 times [2025-03-08 07:34:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:29,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038126460] [2025-03-08 07:34:29,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:29,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:29,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:29,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:29,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:29,670 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:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038126460] [2025-03-08 07:34:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038126460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742438230] [2025-03-08 07:34:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:29,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:29,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:29,672 INFO L87 Difference]: Start difference. First operand 1862 states and 2358 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 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:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:30,292 INFO L93 Difference]: Finished difference Result 2672 states and 3658 transitions. [2025-03-08 07:34:30,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:34:30,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:30,299 INFO L225 Difference]: With dead ends: 2672 [2025-03-08 07:34:30,299 INFO L226 Difference]: Without dead ends: 2293 [2025-03-08 07:34:30,300 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:30,301 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1393 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:30,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 1899 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2025-03-08 07:34:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2262. [2025-03-08 07:34:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2262 states, 1886 states have (on average 1.3345705196182396) internal successors, (2517), 1901 states have internal predecessors, (2517), 202 states have call successors, (202), 141 states have call predecessors, (202), 172 states have return successors, (279), 220 states have call predecessors, (279), 201 states have call successors, (279) [2025-03-08 07:34:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2998 transitions. [2025-03-08 07:34:30,400 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2998 transitions. Word has length 187 [2025-03-08 07:34:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:30,400 INFO L471 AbstractCegarLoop]: Abstraction has 2262 states and 2998 transitions. [2025-03-08 07:34:30,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 4 states have internal predecessors, (177), 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:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2998 transitions. [2025-03-08 07:34:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:30,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:30,403 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, 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:30,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:34:30,404 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:30,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash 492612250, now seen corresponding path program 1 times [2025-03-08 07:34:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:30,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592810508] [2025-03-08 07:34:30,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:30,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:30,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:30,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:30,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:30,511 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:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:30,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592810508] [2025-03-08 07:34:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592810508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:30,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:30,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:30,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055636039] [2025-03-08 07:34:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:30,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:30,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:30,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:30,513 INFO L87 Difference]: Start difference. First operand 2262 states and 2998 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:31,204 INFO L93 Difference]: Finished difference Result 3555 states and 5095 transitions. [2025-03-08 07:34:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:31,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:31,213 INFO L225 Difference]: With dead ends: 3555 [2025-03-08 07:34:31,213 INFO L226 Difference]: Without dead ends: 2776 [2025-03-08 07:34:31,216 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:31,216 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 1405 mSDsluCounter, 2691 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:31,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 3578 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2025-03-08 07:34:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2633. [2025-03-08 07:34:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2228 states have (on average 1.3707360861759426) internal successors, (3054), 2244 states have internal predecessors, (3054), 224 states have call successors, (224), 147 states have call predecessors, (224), 179 states have return successors, (304), 243 states have call predecessors, (304), 223 states have call successors, (304) [2025-03-08 07:34:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3582 transitions. [2025-03-08 07:34:31,341 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3582 transitions. Word has length 187 [2025-03-08 07:34:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:31,342 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3582 transitions. [2025-03-08 07:34:31,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3582 transitions. [2025-03-08 07:34:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:31,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:31,345 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, 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:31,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:34:31,346 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:31,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 777748153, now seen corresponding path program 1 times [2025-03-08 07:34:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:31,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200511052] [2025-03-08 07:34:31,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:31,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:31,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:31,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:31,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:31,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:31,485 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:31,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200511052] [2025-03-08 07:34:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200511052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:31,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:31,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665165832] [2025-03-08 07:34:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:31,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:31,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:31,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:31,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:31,487 INFO L87 Difference]: Start difference. First operand 2633 states and 3582 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:32,255 INFO L93 Difference]: Finished difference Result 4744 states and 6998 transitions. [2025-03-08 07:34:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:32,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:32,268 INFO L225 Difference]: With dead ends: 4744 [2025-03-08 07:34:32,268 INFO L226 Difference]: Without dead ends: 3594 [2025-03-08 07:34:32,271 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:32,273 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 1400 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 3562 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:32,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 3562 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-03-08 07:34:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3428. [2025-03-08 07:34:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3428 states, 2963 states have (on average 1.4265946675666554) internal successors, (4227), 2983 states have internal predecessors, (4227), 268 states have call successors, (268), 159 states have call predecessors, (268), 195 states have return successors, (360), 289 states have call predecessors, (360), 267 states have call successors, (360) [2025-03-08 07:34:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3428 states to 3428 states and 4855 transitions. [2025-03-08 07:34:32,418 INFO L78 Accepts]: Start accepts. Automaton has 3428 states and 4855 transitions. Word has length 187 [2025-03-08 07:34:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:32,419 INFO L471 AbstractCegarLoop]: Abstraction has 3428 states and 4855 transitions. [2025-03-08 07:34:32,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3428 states and 4855 transitions. [2025-03-08 07:34:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:32,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:32,422 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, 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,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:34:32,422 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:32,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:32,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1479682746, now seen corresponding path program 1 times [2025-03-08 07:34:32,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:32,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872582275] [2025-03-08 07:34:32,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:32,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:32,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:32,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:32,519 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,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:32,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872582275] [2025-03-08 07:34:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872582275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:32,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:32,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734525592] [2025-03-08 07:34:32,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:32,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:32,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:32,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:32,521 INFO L87 Difference]: Start difference. First operand 3428 states and 4855 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:33,275 INFO L93 Difference]: Finished difference Result 7329 states and 11221 transitions. [2025-03-08 07:34:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:33,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:33,292 INFO L225 Difference]: With dead ends: 7329 [2025-03-08 07:34:33,292 INFO L226 Difference]: Without dead ends: 5384 [2025-03-08 07:34:33,297 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:33,297 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1395 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 3550 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:33,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 3550 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2025-03-08 07:34:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 5171. [2025-03-08 07:34:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 4580 states have (on average 1.497598253275109) internal successors, (6859), 4614 states have internal predecessors, (6859), 356 states have call successors, (356), 183 states have call predecessors, (356), 233 states have return successors, (496), 381 states have call predecessors, (496), 355 states have call successors, (496) [2025-03-08 07:34:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 7711 transitions. [2025-03-08 07:34:33,495 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 7711 transitions. Word has length 187 [2025-03-08 07:34:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:33,496 INFO L471 AbstractCegarLoop]: Abstraction has 5171 states and 7711 transitions. [2025-03-08 07:34:33,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 7711 transitions. [2025-03-08 07:34:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:33,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:33,500 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, 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:33,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:34:33,500 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:33,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:33,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1086683801, now seen corresponding path program 1 times [2025-03-08 07:34:33,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:33,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845997538] [2025-03-08 07:34:33,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:33,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:33,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:33,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:33,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:33,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845997538] [2025-03-08 07:34:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845997538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:33,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:33,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:33,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807419451] [2025-03-08 07:34:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:33,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:33,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:33,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:33,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:33,606 INFO L87 Difference]: Start difference. First operand 5171 states and 7711 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:34,494 INFO L93 Difference]: Finished difference Result 13092 states and 20895 transitions. [2025-03-08 07:34:34,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:34,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:34,517 INFO L225 Difference]: With dead ends: 13092 [2025-03-08 07:34:34,517 INFO L226 Difference]: Without dead ends: 9404 [2025-03-08 07:34:34,527 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:34,528 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 1390 mSDsluCounter, 2661 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:34,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 3538 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9404 states. [2025-03-08 07:34:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9404 to 9098. [2025-03-08 07:34:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9098 states, 8237 states have (on average 1.5718101250455263) internal successors, (12947), 8317 states have internal predecessors, (12947), 532 states have call successors, (532), 231 states have call predecessors, (532), 327 states have return successors, (864), 565 states have call predecessors, (864), 531 states have call successors, (864) [2025-03-08 07:34:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9098 states to 9098 states and 14343 transitions. [2025-03-08 07:34:34,897 INFO L78 Accepts]: Start accepts. Automaton has 9098 states and 14343 transitions. Word has length 187 [2025-03-08 07:34:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:34,897 INFO L471 AbstractCegarLoop]: Abstraction has 9098 states and 14343 transitions. [2025-03-08 07:34:34,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 14343 transitions. [2025-03-08 07:34:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:34,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:34,902 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, 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:34,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:34:34,902 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash -727108902, now seen corresponding path program 1 times [2025-03-08 07:34:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423189026] [2025-03-08 07:34:34,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:34,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:34,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:34,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:34,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:34,983 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:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423189026] [2025-03-08 07:34:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423189026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:34,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:34,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251070924] [2025-03-08 07:34:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:34,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:34,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:34,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:34,985 INFO L87 Difference]: Start difference. First operand 9098 states and 14343 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:35,668 INFO L93 Difference]: Finished difference Result 18705 states and 30952 transitions. [2025-03-08 07:34:35,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:35,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:35,703 INFO L225 Difference]: With dead ends: 18705 [2025-03-08 07:34:35,703 INFO L226 Difference]: Without dead ends: 11090 [2025-03-08 07:34:35,725 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:35,726 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 1025 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:35,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1403 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:34:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11090 states. [2025-03-08 07:34:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11090 to 9098. [2025-03-08 07:34:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9098 states, 8237 states have (on average 1.569746266844725) internal successors, (12930), 8317 states have internal predecessors, (12930), 532 states have call successors, (532), 231 states have call predecessors, (532), 327 states have return successors, (864), 565 states have call predecessors, (864), 531 states have call successors, (864) [2025-03-08 07:34:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9098 states to 9098 states and 14326 transitions. [2025-03-08 07:34:36,129 INFO L78 Accepts]: Start accepts. Automaton has 9098 states and 14326 transitions. Word has length 187 [2025-03-08 07:34:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:36,129 INFO L471 AbstractCegarLoop]: Abstraction has 9098 states and 14326 transitions. [2025-03-08 07:34:36,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 14326 transitions. [2025-03-08 07:34:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:36,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:36,135 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, 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:36,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 07:34:36,135 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:36,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash 322760313, now seen corresponding path program 1 times [2025-03-08 07:34:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:36,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225303531] [2025-03-08 07:34:36,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:36,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:36,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:36,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:36,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:36,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:36,211 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:36,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:36,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225303531] [2025-03-08 07:34:36,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225303531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:36,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:36,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:36,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804466182] [2025-03-08 07:34:36,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:36,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:36,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:36,213 INFO L87 Difference]: Start difference. First operand 9098 states and 14326 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:37,020 INFO L93 Difference]: Finished difference Result 18622 states and 30752 transitions. [2025-03-08 07:34:37,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:37,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:37,050 INFO L225 Difference]: With dead ends: 18622 [2025-03-08 07:34:37,050 INFO L226 Difference]: Without dead ends: 11007 [2025-03-08 07:34:37,065 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:37,066 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1022 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:37,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1395 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:34:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11007 states. [2025-03-08 07:34:37,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11007 to 9098. [2025-03-08 07:34:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9098 states, 8237 states have (on average 1.5676824086439238) internal successors, (12913), 8317 states have internal predecessors, (12913), 532 states have call successors, (532), 231 states have call predecessors, (532), 327 states have return successors, (864), 565 states have call predecessors, (864), 531 states have call successors, (864) [2025-03-08 07:34:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9098 states to 9098 states and 14309 transitions. [2025-03-08 07:34:37,649 INFO L78 Accepts]: Start accepts. Automaton has 9098 states and 14309 transitions. Word has length 187 [2025-03-08 07:34:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 9098 states and 14309 transitions. [2025-03-08 07:34:37,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 14309 transitions. [2025-03-08 07:34:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:37,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:37,654 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, 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:37,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 07:34:37,654 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 495174394, now seen corresponding path program 1 times [2025-03-08 07:34:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967968778] [2025-03-08 07:34:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:37,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:37,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:37,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:37,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:37,727 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:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:37,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967968778] [2025-03-08 07:34:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967968778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:37,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:37,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:37,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556165369] [2025-03-08 07:34:37,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:37,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:37,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:37,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:37,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:37,729 INFO L87 Difference]: Start difference. First operand 9098 states and 14309 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:38,406 INFO L93 Difference]: Finished difference Result 18539 states and 30552 transitions. [2025-03-08 07:34:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:38,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:38,434 INFO L225 Difference]: With dead ends: 18539 [2025-03-08 07:34:38,434 INFO L226 Difference]: Without dead ends: 10924 [2025-03-08 07:34:38,451 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:38,452 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1019 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:38,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1387 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:34:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10924 states. [2025-03-08 07:34:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10924 to 9098. [2025-03-08 07:34:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9098 states, 8237 states have (on average 1.5656185504431226) internal successors, (12896), 8317 states have internal predecessors, (12896), 532 states have call successors, (532), 231 states have call predecessors, (532), 327 states have return successors, (864), 565 states have call predecessors, (864), 531 states have call successors, (864) [2025-03-08 07:34:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9098 states to 9098 states and 14292 transitions. [2025-03-08 07:34:38,807 INFO L78 Accepts]: Start accepts. Automaton has 9098 states and 14292 transitions. Word has length 187 [2025-03-08 07:34:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:38,807 INFO L471 AbstractCegarLoop]: Abstraction has 9098 states and 14292 transitions. [2025-03-08 07:34:38,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 14292 transitions. [2025-03-08 07:34:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:38,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:38,811 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, 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:38,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 07:34:38,811 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:38,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:38,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1161831847, now seen corresponding path program 1 times [2025-03-08 07:34:38,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:38,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361150587] [2025-03-08 07:34:38,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:38,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:38,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:38,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:38,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:38,891 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:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361150587] [2025-03-08 07:34:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361150587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454267677] [2025-03-08 07:34:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:38,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:38,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:38,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:38,893 INFO L87 Difference]: Start difference. First operand 9098 states and 14292 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:40,041 INFO L93 Difference]: Finished difference Result 26023 states and 43152 transitions. [2025-03-08 07:34:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:40,088 INFO L225 Difference]: With dead ends: 26023 [2025-03-08 07:34:40,088 INFO L226 Difference]: Without dead ends: 18408 [2025-03-08 07:34:40,110 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:40,110 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 1361 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:40,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3469 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18408 states. [2025-03-08 07:34:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18408 to 17978. [2025-03-08 07:34:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17978 states, 16523 states have (on average 1.628396780245718) internal successors, (26906), 16749 states have internal predecessors, (26906), 884 states have call successors, (884), 327 states have call predecessors, (884), 569 states have return successors, (1984), 933 states have call predecessors, (1984), 883 states have call successors, (1984) [2025-03-08 07:34:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17978 states to 17978 states and 29774 transitions. [2025-03-08 07:34:40,773 INFO L78 Accepts]: Start accepts. Automaton has 17978 states and 29774 transitions. Word has length 187 [2025-03-08 07:34:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:40,773 INFO L471 AbstractCegarLoop]: Abstraction has 17978 states and 29774 transitions. [2025-03-08 07:34:40,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17978 states and 29774 transitions. [2025-03-08 07:34:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:40,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:40,778 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, 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:40,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 07:34:40,778 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:40,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2046567654, now seen corresponding path program 1 times [2025-03-08 07:34:40,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:40,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651231448] [2025-03-08 07:34:40,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:40,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:40,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:40,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:40,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:40,841 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:40,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651231448] [2025-03-08 07:34:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651231448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:40,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:40,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434189981] [2025-03-08 07:34:40,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:40,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:40,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:40,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:40,843 INFO L87 Difference]: Start difference. First operand 17978 states and 29774 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:42,103 INFO L93 Difference]: Finished difference Result 39373 states and 67944 transitions. [2025-03-08 07:34:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:42,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:42,163 INFO L225 Difference]: With dead ends: 39373 [2025-03-08 07:34:42,163 INFO L226 Difference]: Without dead ends: 22878 [2025-03-08 07:34:42,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:42,198 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 1015 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:42,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1373 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:34:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22878 states. [2025-03-08 07:34:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22878 to 17978. [2025-03-08 07:34:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17978 states, 16523 states have (on average 1.6263995642437814) internal successors, (26873), 16749 states have internal predecessors, (26873), 884 states have call successors, (884), 327 states have call predecessors, (884), 569 states have return successors, (1984), 933 states have call predecessors, (1984), 883 states have call successors, (1984) [2025-03-08 07:34:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17978 states to 17978 states and 29741 transitions. [2025-03-08 07:34:42,952 INFO L78 Accepts]: Start accepts. Automaton has 17978 states and 29741 transitions. Word has length 187 [2025-03-08 07:34:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:42,952 INFO L471 AbstractCegarLoop]: Abstraction has 17978 states and 29741 transitions. [2025-03-08 07:34:42,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17978 states and 29741 transitions. [2025-03-08 07:34:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:42,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:42,957 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, 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:42,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 07:34:42,957 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:42,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1942765113, now seen corresponding path program 1 times [2025-03-08 07:34:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178084296] [2025-03-08 07:34:42,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:42,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:42,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:42,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:42,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:43,043 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:43,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178084296] [2025-03-08 07:34:43,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178084296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:43,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:43,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:43,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313429220] [2025-03-08 07:34:43,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:43,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:43,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:43,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:43,046 INFO L87 Difference]: Start difference. First operand 17978 states and 29741 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:44,686 INFO L93 Difference]: Finished difference Result 55845 states and 96897 transitions. [2025-03-08 07:34:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:44,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:44,790 INFO L225 Difference]: With dead ends: 55845 [2025-03-08 07:34:44,790 INFO L226 Difference]: Without dead ends: 39350 [2025-03-08 07:34:44,831 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:44,832 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1348 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:44,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 3438 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:34:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39350 states. [2025-03-08 07:34:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39350 to 38654. [2025-03-08 07:34:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38654 states, 35849 states have (on average 1.679014756339089) internal successors, (60191), 36529 states have internal predecessors, (60191), 1588 states have call successors, (1588), 519 states have call predecessors, (1588), 1215 states have return successors, (5760), 1669 states have call predecessors, (5760), 1587 states have call successors, (5760) [2025-03-08 07:34:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38654 states to 38654 states and 67539 transitions. [2025-03-08 07:34:46,570 INFO L78 Accepts]: Start accepts. Automaton has 38654 states and 67539 transitions. Word has length 187 [2025-03-08 07:34:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:46,570 INFO L471 AbstractCegarLoop]: Abstraction has 38654 states and 67539 transitions. [2025-03-08 07:34:46,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 38654 states and 67539 transitions. [2025-03-08 07:34:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:46,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:46,582 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, 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:46,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 07:34:46,582 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:46,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:46,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1240169274, now seen corresponding path program 1 times [2025-03-08 07:34:46,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:46,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811382528] [2025-03-08 07:34:46,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:46,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:46,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:46,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:46,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:46,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:46,709 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:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:46,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811382528] [2025-03-08 07:34:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811382528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:46,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:46,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:46,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066263888] [2025-03-08 07:34:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:46,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:46,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:46,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:46,711 INFO L87 Difference]: Start difference. First operand 38654 states and 67539 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:50,143 INFO L93 Difference]: Finished difference Result 126919 states and 233037 transitions. [2025-03-08 07:34:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:50,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:50,426 INFO L225 Difference]: With dead ends: 126919 [2025-03-08 07:34:50,426 INFO L226 Difference]: Without dead ends: 89748 [2025-03-08 07:34:50,525 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:50,526 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 1343 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:50,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 3426 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:34:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89748 states. [2025-03-08 07:34:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89748 to 88511. [2025-03-08 07:34:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88511 states, 82520 states have (on average 1.725) internal successors, (142347), 84594 states have internal predecessors, (142347), 2996 states have call successors, (2996), 903 states have call predecessors, (2996), 2993 states have return successors, (19456), 3141 states have call predecessors, (19456), 2995 states have call successors, (19456) [2025-03-08 07:34:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88511 states to 88511 states and 164799 transitions. [2025-03-08 07:34:54,919 INFO L78 Accepts]: Start accepts. Automaton has 88511 states and 164799 transitions. Word has length 187 [2025-03-08 07:34:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:54,919 INFO L471 AbstractCegarLoop]: Abstraction has 88511 states and 164799 transitions. [2025-03-08 07:34:54,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 5 states have internal predecessors, (177), 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:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 88511 states and 164799 transitions. [2025-03-08 07:34:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 07:34:54,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:54,935 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, 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:54,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 07:34:54,935 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:54,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:54,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2107631079, now seen corresponding path program 1 times [2025-03-08 07:34:54,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:54,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414117104] [2025-03-08 07:34:54,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:54,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:54,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 07:34:54,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 07:34:54,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:54,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:54,998 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:54,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:54,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414117104] [2025-03-08 07:34:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414117104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:54,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:54,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:34:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923084589] [2025-03-08 07:34:54,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:34:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:55,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:34:55,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:34:55,000 INFO L87 Difference]: Start difference. First operand 88511 states and 164799 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:59,574 INFO L93 Difference]: Finished difference Result 212752 states and 412340 transitions. [2025-03-08 07:34:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:34:59,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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 187 [2025-03-08 07:34:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:00,022 INFO L225 Difference]: With dead ends: 212752 [2025-03-08 07:35:00,022 INFO L226 Difference]: Without dead ends: 125724 [2025-03-08 07:35:00,289 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:35:00,290 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 1010 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:00,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1353 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125724 states.