./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:54:20,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:54:20,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:54:20,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:54:20,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:54:20,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:54:20,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:54:20,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:54:20,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:54:20,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:54:20,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:54:20,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:54:20,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:54:20,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:54:20,428 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:54:20,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:54:20,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:54:20,428 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:54:20,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:54:20,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:54:20,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:54:20,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:54:20,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:54:20,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:54:20,430 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-jdk21/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 -> 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 [2025-02-05 17:54:20,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:54:20,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:54:20,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:54:20,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:54:20,715 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:54:20,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2025-02-05 17:54:21,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/371ec6877/ad875afcf1cb4231b92da2ef5c11d8ee/FLAG662993644 [2025-02-05 17:54:22,305 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:54:22,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2025-02-05 17:54:22,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/371ec6877/ad875afcf1cb4231b92da2ef5c11d8ee/FLAG662993644 [2025-02-05 17:54:22,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/371ec6877/ad875afcf1cb4231b92da2ef5c11d8ee [2025-02-05 17:54:22,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:54:22,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:54:22,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:54:22,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:54:22,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:54:22,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:22,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312f5e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22, skipping insertion in model container [2025-02-05 17:54:22,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:22,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:54:22,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2025-02-05 17:54:22,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2025-02-05 17:54:22,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:54:22,740 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:54:22,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2025-02-05 17:54:22,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2025-02-05 17:54:22,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:54:22,856 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:54:22,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22 WrapperNode [2025-02-05 17:54:22,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:54:22,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:54:22,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:54:22,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:54:22,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:22,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:22,932 INFO L138 Inliner]: procedures = 59, calls = 66, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 498 [2025-02-05 17:54:22,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:54:22,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:54:22,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:54:22,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:54:22,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:22,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:22,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:23,002 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-02-05 17:54:23,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:23,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:23,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:23,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:23,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:23,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:23,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:54:23,037 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:54:23,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:54:23,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:54:23,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (1/1) ... [2025-02-05 17:54:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:54:23,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:54:23,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:54:23,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:54:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:54:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:54:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:54:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:54:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:54:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:54:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:54:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:54:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:54:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:54:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:54:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:54:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:54:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:54:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:54:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:54:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:54:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:54:23,119 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:54:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:54:23,119 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:54:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:54:23,119 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:54:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:54:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:54:23,120 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:54:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:54:23,120 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:54:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:54:23,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:54:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:54:23,120 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:54:23,206 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:54:23,209 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:54:23,726 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-02-05 17:54:23,726 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:54:23,745 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:54:23,746 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:54:23,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:54:23 BoogieIcfgContainer [2025-02-05 17:54:23,746 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:54:23,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:54:23,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:54:23,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:54:23,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:54:22" (1/3) ... [2025-02-05 17:54:23,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382c6114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:54:23, skipping insertion in model container [2025-02-05 17:54:23,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:22" (2/3) ... [2025-02-05 17:54:23,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382c6114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:54:23, skipping insertion in model container [2025-02-05 17:54:23,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:54:23" (3/3) ... [2025-02-05 17:54:23,757 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2025-02-05 17:54:23,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:54:23,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.c that has 15 procedures, 268 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-02-05 17:54:23,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:54:23,841 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;@4ddca04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:54:23,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:54:23,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 269 states, 220 states have (on average 1.5) internal successors, (330), 227 states have internal predecessors, (330), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 17:54:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:23,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:23,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:23,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:23,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash 235399185, now seen corresponding path program 1 times [2025-02-05 17:54:23,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:23,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944553437] [2025-02-05 17:54:23,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:23,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:23,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:23,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:23,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:24,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:24,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944553437] [2025-02-05 17:54:24,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944553437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700452683] [2025-02-05 17:54:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:24,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:24,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:24,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:24,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:24,099 INFO L87 Difference]: Start difference. First operand has 269 states, 220 states have (on average 1.5) internal successors, (330), 227 states have internal predecessors, (330), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-02-05 17:54:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:24,178 INFO L93 Difference]: Finished difference Result 520 states and 755 transitions. [2025-02-05 17:54:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:24,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 65 [2025-02-05 17:54:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:24,187 INFO L225 Difference]: With dead ends: 520 [2025-02-05 17:54:24,187 INFO L226 Difference]: Without dead ends: 258 [2025-02-05 17:54:24,190 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-02-05 17:54:24,192 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 133 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 613 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-02-05 17:54:24,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 613 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-05 17:54:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-05 17:54:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 212 states have (on average 1.4433962264150944) internal successors, (306), 216 states have internal predecessors, (306), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 17:54:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 366 transitions. [2025-02-05 17:54:24,243 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 366 transitions. Word has length 65 [2025-02-05 17:54:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:24,244 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 366 transitions. [2025-02-05 17:54:24,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-02-05 17:54:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 366 transitions. [2025-02-05 17:54:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:24,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:24,246 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-02-05 17:54:24,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:54:24,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:24,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 215061810, now seen corresponding path program 1 times [2025-02-05 17:54:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045095274] [2025-02-05 17:54:24,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:24,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:24,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:24,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:24,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:24,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:24,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045095274] [2025-02-05 17:54:24,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045095274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:24,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:24,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:24,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127130998] [2025-02-05 17:54:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:24,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:24,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:24,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:24,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:24,542 INFO L87 Difference]: Start difference. First operand 258 states and 366 transitions. 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-02-05 17:54:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:25,063 INFO L93 Difference]: Finished difference Result 453 states and 636 transitions. [2025-02-05 17:54:25,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:25,064 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-02-05 17:54:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:25,067 INFO L225 Difference]: With dead ends: 453 [2025-02-05 17:54:25,071 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 17:54:25,073 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-02-05 17:54:25,073 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 295 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:25,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 825 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 17:54:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2025-02-05 17:54:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 290 states have (on average 1.4172413793103449) internal successors, (411), 296 states have internal predecessors, (411), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2025-02-05 17:54:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 498 transitions. [2025-02-05 17:54:25,119 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 498 transitions. Word has length 65 [2025-02-05 17:54:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:25,119 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 498 transitions. [2025-02-05 17:54:25,119 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-02-05 17:54:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 498 transitions. [2025-02-05 17:54:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:25,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:25,123 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-02-05 17:54:25,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:54:25,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:25,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1220278161, now seen corresponding path program 1 times [2025-02-05 17:54:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:25,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657074871] [2025-02-05 17:54:25,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:25,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:25,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:25,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:25,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:25,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:25,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:25,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657074871] [2025-02-05 17:54:25,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657074871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:25,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:25,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:25,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928564379] [2025-02-05 17:54:25,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:25,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:25,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:25,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:25,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:25,286 INFO L87 Difference]: Start difference. First operand 356 states and 498 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-02-05 17:54:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:25,999 INFO L93 Difference]: Finished difference Result 679 states and 931 transitions. [2025-02-05 17:54:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:26,000 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-02-05 17:54:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:26,004 INFO L225 Difference]: With dead ends: 679 [2025-02-05 17:54:26,004 INFO L226 Difference]: Without dead ends: 498 [2025-02-05 17:54:26,005 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-02-05 17:54:26,006 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 545 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:26,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1071 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-05 17:54:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 454. [2025-02-05 17:54:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 368 states have (on average 1.3994565217391304) internal successors, (515), 376 states have internal predecessors, (515), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2025-02-05 17:54:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 632 transitions. [2025-02-05 17:54:26,060 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 632 transitions. Word has length 65 [2025-02-05 17:54:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:26,060 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 632 transitions. [2025-02-05 17:54:26,061 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-02-05 17:54:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 632 transitions. [2025-02-05 17:54:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:26,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:26,066 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-02-05 17:54:26,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:54:26,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:26,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash -87087568, now seen corresponding path program 1 times [2025-02-05 17:54:26,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:26,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933636521] [2025-02-05 17:54:26,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:26,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:26,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:26,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:26,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:26,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933636521] [2025-02-05 17:54:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933636521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427169014] [2025-02-05 17:54:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:26,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:26,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:26,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:26,164 INFO L87 Difference]: Start difference. First operand 454 states and 632 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-02-05 17:54:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:26,213 INFO L93 Difference]: Finished difference Result 732 states and 1008 transitions. [2025-02-05 17:54:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:26,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2025-02-05 17:54:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:26,218 INFO L225 Difference]: With dead ends: 732 [2025-02-05 17:54:26,218 INFO L226 Difference]: Without dead ends: 459 [2025-02-05 17:54:26,219 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-02-05 17:54:26,220 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 0 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1810 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-02-05 17:54:26,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1810 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-05 17:54:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2025-02-05 17:54:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 372 states have (on average 1.3897849462365592) internal successors, (517), 380 states have internal predecessors, (517), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2025-02-05 17:54:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 635 transitions. [2025-02-05 17:54:26,292 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 635 transitions. Word has length 65 [2025-02-05 17:54:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:26,293 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 635 transitions. [2025-02-05 17:54:26,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-02-05 17:54:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 635 transitions. [2025-02-05 17:54:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:26,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:26,295 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-02-05 17:54:26,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:54:26,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:26,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1545716431, now seen corresponding path program 1 times [2025-02-05 17:54:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139747513] [2025-02-05 17:54:26,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:26,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:26,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:26,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:26,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:26,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:26,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139747513] [2025-02-05 17:54:26,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139747513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:26,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:54:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805254140] [2025-02-05 17:54:26,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:26,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:54:26,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:26,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:54:26,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:54:26,410 INFO L87 Difference]: Start difference. First operand 459 states and 635 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-02-05 17:54:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:27,468 INFO L93 Difference]: Finished difference Result 1727 states and 2339 transitions. [2025-02-05 17:54:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:54:27,469 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), 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 65 [2025-02-05 17:54:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:27,479 INFO L225 Difference]: With dead ends: 1727 [2025-02-05 17:54:27,480 INFO L226 Difference]: Without dead ends: 1431 [2025-02-05 17:54:27,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:54:27,483 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 1763 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:27,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 1239 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:54:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2025-02-05 17:54:27,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1377. [2025-02-05 17:54:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1104 states have (on average 1.3233695652173914) internal successors, (1461), 1127 states have internal predecessors, (1461), 141 states have call successors, (141), 111 states have call predecessors, (141), 130 states have return successors, (179), 141 states have call predecessors, (179), 139 states have call successors, (179) [2025-02-05 17:54:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1781 transitions. [2025-02-05 17:54:27,603 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1781 transitions. Word has length 65 [2025-02-05 17:54:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:27,603 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1781 transitions. [2025-02-05 17:54:27,603 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), 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-02-05 17:54:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1781 transitions. [2025-02-05 17:54:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:27,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:27,604 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-02-05 17:54:27,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:54:27,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:27,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash -820504611, now seen corresponding path program 1 times [2025-02-05 17:54:27,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:27,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532582764] [2025-02-05 17:54:27,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:27,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:27,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:27,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:27,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:27,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532582764] [2025-02-05 17:54:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532582764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:27,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:27,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179652240] [2025-02-05 17:54:27,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:27,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:27,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:27,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:27,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:27,732 INFO L87 Difference]: Start difference. First operand 1377 states and 1781 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-02-05 17:54:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:27,915 INFO L93 Difference]: Finished difference Result 2615 states and 3365 transitions. [2025-02-05 17:54:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:27,916 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-02-05 17:54:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:27,963 INFO L225 Difference]: With dead ends: 2615 [2025-02-05 17:54:27,963 INFO L226 Difference]: Without dead ends: 1407 [2025-02-05 17:54:27,969 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-02-05 17:54:27,969 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 0 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1810 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-02-05 17:54:27,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1810 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-02-05 17:54:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2025-02-05 17:54:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1128 states have (on average 1.3093971631205674) internal successors, (1477), 1151 states have internal predecessors, (1477), 141 states have call successors, (141), 111 states have call predecessors, (141), 136 states have return successors, (185), 147 states have call predecessors, (185), 139 states have call successors, (185) [2025-02-05 17:54:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1803 transitions. [2025-02-05 17:54:28,097 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1803 transitions. Word has length 66 [2025-02-05 17:54:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:28,097 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1803 transitions. [2025-02-05 17:54:28,097 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-02-05 17:54:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1803 transitions. [2025-02-05 17:54:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:28,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:28,098 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-02-05 17:54:28,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:54:28,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:28,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -809188484, now seen corresponding path program 1 times [2025-02-05 17:54:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:28,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006202559] [2025-02-05 17:54:28,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:28,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:28,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:28,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:28,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:28,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:28,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:28,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006202559] [2025-02-05 17:54:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006202559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:28,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:28,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:28,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699491113] [2025-02-05 17:54:28,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:28,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:28,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:28,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:28,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:28,304 INFO L87 Difference]: Start difference. First operand 1407 states and 1803 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-02-05 17:54:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:29,083 INFO L93 Difference]: Finished difference Result 2639 states and 3306 transitions. [2025-02-05 17:54:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:54:29,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 66 [2025-02-05 17:54:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:29,090 INFO L225 Difference]: With dead ends: 2639 [2025-02-05 17:54:29,091 INFO L226 Difference]: Without dead ends: 1629 [2025-02-05 17:54:29,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:54:29,093 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 530 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:29,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 858 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-02-05 17:54:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1348. [2025-02-05 17:54:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1085 states have (on average 1.3050691244239632) internal successors, (1416), 1103 states have internal predecessors, (1416), 135 states have call successors, (135), 106 states have call predecessors, (135), 126 states have return successors, (170), 140 states have call predecessors, (170), 133 states have call successors, (170) [2025-02-05 17:54:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1721 transitions. [2025-02-05 17:54:29,165 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1721 transitions. Word has length 66 [2025-02-05 17:54:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:29,165 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1721 transitions. [2025-02-05 17:54:29,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-02-05 17:54:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1721 transitions. [2025-02-05 17:54:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:29,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:29,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:29,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:54:29,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:29,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1408569469, now seen corresponding path program 1 times [2025-02-05 17:54:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:29,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528907451] [2025-02-05 17:54:29,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:29,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:29,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:29,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:29,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:29,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:29,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528907451] [2025-02-05 17:54:29,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528907451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:29,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:29,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:54:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048894351] [2025-02-05 17:54:29,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:29,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:54:29,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:29,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:54:29,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:54:29,222 INFO L87 Difference]: Start difference. First operand 1348 states and 1721 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:29,573 INFO L93 Difference]: Finished difference Result 3594 states and 4555 transitions. [2025-02-05 17:54:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:54:29,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 17:54:29,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:29,586 INFO L225 Difference]: With dead ends: 3594 [2025-02-05 17:54:29,586 INFO L226 Difference]: Without dead ends: 2416 [2025-02-05 17:54:29,589 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-02-05 17:54:29,590 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 489 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:29,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 443 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:54:29,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-02-05 17:54:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2412. [2025-02-05 17:54:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2412 states, 1909 states have (on average 1.2629649030906234) internal successors, (2411), 1943 states have internal predecessors, (2411), 251 states have call successors, (251), 205 states have call predecessors, (251), 250 states have return successors, (358), 265 states have call predecessors, (358), 249 states have call successors, (358) [2025-02-05 17:54:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3020 transitions. [2025-02-05 17:54:29,708 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3020 transitions. Word has length 66 [2025-02-05 17:54:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:29,709 INFO L471 AbstractCegarLoop]: Abstraction has 2412 states and 3020 transitions. [2025-02-05 17:54:29,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3020 transitions. [2025-02-05 17:54:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:54:29,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:29,710 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] [2025-02-05 17:54:29,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:54:29,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:29,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash 524754727, now seen corresponding path program 1 times [2025-02-05 17:54:29,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:29,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443457133] [2025-02-05 17:54:29,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:29,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:29,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:54:29,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:54:29,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:29,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443457133] [2025-02-05 17:54:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443457133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:29,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569043464] [2025-02-05 17:54:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:29,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:29,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:29,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:29,744 INFO L87 Difference]: Start difference. First operand 2412 states and 3020 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:29,951 INFO L93 Difference]: Finished difference Result 5511 states and 6884 transitions. [2025-02-05 17:54:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:29,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-02-05 17:54:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:29,972 INFO L225 Difference]: With dead ends: 5511 [2025-02-05 17:54:29,973 INFO L226 Difference]: Without dead ends: 3233 [2025-02-05 17:54:29,979 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-02-05 17:54:29,981 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 101 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:29,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 716 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2025-02-05 17:54:30,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3171. [2025-02-05 17:54:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 2497 states have (on average 1.2535042050460552) internal successors, (3130), 2536 states have internal predecessors, (3130), 335 states have call successors, (335), 278 states have call predecessors, (335), 337 states have return successors, (462), 358 states have call predecessors, (462), 333 states have call successors, (462) [2025-02-05 17:54:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 3927 transitions. [2025-02-05 17:54:30,183 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 3927 transitions. Word has length 67 [2025-02-05 17:54:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:30,183 INFO L471 AbstractCegarLoop]: Abstraction has 3171 states and 3927 transitions. [2025-02-05 17:54:30,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 3927 transitions. [2025-02-05 17:54:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 17:54:30,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:30,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:30,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:54:30,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:30,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash 894779843, now seen corresponding path program 1 times [2025-02-05 17:54:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733987833] [2025-02-05 17:54:30,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:30,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:54:30,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:54:30,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:30,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733987833] [2025-02-05 17:54:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733987833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:30,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:30,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:30,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608712682] [2025-02-05 17:54:30,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:30,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:30,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:30,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:30,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:30,218 INFO L87 Difference]: Start difference. First operand 3171 states and 3927 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:30,267 INFO L93 Difference]: Finished difference Result 3521 states and 4346 transitions. [2025-02-05 17:54:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:30,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-02-05 17:54:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:30,272 INFO L225 Difference]: With dead ends: 3521 [2025-02-05 17:54:30,272 INFO L226 Difference]: Without dead ends: 515 [2025-02-05 17:54:30,277 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-02-05 17:54:30,277 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:30,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 344 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-05 17:54:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 471. [2025-02-05 17:54:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 372 states have (on average 1.2688172043010753) internal successors, (472), 378 states have internal predecessors, (472), 57 states have call successors, (57), 37 states have call predecessors, (57), 40 states have return successors, (59), 57 states have call predecessors, (59), 55 states have call successors, (59) [2025-02-05 17:54:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 588 transitions. [2025-02-05 17:54:30,302 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 588 transitions. Word has length 73 [2025-02-05 17:54:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:30,303 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 588 transitions. [2025-02-05 17:54:30,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 588 transitions. [2025-02-05 17:54:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:54:30,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:30,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:30,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:54:30,305 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash 695320072, now seen corresponding path program 1 times [2025-02-05 17:54:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408672422] [2025-02-05 17:54:30,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:30,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:54:30,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:54:30,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:30,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:30,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408672422] [2025-02-05 17:54:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408672422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:30,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:30,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:30,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790341991] [2025-02-05 17:54:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:30,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:30,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:30,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:30,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:30,369 INFO L87 Difference]: Start difference. First operand 471 states and 588 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-02-05 17:54:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:30,672 INFO L93 Difference]: Finished difference Result 781 states and 1048 transitions. [2025-02-05 17:54:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2025-02-05 17:54:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:30,676 INFO L225 Difference]: With dead ends: 781 [2025-02-05 17:54:30,676 INFO L226 Difference]: Without dead ends: 632 [2025-02-05 17:54:30,677 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-02-05 17:54:30,678 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 532 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:30,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 768 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:54:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-02-05 17:54:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 621. [2025-02-05 17:54:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 503 states have (on average 1.3260437375745526) internal successors, (667), 510 states have internal predecessors, (667), 69 states have call successors, (69), 43 states have call predecessors, (69), 47 states have return successors, (72), 69 states have call predecessors, (72), 67 states have call successors, (72) [2025-02-05 17:54:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 808 transitions. [2025-02-05 17:54:30,706 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 808 transitions. Word has length 79 [2025-02-05 17:54:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:30,707 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 808 transitions. [2025-02-05 17:54:30,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-02-05 17:54:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 808 transitions. [2025-02-05 17:54:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:54:30,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:30,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:30,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:54:30,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:30,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1333639478, now seen corresponding path program 1 times [2025-02-05 17:54:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059152068] [2025-02-05 17:54:30,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:30,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:54:30,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:54:30,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:30,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:30,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059152068] [2025-02-05 17:54:30,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059152068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:30,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:30,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773797079] [2025-02-05 17:54:30,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:30,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:30,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:30,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:30,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:30,802 INFO L87 Difference]: Start difference. First operand 621 states and 808 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:31,228 INFO L93 Difference]: Finished difference Result 1104 states and 1525 transitions. [2025-02-05 17:54:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:31,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:54:31,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:31,233 INFO L225 Difference]: With dead ends: 1104 [2025-02-05 17:54:31,233 INFO L226 Difference]: Without dead ends: 805 [2025-02-05 17:54:31,234 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-02-05 17:54:31,234 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 524 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:31,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1363 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-02-05 17:54:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 762. [2025-02-05 17:54:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 625 states have (on average 1.3504) internal successors, (844), 633 states have internal predecessors, (844), 81 states have call successors, (81), 49 states have call predecessors, (81), 54 states have return successors, (87), 82 states have call predecessors, (87), 79 states have call successors, (87) [2025-02-05 17:54:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1012 transitions. [2025-02-05 17:54:31,268 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1012 transitions. Word has length 79 [2025-02-05 17:54:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1012 transitions. [2025-02-05 17:54:31,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1012 transitions. [2025-02-05 17:54:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:54:31,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:31,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:31,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:54:31,269 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:31,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash 786647721, now seen corresponding path program 1 times [2025-02-05 17:54:31,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:31,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858821845] [2025-02-05 17:54:31,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:31,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:31,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:54:31,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:54:31,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:31,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858821845] [2025-02-05 17:54:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858821845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646360667] [2025-02-05 17:54:31,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:31,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:31,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:31,341 INFO L87 Difference]: Start difference. First operand 762 states and 1012 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:31,760 INFO L93 Difference]: Finished difference Result 1543 states and 2168 transitions. [2025-02-05 17:54:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:31,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:54:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:31,790 INFO L225 Difference]: With dead ends: 1543 [2025-02-05 17:54:31,790 INFO L226 Difference]: Without dead ends: 1103 [2025-02-05 17:54:31,791 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-02-05 17:54:31,792 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 519 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:31,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1347 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:54:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-02-05 17:54:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1057. [2025-02-05 17:54:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 880 states have (on average 1.3829545454545455) internal successors, (1217), 892 states have internal predecessors, (1217), 105 states have call successors, (105), 61 states have call predecessors, (105), 70 states have return successors, (123), 108 states have call predecessors, (123), 103 states have call successors, (123) [2025-02-05 17:54:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1445 transitions. [2025-02-05 17:54:31,840 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1445 transitions. Word has length 79 [2025-02-05 17:54:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:31,840 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1445 transitions. [2025-02-05 17:54:31,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1445 transitions. [2025-02-05 17:54:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:54:31,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:31,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:31,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:54:31,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 577949418, now seen corresponding path program 1 times [2025-02-05 17:54:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391458421] [2025-02-05 17:54:31,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:31,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:54:31,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:54:31,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:31,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:31,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:31,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391458421] [2025-02-05 17:54:31,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391458421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:31,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:31,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:31,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418034509] [2025-02-05 17:54:31,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:31,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:31,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:31,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:31,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:31,927 INFO L87 Difference]: Start difference. First operand 1057 states and 1445 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:32,360 INFO L93 Difference]: Finished difference Result 2468 states and 3551 transitions. [2025-02-05 17:54:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:32,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:54:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:32,368 INFO L225 Difference]: With dead ends: 2468 [2025-02-05 17:54:32,369 INFO L226 Difference]: Without dead ends: 1733 [2025-02-05 17:54:32,371 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-02-05 17:54:32,371 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 514 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:32,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1335 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:54:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-02-05 17:54:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1680. [2025-02-05 17:54:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1417 states have (on average 1.4177840508115738) internal successors, (2009), 1443 states have internal predecessors, (2009), 153 states have call successors, (153), 85 states have call predecessors, (153), 108 states have return successors, (219), 160 states have call predecessors, (219), 151 states have call successors, (219) [2025-02-05 17:54:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2381 transitions. [2025-02-05 17:54:32,499 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2381 transitions. Word has length 79 [2025-02-05 17:54:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:32,499 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2381 transitions. [2025-02-05 17:54:32,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2381 transitions. [2025-02-05 17:54:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:54:32,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:32,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:54:32,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:54:32,503 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:32,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:32,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1229898103, now seen corresponding path program 1 times [2025-02-05 17:54:32,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:32,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041322040] [2025-02-05 17:54:32,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:32,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:32,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:54:32,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:54:32,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:32,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041322040] [2025-02-05 17:54:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041322040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:32,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:32,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70202325] [2025-02-05 17:54:32,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:32,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:32,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:32,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:32,586 INFO L87 Difference]: Start difference. First operand 1680 states and 2381 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:33,186 INFO L93 Difference]: Finished difference Result 4639 states and 6890 transitions. [2025-02-05 17:54:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:33,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:54:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:33,200 INFO L225 Difference]: With dead ends: 4639 [2025-02-05 17:54:33,200 INFO L226 Difference]: Without dead ends: 3281 [2025-02-05 17:54:33,204 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-02-05 17:54:33,205 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 613 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:33,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1310 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2025-02-05 17:54:33,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 2983. [2025-02-05 17:54:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2538 states have (on average 1.450354609929078) internal successors, (3681), 2610 states have internal predecessors, (3681), 241 states have call successors, (241), 133 states have call predecessors, (241), 202 states have return successors, (499), 256 states have call predecessors, (499), 239 states have call successors, (499) [2025-02-05 17:54:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4421 transitions. [2025-02-05 17:54:33,372 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4421 transitions. Word has length 79 [2025-02-05 17:54:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:33,372 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 4421 transitions. [2025-02-05 17:54:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4421 transitions. [2025-02-05 17:54:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:54:33,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:33,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:54:33,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:54:33,374 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:33,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:33,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1898372874, now seen corresponding path program 1 times [2025-02-05 17:54:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:33,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634079699] [2025-02-05 17:54:33,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:33,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:33,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:54:33,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:54:33,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:33,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:33,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634079699] [2025-02-05 17:54:33,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634079699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:33,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:33,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:33,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556220250] [2025-02-05 17:54:33,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:33,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:33,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:33,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:33,445 INFO L87 Difference]: Start difference. First operand 2983 states and 4421 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:34,051 INFO L93 Difference]: Finished difference Result 8838 states and 13764 transitions. [2025-02-05 17:54:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:54:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:34,084 INFO L225 Difference]: With dead ends: 8838 [2025-02-05 17:54:34,084 INFO L226 Difference]: Without dead ends: 6177 [2025-02-05 17:54:34,097 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-02-05 17:54:34,097 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 577 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:34,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1294 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6177 states. [2025-02-05 17:54:34,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6177 to 5658. [2025-02-05 17:54:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5658 states, 4803 states have (on average 1.4726212783676869) internal successors, (7073), 5021 states have internal predecessors, (7073), 409 states have call successors, (409), 229 states have call predecessors, (409), 444 states have return successors, (1435), 440 states have call predecessors, (1435), 407 states have call successors, (1435) [2025-02-05 17:54:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5658 states to 5658 states and 8917 transitions. [2025-02-05 17:54:34,485 INFO L78 Accepts]: Start accepts. Automaton has 5658 states and 8917 transitions. Word has length 79 [2025-02-05 17:54:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:34,486 INFO L471 AbstractCegarLoop]: Abstraction has 5658 states and 8917 transitions. [2025-02-05 17:54:34,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 5658 states and 8917 transitions. [2025-02-05 17:54:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:54:34,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:34,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:34,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:54:34,491 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:34,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1999284841, now seen corresponding path program 1 times [2025-02-05 17:54:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318748061] [2025-02-05 17:54:34,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:34,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:54:34,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:54:34,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:34,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:34,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:34,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318748061] [2025-02-05 17:54:34,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318748061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:34,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:34,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048667154] [2025-02-05 17:54:34,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:34,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:34,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:34,575 INFO L87 Difference]: Start difference. First operand 5658 states and 8917 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:35,715 INFO L93 Difference]: Finished difference Result 17393 states and 29274 transitions. [2025-02-05 17:54:35,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:35,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:54:35,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:35,786 INFO L225 Difference]: With dead ends: 17393 [2025-02-05 17:54:35,786 INFO L226 Difference]: Without dead ends: 12057 [2025-02-05 17:54:35,807 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-02-05 17:54:35,808 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 543 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:35,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1286 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12057 states. [2025-02-05 17:54:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12057 to 11461. [2025-02-05 17:54:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11461 states, 9640 states have (on average 1.4810165975103735) internal successors, (14277), 10312 states have internal predecessors, (14277), 729 states have call successors, (729), 421 states have call predecessors, (729), 1090 states have return successors, (4827), 792 states have call predecessors, (4827), 727 states have call successors, (4827) [2025-02-05 17:54:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11461 states to 11461 states and 19833 transitions. [2025-02-05 17:54:36,567 INFO L78 Accepts]: Start accepts. Automaton has 11461 states and 19833 transitions. Word has length 79 [2025-02-05 17:54:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:36,567 INFO L471 AbstractCegarLoop]: Abstraction has 11461 states and 19833 transitions. [2025-02-05 17:54:36,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 11461 states and 19833 transitions. [2025-02-05 17:54:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:54:36,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:36,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:36,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:54:36,576 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:36,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2015332566, now seen corresponding path program 1 times [2025-02-05 17:54:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:36,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141136352] [2025-02-05 17:54:36,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:36,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:36,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:54:36,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:54:36,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:36,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:36,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:36,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141136352] [2025-02-05 17:54:36,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141136352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:36,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:36,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:36,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86104430] [2025-02-05 17:54:36,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:36,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:36,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:36,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:36,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:36,654 INFO L87 Difference]: Start difference. First operand 11461 states and 19833 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:38,323 INFO L93 Difference]: Finished difference Result 35456 states and 68024 transitions. [2025-02-05 17:54:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:38,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:54:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:38,444 INFO L225 Difference]: With dead ends: 35456 [2025-02-05 17:54:38,444 INFO L226 Difference]: Without dead ends: 24317 [2025-02-05 17:54:38,485 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-02-05 17:54:38,486 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 508 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:38,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1274 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2025-02-05 17:54:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 23676. [2025-02-05 17:54:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23676 states, 19485 states have (on average 1.4668206312548113) internal successors, (28581), 21551 states have internal predecessors, (28581), 1329 states have call successors, (1329), 797 states have call predecessors, (1329), 2860 states have return successors, (17715), 1456 states have call predecessors, (17715), 1327 states have call successors, (17715) [2025-02-05 17:54:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23676 states to 23676 states and 47625 transitions. [2025-02-05 17:54:41,044 INFO L78 Accepts]: Start accepts. Automaton has 23676 states and 47625 transitions. Word has length 79 [2025-02-05 17:54:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:41,044 INFO L471 AbstractCegarLoop]: Abstraction has 23676 states and 47625 transitions. [2025-02-05 17:54:41,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-02-05 17:54:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 23676 states and 47625 transitions. [2025-02-05 17:54:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:54:41,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:41,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:41,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:54:41,057 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:41,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash 349015625, now seen corresponding path program 1 times [2025-02-05 17:54:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:41,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160088538] [2025-02-05 17:54:41,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:41,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:54:41,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:54:41,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:41,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:41,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:41,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160088538] [2025-02-05 17:54:41,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160088538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:41,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:41,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:54:41,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287048312] [2025-02-05 17:54:41,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:41,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:54:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:41,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:54:41,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:54:41,100 INFO L87 Difference]: Start difference. First operand 23676 states and 47625 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-05 17:54:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:43,665 INFO L93 Difference]: Finished difference Result 59830 states and 120353 transitions. [2025-02-05 17:54:43,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:54:43,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2025-02-05 17:54:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:43,793 INFO L225 Difference]: With dead ends: 59830 [2025-02-05 17:54:43,794 INFO L226 Difference]: Without dead ends: 36477 [2025-02-05 17:54:43,839 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-02-05 17:54:43,839 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 505 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 987 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.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:43,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 987 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:54:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36477 states. [2025-02-05 17:54:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36477 to 34144. [2025-02-05 17:54:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34144 states, 28212 states have (on average 1.4514391039274068) internal successors, (40948), 31009 states have internal predecessors, (40948), 2014 states have call successors, (2014), 1187 states have call predecessors, (2014), 3916 states have return successors, (22433), 2076 states have call predecessors, (22433), 2012 states have call successors, (22433) [2025-02-05 17:54:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34144 states to 34144 states and 65395 transitions. [2025-02-05 17:54:46,676 INFO L78 Accepts]: Start accepts. Automaton has 34144 states and 65395 transitions. Word has length 79 [2025-02-05 17:54:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:46,677 INFO L471 AbstractCegarLoop]: Abstraction has 34144 states and 65395 transitions. [2025-02-05 17:54:46,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-02-05 17:54:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 34144 states and 65395 transitions. [2025-02-05 17:54:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:54:46,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:46,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:46,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:54:46,693 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:46,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1088864763, now seen corresponding path program 1 times [2025-02-05 17:54:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:46,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629774888] [2025-02-05 17:54:46,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:46,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:54:46,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:54:46,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:46,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 17:54:46,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629774888] [2025-02-05 17:54:46,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629774888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:46,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:46,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712025790] [2025-02-05 17:54:46,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:46,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:46,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:46,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:46,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:46,760 INFO L87 Difference]: Start difference. First operand 34144 states and 65395 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:54:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:49,284 INFO L93 Difference]: Finished difference Result 34745 states and 66072 transitions. [2025-02-05 17:54:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 17:54:49,284 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), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2025-02-05 17:54:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:49,444 INFO L225 Difference]: With dead ends: 34745 [2025-02-05 17:54:49,445 INFO L226 Difference]: Without dead ends: 34381 [2025-02-05 17:54:49,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:54:49,473 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 456 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:49,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 996 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34381 states. [2025-02-05 17:54:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34381 to 34341. [2025-02-05 17:54:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34341 states, 28360 states have (on average 1.4496121297602256) internal successors, (41111), 31158 states have internal predecessors, (41111), 2038 states have call successors, (2038), 1208 states have call predecessors, (2038), 3941 states have return successors, (22464), 2103 states have call predecessors, (22464), 2036 states have call successors, (22464) [2025-02-05 17:54:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34341 states to 34341 states and 65613 transitions. [2025-02-05 17:54:52,515 INFO L78 Accepts]: Start accepts. Automaton has 34341 states and 65613 transitions. Word has length 84 [2025-02-05 17:54:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:52,517 INFO L471 AbstractCegarLoop]: Abstraction has 34341 states and 65613 transitions. [2025-02-05 17:54:52,517 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), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:54:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 34341 states and 65613 transitions. [2025-02-05 17:54:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 17:54:52,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:52,631 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:52,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:54:52,632 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:52,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash -867292745, now seen corresponding path program 1 times [2025-02-05 17:54:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:52,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030153739] [2025-02-05 17:54:52,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:52,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:52,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:54:52,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:54:52,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:52,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:54:52,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:52,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030153739] [2025-02-05 17:54:52,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030153739] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:54:52,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773786113] [2025-02-05 17:54:52,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:52,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:54:52,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:54:52,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:54:52,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:54:52,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:54:52,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:54:52,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:52,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:52,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:54:52,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:54:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 17:54:52,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:54:52,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773786113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:52,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:54:52,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:54:52,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480763875] [2025-02-05 17:54:52,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:52,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:52,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:52,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:52,870 INFO L87 Difference]: Start difference. First operand 34341 states and 65613 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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-02-05 17:54:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:57,021 INFO L93 Difference]: Finished difference Result 101276 states and 195231 transitions. [2025-02-05 17:54:57,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:57,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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 130 [2025-02-05 17:54:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:57,345 INFO L225 Difference]: With dead ends: 101276 [2025-02-05 17:54:57,346 INFO L226 Difference]: Without dead ends: 67455 [2025-02-05 17:54:57,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 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-02-05 17:54:57,459 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 294 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 543 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-02-05 17:54:57,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 543 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67455 states. [2025-02-05 17:55:02,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67455 to 66871. [2025-02-05 17:55:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66871 states, 55152 states have (on average 1.450844937626922) internal successors, (80017), 60741 states have internal predecessors, (80017), 3902 states have call successors, (3902), 2356 states have call predecessors, (3902), 7815 states have return successors, (44618), 3902 states have call predecessors, (44618), 3900 states have call successors, (44618) [2025-02-05 17:55:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66871 states to 66871 states and 128537 transitions. [2025-02-05 17:55:02,773 INFO L78 Accepts]: Start accepts. Automaton has 66871 states and 128537 transitions. Word has length 130 [2025-02-05 17:55:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:02,774 INFO L471 AbstractCegarLoop]: Abstraction has 66871 states and 128537 transitions. [2025-02-05 17:55:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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-02-05 17:55:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 66871 states and 128537 transitions. [2025-02-05 17:55:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 17:55:02,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:02,917 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:02,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:55:03,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:55:03,124 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:03,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash -441622415, now seen corresponding path program 1 times [2025-02-05 17:55:03,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:03,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586658732] [2025-02-05 17:55:03,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:03,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:03,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:55:03,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:55:03,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:03,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:55:03,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:03,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586658732] [2025-02-05 17:55:03,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586658732] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:55:03,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337308225] [2025-02-05 17:55:03,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:03,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:55:03,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:55:03,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:55:03,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:55:03,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:55:03,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:55:03,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:03,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:03,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:55:03,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:55:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 17:55:03,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:55:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337308225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:03,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:55:03,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:55:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144054591] [2025-02-05 17:55:03,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:03,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:03,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:03,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:03,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:03,428 INFO L87 Difference]: Start difference. First operand 66871 states and 128537 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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)