./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_3.cil+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:23:19,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:23:19,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:23:19,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:23:19,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:23:19,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:23:19,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:23:19,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:23:19,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:23:19,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:23:19,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:23:19,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:23:19,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:23:19,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:23:19,711 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:23:19,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:23:19,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:23:19,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:23:19,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:23:19,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:23:19,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:23:19,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:23:19,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:23:19,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:23:19,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:23:19,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:23:19,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:23:19,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:23:19,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:23:19,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:23:19,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:23:19,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:23:19,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:19,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:23:19,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:23:19,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:23:19,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:23:19,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:23:19,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:23:19,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:23:19,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:23:19,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:23:19,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:23:19,714 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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2025-03-03 16:23:19,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:23:19,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:23:19,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:23:19,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:23:19,923 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:23:19,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2025-03-03 16:23:21,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c00f2eaf/dc0a22bdd7ec4d7e99c1ef6b3523806f/FLAG93e7aa1fb [2025-03-03 16:23:21,339 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:23:21,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2025-03-03 16:23:21,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c00f2eaf/dc0a22bdd7ec4d7e99c1ef6b3523806f/FLAG93e7aa1fb [2025-03-03 16:23:21,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c00f2eaf/dc0a22bdd7ec4d7e99c1ef6b3523806f [2025-03-03 16:23:21,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:23:21,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:23:21,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:21,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:23:21,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:23:21,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601831d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21, skipping insertion in model container [2025-03-03 16:23:21,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:23:21,522 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_3.cil+token_ring.02.cil-1.c[911,924] [2025-03-03 16:23:21,588 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_3.cil+token_ring.02.cil-1.c[8416,8429] [2025-03-03 16:23:21,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:21,625 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:23:21,634 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_3.cil+token_ring.02.cil-1.c[911,924] [2025-03-03 16:23:21,658 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_3.cil+token_ring.02.cil-1.c[8416,8429] [2025-03-03 16:23:21,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:21,688 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:23:21,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21 WrapperNode [2025-03-03 16:23:21,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:21,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:21,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:23:21,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:23:21,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,737 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 479 [2025-03-03 16:23:21,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:21,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:23:21,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:23:21,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:23:21,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,762 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-03 16:23:21,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:23:21,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:23:21,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:23:21,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:23:21,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (1/1) ... [2025-03-03 16:23:21,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:21,804 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-03 16:23:21,811 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-03 16:23:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:23:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:23:21,828 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:23:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:23:21,828 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:23:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:23:21,828 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:23:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:23:21,828 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:23:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:23:21,828 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:23:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:23:21,828 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:23:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:23:21,828 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:23:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:23:21,828 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:23:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:23:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:23:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:23:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:23:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:23:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:23:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:23:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:23:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:23:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:23:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:23:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:23:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:23:21,829 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:23:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:23:21,908 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:23:21,910 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:23:22,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-03 16:23:22,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-03 16:23:22,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-03 16:23:22,462 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-03-03 16:23:22,462 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:23:22,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:23:22,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:23:22,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:22 BoogieIcfgContainer [2025-03-03 16:23:22,490 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:23:22,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:23:22,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:23:22,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:23:22,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:23:21" (1/3) ... [2025-03-03 16:23:22,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd29a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:22, skipping insertion in model container [2025-03-03 16:23:22,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:21" (2/3) ... [2025-03-03 16:23:22,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd29a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:22, skipping insertion in model container [2025-03-03 16:23:22,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:22" (3/3) ... [2025-03-03 16:23:22,497 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2025-03-03 16:23:22,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:23:22,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c that has 15 procedures, 257 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-03 16:23:22,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:23:22,598 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;@4b72bc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:23:22,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:23:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 208 states have (on average 1.4903846153846154) internal successors, (310), 214 states have internal predecessors, (310), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 16:23:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:23:22,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:22,614 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] [2025-03-03 16:23:22,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:22,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash 171767585, now seen corresponding path program 1 times [2025-03-03 16:23:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256649911] [2025-03-03 16:23:22,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:22,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:23:22,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:23:22,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:22,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:22,961 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-03 16:23:22,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:22,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256649911] [2025-03-03 16:23:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256649911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079624109] [2025-03-03 16:23:22,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:22,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:22,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:22,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:22,980 INFO L87 Difference]: Start difference. First operand has 257 states, 208 states have (on average 1.4903846153846154) internal successors, (310), 214 states have internal predecessors, (310), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-03 16:23:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:23,471 INFO L93 Difference]: Finished difference Result 617 states and 905 transitions. [2025-03-03 16:23:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:23,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2025-03-03 16:23:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:23,486 INFO L225 Difference]: With dead ends: 617 [2025-03-03 16:23:23,489 INFO L226 Difference]: Without dead ends: 368 [2025-03-03 16:23:23,493 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-03 16:23:23,499 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 322 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:23,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 916 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-03 16:23:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 361. [2025-03-03 16:23:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 292 states have (on average 1.4315068493150684) internal successors, (418), 298 states have internal predecessors, (418), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2025-03-03 16:23:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 511 transitions. [2025-03-03 16:23:23,568 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 511 transitions. Word has length 65 [2025-03-03 16:23:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:23,568 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 511 transitions. [2025-03-03 16:23:23,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-03 16:23:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 511 transitions. [2025-03-03 16:23:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:23:23,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:23,573 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] [2025-03-03 16:23:23,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:23:23,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:23,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash 940937600, now seen corresponding path program 1 times [2025-03-03 16:23:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174659299] [2025-03-03 16:23:23,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:23,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:23,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:23:23,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:23:23,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:23,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:23,766 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-03 16:23:23,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:23,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174659299] [2025-03-03 16:23:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174659299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:23,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:23,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806223403] [2025-03-03 16:23:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:23,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:23,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:23,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:23,770 INFO L87 Difference]: Start difference. First operand 361 states and 511 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-03 16:23:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:24,326 INFO L93 Difference]: Finished difference Result 734 states and 1032 transitions. [2025-03-03 16:23:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:24,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2025-03-03 16:23:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:24,333 INFO L225 Difference]: With dead ends: 734 [2025-03-03 16:23:24,333 INFO L226 Difference]: Without dead ends: 521 [2025-03-03 16:23:24,334 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-03 16:23:24,334 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 500 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:24,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1135 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-03 16:23:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 475. [2025-03-03 16:23:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 384 states have (on average 1.421875) internal successors, (546), 392 states have internal predecessors, (546), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2025-03-03 16:23:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 673 transitions. [2025-03-03 16:23:24,367 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 673 transitions. Word has length 65 [2025-03-03 16:23:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:24,369 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 673 transitions. [2025-03-03 16:23:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-03 16:23:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 673 transitions. [2025-03-03 16:23:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:23:24,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:24,372 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] [2025-03-03 16:23:24,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:23:24,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:24,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2074128193, now seen corresponding path program 1 times [2025-03-03 16:23:24,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:24,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306109751] [2025-03-03 16:23:24,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:24,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:24,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:23:24,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:23:24,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:24,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:24,472 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-03 16:23:24,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:24,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306109751] [2025-03-03 16:23:24,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306109751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:24,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:24,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:23:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857686525] [2025-03-03 16:23:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:24,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:23:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:24,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:23:24,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:23:24,475 INFO L87 Difference]: Start difference. First operand 475 states and 673 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:23:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:25,448 INFO L93 Difference]: Finished difference Result 1937 states and 2737 transitions. [2025-03-03 16:23:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:23:25,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2025-03-03 16:23:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:25,457 INFO L225 Difference]: With dead ends: 1937 [2025-03-03 16:23:25,457 INFO L226 Difference]: Without dead ends: 1598 [2025-03-03 16:23:25,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:23:25,459 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 1831 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:25,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1849 Valid, 1362 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:23:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2025-03-03 16:23:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1545. [2025-03-03 16:23:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1249 states have (on average 1.366693354683747) internal successors, (1707), 1272 states have internal predecessors, (1707), 168 states have call successors, (168), 111 states have call predecessors, (168), 126 states have return successors, (202), 164 states have call predecessors, (202), 166 states have call successors, (202) [2025-03-03 16:23:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2077 transitions. [2025-03-03 16:23:25,580 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2077 transitions. Word has length 65 [2025-03-03 16:23:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:25,581 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2077 transitions. [2025-03-03 16:23:25,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:23:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2077 transitions. [2025-03-03 16:23:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:23:25,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:25,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:25,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:23:25,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:25,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1844046452, now seen corresponding path program 1 times [2025-03-03 16:23:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705427027] [2025-03-03 16:23:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:25,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:23:25,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:23:25,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:25,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:25,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:25,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705427027] [2025-03-03 16:23:25,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705427027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:25,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:25,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:25,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613167693] [2025-03-03 16:23:25,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:25,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:25,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:25,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:25,665 INFO L87 Difference]: Start difference. First operand 1545 states and 2077 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 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-03 16:23:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:25,768 INFO L93 Difference]: Finished difference Result 2988 states and 4025 transitions. [2025-03-03 16:23:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:25,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2025-03-03 16:23:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:25,775 INFO L225 Difference]: With dead ends: 2988 [2025-03-03 16:23:25,776 INFO L226 Difference]: Without dead ends: 1585 [2025-03-03 16:23:25,779 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-03 16:23:25,780 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:25,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1734 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-03-03 16:23:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2025-03-03 16:23:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1281 states have (on average 1.3528493364558938) internal successors, (1733), 1304 states have internal predecessors, (1733), 168 states have call successors, (168), 111 states have call predecessors, (168), 134 states have return successors, (210), 172 states have call predecessors, (210), 166 states have call successors, (210) [2025-03-03 16:23:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2111 transitions. [2025-03-03 16:23:25,908 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2111 transitions. Word has length 66 [2025-03-03 16:23:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:25,908 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2111 transitions. [2025-03-03 16:23:25,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 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-03 16:23:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2111 transitions. [2025-03-03 16:23:25,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:23:25,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:25,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:25,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:23:25,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:25,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash -818116845, now seen corresponding path program 1 times [2025-03-03 16:23:25,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140084386] [2025-03-03 16:23:25,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:25,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:25,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:23:25,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:23:25,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:25,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:25,996 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-03 16:23:25,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:25,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140084386] [2025-03-03 16:23:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140084386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:25,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:25,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:23:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706634600] [2025-03-03 16:23:25,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:25,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:23:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:25,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:23:25,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:23:25,998 INFO L87 Difference]: Start difference. First operand 1585 states and 2111 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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-03 16:23:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:26,911 INFO L93 Difference]: Finished difference Result 5021 states and 6745 transitions. [2025-03-03 16:23:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:23:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2025-03-03 16:23:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:26,923 INFO L225 Difference]: With dead ends: 5021 [2025-03-03 16:23:26,923 INFO L226 Difference]: Without dead ends: 1851 [2025-03-03 16:23:26,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:23:26,929 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1912 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:26,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 1391 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:23:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2025-03-03 16:23:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1781. [2025-03-03 16:23:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1405 states have (on average 1.3124555160142348) internal successors, (1844), 1430 states have internal predecessors, (1844), 208 states have call successors, (208), 139 states have call predecessors, (208), 166 states have return successors, (256), 214 states have call predecessors, (256), 206 states have call successors, (256) [2025-03-03 16:23:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2308 transitions. [2025-03-03 16:23:27,003 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2308 transitions. Word has length 66 [2025-03-03 16:23:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:27,004 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2308 transitions. [2025-03-03 16:23:27,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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-03 16:23:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2308 transitions. [2025-03-03 16:23:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:23:27,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:27,006 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-03 16:23:27,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:23:27,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:27,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash -41036144, now seen corresponding path program 1 times [2025-03-03 16:23:27,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:27,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046134563] [2025-03-03 16:23:27,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:23:27,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:23:27,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:27,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:27,077 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-03 16:23:27,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046134563] [2025-03-03 16:23:27,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046134563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:27,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:27,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:27,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194600426] [2025-03-03 16:23:27,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:27,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:27,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:27,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:27,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:27,079 INFO L87 Difference]: Start difference. First operand 1781 states and 2308 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-03 16:23:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:27,407 INFO L93 Difference]: Finished difference Result 2035 states and 2678 transitions. [2025-03-03 16:23:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:27,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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 68 [2025-03-03 16:23:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:27,415 INFO L225 Difference]: With dead ends: 2035 [2025-03-03 16:23:27,415 INFO L226 Difference]: Without dead ends: 1912 [2025-03-03 16:23:27,416 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-03 16:23:27,417 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 497 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:27,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 712 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:23:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2025-03-03 16:23:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1903. [2025-03-03 16:23:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1509 states have (on average 1.3227302849569251) internal successors, (1996), 1535 states have internal predecessors, (1996), 219 states have call successors, (219), 145 states have call predecessors, (219), 173 states have return successors, (268), 225 states have call predecessors, (268), 217 states have call successors, (268) [2025-03-03 16:23:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2483 transitions. [2025-03-03 16:23:27,494 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2483 transitions. Word has length 68 [2025-03-03 16:23:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:27,494 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2483 transitions. [2025-03-03 16:23:27,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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-03 16:23:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2483 transitions. [2025-03-03 16:23:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:23:27,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:27,495 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-03 16:23:27,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:23:27,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:27,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1424852782, now seen corresponding path program 1 times [2025-03-03 16:23:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:27,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213624289] [2025-03-03 16:23:27,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:27,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:23:27,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:23:27,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:27,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:27,586 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-03 16:23:27,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:27,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213624289] [2025-03-03 16:23:27,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213624289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:27,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:27,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:27,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174163228] [2025-03-03 16:23:27,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:27,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:27,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:27,587 INFO L87 Difference]: Start difference. First operand 1903 states and 2483 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:28,092 INFO L93 Difference]: Finished difference Result 2296 states and 3053 transitions. [2025-03-03 16:23:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:28,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 16:23:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:28,103 INFO L225 Difference]: With dead ends: 2296 [2025-03-03 16:23:28,103 INFO L226 Difference]: Without dead ends: 2051 [2025-03-03 16:23:28,104 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-03 16:23:28,105 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 487 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:28,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1206 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-03-03 16:23:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2018. [2025-03-03 16:23:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1606 states have (on average 1.3287671232876712) internal successors, (2134), 1633 states have internal predecessors, (2134), 230 states have call successors, (230), 151 states have call predecessors, (230), 180 states have return successors, (282), 237 states have call predecessors, (282), 228 states have call successors, (282) [2025-03-03 16:23:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2646 transitions. [2025-03-03 16:23:28,189 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2646 transitions. Word has length 68 [2025-03-03 16:23:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:28,190 INFO L471 AbstractCegarLoop]: Abstraction has 2018 states and 2646 transitions. [2025-03-03 16:23:28,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2646 transitions. [2025-03-03 16:23:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:23:28,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:28,191 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-03 16:23:28,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:23:28,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:28,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash -986843279, now seen corresponding path program 1 times [2025-03-03 16:23:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363968163] [2025-03-03 16:23:28,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:28,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:23:28,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:23:28,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:28,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:28,289 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-03 16:23:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363968163] [2025-03-03 16:23:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363968163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197561483] [2025-03-03 16:23:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:28,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:28,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:28,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:28,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:28,292 INFO L87 Difference]: Start difference. First operand 2018 states and 2646 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:28,757 INFO L93 Difference]: Finished difference Result 2651 states and 3561 transitions. [2025-03-03 16:23:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:28,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 16:23:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:28,768 INFO L225 Difference]: With dead ends: 2651 [2025-03-03 16:23:28,768 INFO L226 Difference]: Without dead ends: 2291 [2025-03-03 16:23:28,770 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-03 16:23:28,770 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 482 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:28,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1190 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:23:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2025-03-03 16:23:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2257. [2025-03-03 16:23:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 1807 states have (on average 1.3397897066961815) internal successors, (2421), 1838 states have internal predecessors, (2421), 252 states have call successors, (252), 163 states have call predecessors, (252), 196 states have return successors, (316), 261 states have call predecessors, (316), 250 states have call successors, (316) [2025-03-03 16:23:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2989 transitions. [2025-03-03 16:23:28,888 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2989 transitions. Word has length 68 [2025-03-03 16:23:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:28,888 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 2989 transitions. [2025-03-03 16:23:28,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2989 transitions. [2025-03-03 16:23:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:23:28,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:28,892 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-03 16:23:28,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:23:28,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:28,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1382590706, now seen corresponding path program 1 times [2025-03-03 16:23:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411975929] [2025-03-03 16:23:28,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:28,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:23:28,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:23:28,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:28,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:28,959 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-03 16:23:28,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:28,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411975929] [2025-03-03 16:23:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411975929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:28,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:28,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702689871] [2025-03-03 16:23:28,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:28,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:28,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:28,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:28,961 INFO L87 Difference]: Start difference. First operand 2257 states and 2989 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:29,457 INFO L93 Difference]: Finished difference Result 3468 states and 4751 transitions. [2025-03-03 16:23:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 16:23:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:29,470 INFO L225 Difference]: With dead ends: 3468 [2025-03-03 16:23:29,470 INFO L226 Difference]: Without dead ends: 2869 [2025-03-03 16:23:29,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:29,473 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 551 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:29,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1165 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2025-03-03 16:23:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2744. [2025-03-03 16:23:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2744 states, 2216 states have (on average 1.3578519855595668) internal successors, (3009), 2261 states have internal predecessors, (3009), 292 states have call successors, (292), 187 states have call predecessors, (292), 234 states have return successors, (404), 305 states have call predecessors, (404), 290 states have call successors, (404) [2025-03-03 16:23:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 3705 transitions. [2025-03-03 16:23:29,627 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 3705 transitions. Word has length 68 [2025-03-03 16:23:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:29,628 INFO L471 AbstractCegarLoop]: Abstraction has 2744 states and 3705 transitions. [2025-03-03 16:23:29,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3705 transitions. [2025-03-03 16:23:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:23:29,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:29,631 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-03 16:23:29,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:23:29,631 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2143206575, now seen corresponding path program 1 times [2025-03-03 16:23:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045857535] [2025-03-03 16:23:29,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:29,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:23:29,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:23:29,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:29,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:29,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-03 16:23:29,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:29,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045857535] [2025-03-03 16:23:29,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045857535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:29,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:29,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:29,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064163777] [2025-03-03 16:23:29,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:29,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:29,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:29,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:29,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:29,712 INFO L87 Difference]: Start difference. First operand 2744 states and 3705 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:30,295 INFO L93 Difference]: Finished difference Result 4991 states and 7053 transitions. [2025-03-03 16:23:30,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:30,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 16:23:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:30,310 INFO L225 Difference]: With dead ends: 4991 [2025-03-03 16:23:30,310 INFO L226 Difference]: Without dead ends: 3905 [2025-03-03 16:23:30,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:30,314 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 515 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:30,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1149 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2025-03-03 16:23:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3703. [2025-03-03 16:23:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3703 states, 3005 states have (on average 1.3767054908485856) internal successors, (4137), 3096 states have internal predecessors, (4137), 368 states have call successors, (368), 235 states have call predecessors, (368), 328 states have return successors, (672), 389 states have call predecessors, (672), 366 states have call successors, (672) [2025-03-03 16:23:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 5177 transitions. [2025-03-03 16:23:30,526 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 5177 transitions. Word has length 68 [2025-03-03 16:23:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:30,526 INFO L471 AbstractCegarLoop]: Abstraction has 3703 states and 5177 transitions. [2025-03-03 16:23:30,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 5177 transitions. [2025-03-03 16:23:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:23:30,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:30,529 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-03 16:23:30,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:23:30,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:30,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1010015982, now seen corresponding path program 1 times [2025-03-03 16:23:30,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:30,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019101562] [2025-03-03 16:23:30,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:30,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:30,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:23:30,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:23:30,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:30,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:30,603 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-03 16:23:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019101562] [2025-03-03 16:23:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019101562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:30,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:30,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:30,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994933707] [2025-03-03 16:23:30,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:30,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:30,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:30,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:30,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:30,605 INFO L87 Difference]: Start difference. First operand 3703 states and 5177 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:31,210 INFO L93 Difference]: Finished difference Result 7926 states and 11807 transitions. [2025-03-03 16:23:31,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:31,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 16:23:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:31,237 INFO L225 Difference]: With dead ends: 7926 [2025-03-03 16:23:31,237 INFO L226 Difference]: Without dead ends: 5881 [2025-03-03 16:23:31,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:31,245 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 481 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:31,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1141 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2025-03-03 16:23:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5714. [2025-03-03 16:23:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5714 states, 4638 states have (on average 1.3878827080638205) internal successors, (6437), 4875 states have internal predecessors, (6437), 508 states have call successors, (508), 327 states have call predecessors, (508), 566 states have return successors, (1580), 545 states have call predecessors, (1580), 506 states have call successors, (1580) [2025-03-03 16:23:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5714 states to 5714 states and 8525 transitions. [2025-03-03 16:23:31,693 INFO L78 Accepts]: Start accepts. Automaton has 5714 states and 8525 transitions. Word has length 68 [2025-03-03 16:23:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:31,696 INFO L471 AbstractCegarLoop]: Abstraction has 5714 states and 8525 transitions. [2025-03-03 16:23:31,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 16:23:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5714 states and 8525 transitions. [2025-03-03 16:23:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:23:31,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:31,700 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-03 16:23:31,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:23:31,700 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:31,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1250556111, now seen corresponding path program 1 times [2025-03-03 16:23:31,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:31,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725178705] [2025-03-03 16:23:31,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:31,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:23:31,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:23:31,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:31,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:31,735 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-03 16:23:31,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725178705] [2025-03-03 16:23:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725178705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:31,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:31,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:23:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023382007] [2025-03-03 16:23:31,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:31,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:23:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:31,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:23:31,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:23:31,737 INFO L87 Difference]: Start difference. First operand 5714 states and 8525 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:32,159 INFO L93 Difference]: Finished difference Result 11946 states and 18421 transitions. [2025-03-03 16:23:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:23:32,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2025-03-03 16:23:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:32,202 INFO L225 Difference]: With dead ends: 11946 [2025-03-03 16:23:32,202 INFO L226 Difference]: Without dead ends: 7891 [2025-03-03 16:23:32,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:23:32,213 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 468 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:32,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 899 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:23:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2025-03-03 16:23:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7658. [2025-03-03 16:23:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7658 states, 6242 states have (on average 1.3792053828900994) internal successors, (8609), 6562 states have internal predecessors, (8609), 680 states have call successors, (680), 429 states have call predecessors, (680), 734 states have return successors, (1993), 700 states have call predecessors, (1993), 678 states have call successors, (1993) [2025-03-03 16:23:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 11282 transitions. [2025-03-03 16:23:32,635 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 11282 transitions. Word has length 68 [2025-03-03 16:23:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:32,635 INFO L471 AbstractCegarLoop]: Abstraction has 7658 states and 11282 transitions. [2025-03-03 16:23:32,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 11282 transitions. [2025-03-03 16:23:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:23:32,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:32,645 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, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:32,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:23:32,645 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:32,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2087372918, now seen corresponding path program 1 times [2025-03-03 16:23:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:32,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419214290] [2025-03-03 16:23:32,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:32,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:32,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:23:32,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:23:32,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:32,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:23:32,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419214290] [2025-03-03 16:23:32,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419214290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:32,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:32,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595629450] [2025-03-03 16:23:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:32,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:32,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:32,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:32,710 INFO L87 Difference]: Start difference. First operand 7658 states and 11282 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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-03 16:23:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:33,217 INFO L93 Difference]: Finished difference Result 9357 states and 13493 transitions. [2025-03-03 16:23:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:33,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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 92 [2025-03-03 16:23:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:33,245 INFO L225 Difference]: With dead ends: 9357 [2025-03-03 16:23:33,245 INFO L226 Difference]: Without dead ends: 7718 [2025-03-03 16:23:33,252 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-03 16:23:33,252 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 0 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1680 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-03 16:23:33,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1680 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7718 states. [2025-03-03 16:23:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7718 to 7718. [2025-03-03 16:23:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7718 states, 6290 states have (on average 1.3753577106518282) internal successors, (8651), 6610 states have internal predecessors, (8651), 680 states have call successors, (680), 429 states have call predecessors, (680), 746 states have return successors, (2005), 712 states have call predecessors, (2005), 678 states have call successors, (2005) [2025-03-03 16:23:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 11336 transitions. [2025-03-03 16:23:33,758 INFO L78 Accepts]: Start accepts. Automaton has 7718 states and 11336 transitions. Word has length 92 [2025-03-03 16:23:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:33,758 INFO L471 AbstractCegarLoop]: Abstraction has 7718 states and 11336 transitions. [2025-03-03 16:23:33,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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-03 16:23:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 7718 states and 11336 transitions. [2025-03-03 16:23:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:23:33,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:33,765 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, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:33,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:23:33,765 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:33,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1769584875, now seen corresponding path program 1 times [2025-03-03 16:23:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:33,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297484246] [2025-03-03 16:23:33,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:33,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:23:33,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:23:33,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:23:33,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297484246] [2025-03-03 16:23:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297484246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:33,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:33,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122264105] [2025-03-03 16:23:33,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:33,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:33,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:33,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:33,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:33,874 INFO L87 Difference]: Start difference. First operand 7718 states and 11336 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03 16:23:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:34,642 INFO L93 Difference]: Finished difference Result 9166 states and 13175 transitions. [2025-03-03 16:23:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:23:34,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 92 [2025-03-03 16:23:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:34,671 INFO L225 Difference]: With dead ends: 9166 [2025-03-03 16:23:34,672 INFO L226 Difference]: Without dead ends: 7706 [2025-03-03 16:23:34,678 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-03 16:23:34,679 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 498 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:34,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 869 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7706 states. [2025-03-03 16:23:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7706 to 7496. [2025-03-03 16:23:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7496 states, 6121 states have (on average 1.3775526874693678) internal successors, (8432), 6436 states have internal predecessors, (8432), 652 states have call successors, (652), 410 states have call predecessors, (652), 721 states have return successors, (1965), 682 states have call predecessors, (1965), 650 states have call successors, (1965) [2025-03-03 16:23:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 11049 transitions. [2025-03-03 16:23:35,122 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 11049 transitions. Word has length 92 [2025-03-03 16:23:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:35,123 INFO L471 AbstractCegarLoop]: Abstraction has 7496 states and 11049 transitions. [2025-03-03 16:23:35,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03 16:23:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 11049 transitions. [2025-03-03 16:23:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:23:35,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:35,129 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, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:35,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:23:35,129 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:35,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:35,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1777344234, now seen corresponding path program 1 times [2025-03-03 16:23:35,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:35,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085997568] [2025-03-03 16:23:35,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:35,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:23:35,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:23:35,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:35,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:23:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085997568] [2025-03-03 16:23:35,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085997568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:35,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:35,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:23:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664588294] [2025-03-03 16:23:35,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:35,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:23:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:35,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:23:35,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:23:35,186 INFO L87 Difference]: Start difference. First operand 7496 states and 11049 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:23:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:35,777 INFO L93 Difference]: Finished difference Result 10448 states and 14879 transitions. [2025-03-03 16:23:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:23:35,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2025-03-03 16:23:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:35,810 INFO L225 Difference]: With dead ends: 10448 [2025-03-03 16:23:35,810 INFO L226 Difference]: Without dead ends: 8972 [2025-03-03 16:23:35,819 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-03 16:23:35,820 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 425 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:35,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 441 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:23:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8972 states. [2025-03-03 16:23:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8972 to 8972. [2025-03-03 16:23:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8972 states, 7277 states have (on average 1.3559158994090972) internal successors, (9867), 7621 states have internal predecessors, (9867), 813 states have call successors, (813), 523 states have call predecessors, (813), 880 states have return successors, (2248), 861 states have call predecessors, (2248), 811 states have call successors, (2248) [2025-03-03 16:23:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8972 states to 8972 states and 12928 transitions. [2025-03-03 16:23:36,559 INFO L78 Accepts]: Start accepts. Automaton has 8972 states and 12928 transitions. Word has length 92 [2025-03-03 16:23:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:36,561 INFO L471 AbstractCegarLoop]: Abstraction has 8972 states and 12928 transitions. [2025-03-03 16:23:36,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:23:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 8972 states and 12928 transitions. [2025-03-03 16:23:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:23:36,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:36,568 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, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:36,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:23:36,569 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:36,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash -993965259, now seen corresponding path program 1 times [2025-03-03 16:23:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772740254] [2025-03-03 16:23:36,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:36,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:23:36,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:23:36,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:36,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:23:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772740254] [2025-03-03 16:23:36,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772740254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:36,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:36,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:23:36,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842600014] [2025-03-03 16:23:36,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:36,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:23:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:36,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:23:36,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:23:36,605 INFO L87 Difference]: Start difference. First operand 8972 states and 12928 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:36,897 INFO L93 Difference]: Finished difference Result 10448 states and 14759 transitions. [2025-03-03 16:23:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:23:36,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2025-03-03 16:23:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:36,928 INFO L225 Difference]: With dead ends: 10448 [2025-03-03 16:23:36,929 INFO L226 Difference]: Without dead ends: 7496 [2025-03-03 16:23:36,938 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-03 16:23:36,939 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 141 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 526 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-03 16:23:36,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 526 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7496 states. [2025-03-03 16:23:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7496 to 7496. [2025-03-03 16:23:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7496 states, 6121 states have (on average 1.371507923541905) internal successors, (8395), 6436 states have internal predecessors, (8395), 652 states have call successors, (652), 410 states have call predecessors, (652), 721 states have return successors, (1965), 682 states have call predecessors, (1965), 650 states have call successors, (1965) [2025-03-03 16:23:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 11012 transitions. [2025-03-03 16:23:37,396 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 11012 transitions. Word has length 92 [2025-03-03 16:23:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:37,397 INFO L471 AbstractCegarLoop]: Abstraction has 7496 states and 11012 transitions. [2025-03-03 16:23:37,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 11012 transitions. [2025-03-03 16:23:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:23:37,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:37,403 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:23:37,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:23:37,403 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1520909341, now seen corresponding path program 1 times [2025-03-03 16:23:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379885059] [2025-03-03 16:23:37,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:37,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:23:37,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:23:37,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:37,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:23:37,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:37,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379885059] [2025-03-03 16:23:37,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379885059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:37,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:37,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:23:37,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070737551] [2025-03-03 16:23:37,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:37,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:23:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:37,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:23:37,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:23:37,482 INFO L87 Difference]: Start difference. First operand 7496 states and 11012 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-03 16:23:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:38,566 INFO L93 Difference]: Finished difference Result 9845 states and 13993 transitions. [2025-03-03 16:23:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:23:38,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 93 [2025-03-03 16:23:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:38,593 INFO L225 Difference]: With dead ends: 9845 [2025-03-03 16:23:38,593 INFO L226 Difference]: Without dead ends: 8218 [2025-03-03 16:23:38,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:23:38,599 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 1117 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:38,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 1266 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:23:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2025-03-03 16:23:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 8097. [2025-03-03 16:23:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8097 states, 6576 states have (on average 1.3570559610705597) internal successors, (8924), 6900 states have internal predecessors, (8924), 723 states have call successors, (723), 460 states have call predecessors, (723), 796 states have return successors, (2070), 769 states have call predecessors, (2070), 721 states have call successors, (2070) [2025-03-03 16:23:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8097 states to 8097 states and 11717 transitions. [2025-03-03 16:23:39,042 INFO L78 Accepts]: Start accepts. Automaton has 8097 states and 11717 transitions. Word has length 93 [2025-03-03 16:23:39,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:39,043 INFO L471 AbstractCegarLoop]: Abstraction has 8097 states and 11717 transitions. [2025-03-03 16:23:39,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-03 16:23:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8097 states and 11717 transitions. [2025-03-03 16:23:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:39,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:39,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 16:23:39,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:23:39,062 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:39,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 209503983, now seen corresponding path program 1 times [2025-03-03 16:23:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:39,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338643936] [2025-03-03 16:23:39,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:39,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:39,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:39,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:39,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:39,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:23:39,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338643936] [2025-03-03 16:23:39,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338643936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:23:39,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201080647] [2025-03-03 16:23:39,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:39,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:23:39,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:39,122 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-03 16:23:39,123 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-03 16:23:39,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:39,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:39,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:39,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:39,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:23:39,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:23:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 16:23:39,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:23:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201080647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:39,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:23:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 16:23:39,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615575168] [2025-03-03 16:23:39,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:39,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:23:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:39,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:23:39,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:39,304 INFO L87 Difference]: Start difference. First operand 8097 states and 11717 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:40,075 INFO L93 Difference]: Finished difference Result 19904 states and 29869 transitions. [2025-03-03 16:23:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:23:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2025-03-03 16:23:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:40,133 INFO L225 Difference]: With dead ends: 19904 [2025-03-03 16:23:40,133 INFO L226 Difference]: Without dead ends: 13905 [2025-03-03 16:23:40,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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-03 16:23:40,154 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 291 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:40,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 496 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13905 states. [2025-03-03 16:23:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13905 to 13753. [2025-03-03 16:23:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13753 states, 11208 states have (on average 1.3722341184867952) internal successors, (15380), 11827 states have internal predecessors, (15380), 1177 states have call successors, (1177), 752 states have call predecessors, (1177), 1366 states have return successors, (3758), 1206 states have call predecessors, (3758), 1175 states have call successors, (3758) [2025-03-03 16:23:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13753 states to 13753 states and 20315 transitions. [2025-03-03 16:23:41,572 INFO L78 Accepts]: Start accepts. Automaton has 13753 states and 20315 transitions. Word has length 112 [2025-03-03 16:23:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:41,573 INFO L471 AbstractCegarLoop]: Abstraction has 13753 states and 20315 transitions. [2025-03-03 16:23:41,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13753 states and 20315 transitions. [2025-03-03 16:23:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:41,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:41,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 16:23:41,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:23:41,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,SelfDestructingSolverStorable17 [2025-03-03 16:23:41,794 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:41,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash -792018827, now seen corresponding path program 1 times [2025-03-03 16:23:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:41,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191774856] [2025-03-03 16:23:41,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:41,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:41,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:41,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:41,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:23:41,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:41,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191774856] [2025-03-03 16:23:41,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191774856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:23:41,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368886408] [2025-03-03 16:23:41,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:41,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:23:41,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:41,875 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-03 16:23:41,876 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-03 16:23:41,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:41,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:41,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:41,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:41,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:23:41,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:23:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 16:23:41,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:23:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368886408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:41,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:23:41,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 16:23:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406318455] [2025-03-03 16:23:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:41,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:23:41,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:41,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:23:41,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:41,990 INFO L87 Difference]: Start difference. First operand 13753 states and 20315 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:43,072 INFO L93 Difference]: Finished difference Result 36670 states and 55505 transitions. [2025-03-03 16:23:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:23:43,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2025-03-03 16:23:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:43,182 INFO L225 Difference]: With dead ends: 36670 [2025-03-03 16:23:43,182 INFO L226 Difference]: Without dead ends: 25015 [2025-03-03 16:23:43,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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-03 16:23:43,220 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 297 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:43,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 496 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25015 states. [2025-03-03 16:23:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25015 to 24713. [2025-03-03 16:23:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24713 states, 20162 states have (on average 1.380418609264954) internal successors, (27832), 21371 states have internal predecessors, (27832), 2051 states have call successors, (2051), 1328 states have call predecessors, (2051), 2498 states have return successors, (7100), 2046 states have call predecessors, (7100), 2049 states have call successors, (7100) [2025-03-03 16:23:44,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24713 states to 24713 states and 36983 transitions. [2025-03-03 16:23:44,587 INFO L78 Accepts]: Start accepts. Automaton has 24713 states and 36983 transitions. Word has length 112 [2025-03-03 16:23:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:44,587 INFO L471 AbstractCegarLoop]: Abstraction has 24713 states and 36983 transitions. [2025-03-03 16:23:44,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 24713 states and 36983 transitions. [2025-03-03 16:23:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:44,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:44,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 16:23:44,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:23:44,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:23:44,810 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash 125631867, now seen corresponding path program 1 times [2025-03-03 16:23:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:44,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834326700] [2025-03-03 16:23:44,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:44,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:44,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:44,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:44,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:23:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834326700] [2025-03-03 16:23:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834326700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:23:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103521049] [2025-03-03 16:23:44,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:44,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:23:44,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:44,881 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-03 16:23:44,890 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-03 16:23:44,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:44,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:44,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:44,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:23:44,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:23:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 16:23:44,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:23:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103521049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:23:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:23:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129329091] [2025-03-03 16:23:44,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:23:44,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:44,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:23:44,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:44,992 INFO L87 Difference]: Start difference. First operand 24713 states and 36983 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 16:23:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:47,688 INFO L93 Difference]: Finished difference Result 68507 states and 104947 transitions. [2025-03-03 16:23:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:23:47,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2025-03-03 16:23:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:47,909 INFO L225 Difference]: With dead ends: 68507 [2025-03-03 16:23:47,909 INFO L226 Difference]: Without dead ends: 45893 [2025-03-03 16:23:47,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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-03 16:23:47,973 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 158 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:47,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 828 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45893 states. [2025-03-03 16:23:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45893 to 45893. [2025-03-03 16:23:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45893 states, 37535 states have (on average 1.380977754096177) internal successors, (51835), 39857 states have internal predecessors, (51835), 3656 states have call successors, (3656), 2418 states have call predecessors, (3656), 4700 states have return successors, (14075), 3682 states have call predecessors, (14075), 3654 states have call successors, (14075) [2025-03-03 16:23:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45893 states to 45893 states and 69566 transitions. [2025-03-03 16:23:50,886 INFO L78 Accepts]: Start accepts. Automaton has 45893 states and 69566 transitions. Word has length 112 [2025-03-03 16:23:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:50,886 INFO L471 AbstractCegarLoop]: Abstraction has 45893 states and 69566 transitions. [2025-03-03 16:23:50,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 16:23:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 45893 states and 69566 transitions. [2025-03-03 16:23:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:23:50,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:50,984 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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] [2025-03-03 16:23:50,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:23:51,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:23:51,190 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:51,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:51,191 INFO L85 PathProgramCache]: Analyzing trace with hash 58571233, now seen corresponding path program 1 times [2025-03-03 16:23:51,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:51,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960403686] [2025-03-03 16:23:51,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:51,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:23:51,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:23:51,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:51,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 16:23:51,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960403686] [2025-03-03 16:23:51,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960403686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:23:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807011893] [2025-03-03 16:23:51,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:51,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:23:51,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:51,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:23:51,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:23:51,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:23:51,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:23:51,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:51,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:51,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:23:51,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:23:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 16:23:51,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:23:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807011893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:51,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:23:51,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 16:23:51,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888005759] [2025-03-03 16:23:51,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:51,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:23:51,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:51,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:23:51,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:23:51,487 INFO L87 Difference]: Start difference. First operand 45893 states and 69566 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:23:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:54,257 INFO L93 Difference]: Finished difference Result 49822 states and 74363 transitions. [2025-03-03 16:23:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:23:54,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-03 16:23:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:54,421 INFO L225 Difference]: With dead ends: 49822 [2025-03-03 16:23:54,421 INFO L226 Difference]: Without dead ends: 47822 [2025-03-03 16:23:54,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:23:54,443 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 61 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:54,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 654 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47822 states. [2025-03-03 16:23:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47822 to 47790. [2025-03-03 16:23:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47790 states, 39015 states have (on average 1.374240676662822) internal successors, (53616), 41362 states have internal predecessors, (53616), 3863 states have call successors, (3863), 2581 states have call predecessors, (3863), 4910 states have return successors, (14338), 3911 states have call predecessors, (14338), 3861 states have call successors, (14338) [2025-03-03 16:23:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47790 states to 47790 states and 71817 transitions. [2025-03-03 16:23:57,343 INFO L78 Accepts]: Start accepts. Automaton has 47790 states and 71817 transitions. Word has length 164 [2025-03-03 16:23:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:57,344 INFO L471 AbstractCegarLoop]: Abstraction has 47790 states and 71817 transitions. [2025-03-03 16:23:57,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:23:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 47790 states and 71817 transitions. [2025-03-03 16:23:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:23:57,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:57,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:23:57,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 16:23:57,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:23:57,660 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:57,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:57,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1547863243, now seen corresponding path program 1 times [2025-03-03 16:23:57,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:57,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199693187] [2025-03-03 16:23:57,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:57,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:57,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:23:57,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:23:57,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:57,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 16:23:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199693187] [2025-03-03 16:23:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199693187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:23:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553483527] [2025-03-03 16:23:57,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:57,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:23:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:57,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:23:57,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:23:57,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:23:57,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:23:57,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:57,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:57,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:23:57,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:23:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:23:57,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:23:57,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553483527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:57,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:23:57,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:23:57,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767131154] [2025-03-03 16:23:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:57,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:23:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:57,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:23:57,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:57,955 INFO L87 Difference]: Start difference. First operand 47790 states and 71817 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 16:24:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:00,720 INFO L93 Difference]: Finished difference Result 69910 states and 105243 transitions. [2025-03-03 16:24:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2025-03-03 16:24:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:00,874 INFO L225 Difference]: With dead ends: 69910 [2025-03-03 16:24:00,875 INFO L226 Difference]: Without dead ends: 39026 [2025-03-03 16:24:00,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 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-03 16:24:00,948 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 264 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:00,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 363 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:00,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39026 states.