./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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.13.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 030c097c5e5981a6b9166b6af780aa84c84c48bf3e4236dc73dc256776dad070 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:55:26,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:55:26,223 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:55:26,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:55:26,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:55:26,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:55:26,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:55:26,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:55:26,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:55:26,303 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:55:26,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:55:26,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:55:26,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:55:26,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:55:26,306 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:55:26,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:55:26,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:55:26,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:55:26,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:55:26,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:55:26,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:55:26,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:55:26,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:55:26,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:55:26,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:55:26,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:55:26,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:55:26,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:55:26,310 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 -> 030c097c5e5981a6b9166b6af780aa84c84c48bf3e4236dc73dc256776dad070 [2025-02-05 17:55:26,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:55:26,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:55:26,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:55:26,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:55:26,611 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:55:26,613 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.13.cil-2.c [2025-02-05 17:55:27,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a629dfde2/96d99f83d0cd4caf8498caf9b619e961/FLAG6d7d8e7ba [2025-02-05 17:55:28,252 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:55:28,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2025-02-05 17:55:28,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a629dfde2/96d99f83d0cd4caf8498caf9b619e961/FLAG6d7d8e7ba [2025-02-05 17:55:28,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a629dfde2/96d99f83d0cd4caf8498caf9b619e961 [2025-02-05 17:55:28,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:55:28,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:55:28,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:55:28,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:55:28,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:55:28,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:28,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28, skipping insertion in model container [2025-02-05 17:55:28,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:28,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:55:28,493 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.13.cil-2.c[914,927] [2025-02-05 17:55:28,544 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.13.cil-2.c[7115,7128] [2025-02-05 17:55:28,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:55:28,742 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:55:28,755 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.13.cil-2.c[914,927] [2025-02-05 17:55:28,777 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.13.cil-2.c[7115,7128] [2025-02-05 17:55:28,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:55:28,902 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:55:28,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28 WrapperNode [2025-02-05 17:55:28,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:55:28,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:55:28,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:55:28,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:55:28,909 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:55:28" (1/1) ... [2025-02-05 17:55:28,924 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:55:28" (1/1) ... [2025-02-05 17:55:28,977 INFO L138 Inliner]: procedures = 79, calls = 96, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1068 [2025-02-05 17:55:28,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:55:28,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:55:28,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:55:28,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:55:28,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:28,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:28,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:29,027 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:55:29,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:29,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:29,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:29,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:29,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:29,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:29,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:55:29,068 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:55:29,068 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:55:29,068 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:55:29,069 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (1/1) ... [2025-02-05 17:55:29,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:55:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:55:29,127 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:55:29,134 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:55:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:55:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:55:29,150 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:55:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:55:29,150 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:55:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:55:29,150 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:55:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:55:29,150 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:55:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:55:29,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:55:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:55:29,151 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:55:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:55:29,151 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:55:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:55:29,151 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:55:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:55:29,151 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:55:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:55:29,152 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:55:29,152 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:55:29,152 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:55:29,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:55:29,152 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:55:29,152 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:55:29,152 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:55:29,152 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:55:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:55:29,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:55:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:55:29,153 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:55:29,306 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:55:29,312 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:55:30,718 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-02-05 17:55:30,718 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:55:30,739 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:55:30,740 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:55:30,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:55:30 BoogieIcfgContainer [2025-02-05 17:55:30,740 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:55:30,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:55:30,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:55:30,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:55:30,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:55:28" (1/3) ... [2025-02-05 17:55:30,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d741da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:55:30, skipping insertion in model container [2025-02-05 17:55:30,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:28" (2/3) ... [2025-02-05 17:55:30,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d741da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:55:30, skipping insertion in model container [2025-02-05 17:55:30,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:55:30" (3/3) ... [2025-02-05 17:55:30,754 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2025-02-05 17:55:30,774 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:55:30,777 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.13.cil-2.c that has 15 procedures, 538 locations, 1 initial locations, 20 loop locations, and 2 error locations. [2025-02-05 17:55:30,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:55:30,958 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;@21fe1b28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:55:30,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:55:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 480 states have (on average 1.5625) internal successors, (750), 487 states have internal predecessors, (750), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 17:55:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:30,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:30,983 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:55:30,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:30,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash 380662373, now seen corresponding path program 1 times [2025-02-05 17:55:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:31,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961153941] [2025-02-05 17:55:31,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:31,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:31,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:31,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:31,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:31,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:31,309 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:55:31,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:31,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961153941] [2025-02-05 17:55:31,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961153941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:31,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:31,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030643203] [2025-02-05 17:55:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:31,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:31,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:31,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:31,372 INFO L87 Difference]: Start difference. First operand has 539 states, 480 states have (on average 1.5625) internal successors, (750), 487 states have internal predecessors, (750), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 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:55:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:31,480 INFO L93 Difference]: Finished difference Result 1050 states and 1615 transitions. [2025-02-05 17:55:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:31,486 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:55:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:31,498 INFO L225 Difference]: With dead ends: 1050 [2025-02-05 17:55:31,498 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 17:55:31,511 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:55:31,513 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 133 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1473 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:55:31,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1473 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 17:55:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-02-05 17:55:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 472 states have (on average 1.5169491525423728) internal successors, (716), 476 states have internal predecessors, (716), 41 states have call successors, (41), 14 states have call predecessors, (41), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-05 17:55:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 796 transitions. [2025-02-05 17:55:31,624 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 796 transitions. Word has length 65 [2025-02-05 17:55:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:31,638 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 796 transitions. [2025-02-05 17:55:31,639 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:55:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 796 transitions. [2025-02-05 17:55:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:31,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:31,646 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:55:31,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:55:31,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:31,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:31,650 INFO L85 PathProgramCache]: Analyzing trace with hash 360324998, now seen corresponding path program 1 times [2025-02-05 17:55:31,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:31,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461538622] [2025-02-05 17:55:31,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:31,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:31,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:31,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:31,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:31,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:32,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:32,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461538622] [2025-02-05 17:55:32,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461538622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:32,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:32,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725031998] [2025-02-05 17:55:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:32,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:32,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:32,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:32,028 INFO L87 Difference]: Start difference. First operand 528 states and 796 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:55:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:33,035 INFO L93 Difference]: Finished difference Result 723 states and 1066 transitions. [2025-02-05 17:55:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:33,036 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:55:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:33,045 INFO L225 Difference]: With dead ends: 723 [2025-02-05 17:55:33,045 INFO L226 Difference]: Without dead ends: 633 [2025-02-05 17:55:33,048 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:55:33,049 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 495 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:33,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1695 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:55:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-02-05 17:55:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 626. [2025-02-05 17:55:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 550 states have (on average 1.4927272727272727) internal successors, (821), 556 states have internal predecessors, (821), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2025-02-05 17:55:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 928 transitions. [2025-02-05 17:55:33,097 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 928 transitions. Word has length 65 [2025-02-05 17:55:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:33,097 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 928 transitions. [2025-02-05 17:55:33,097 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:55:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 928 transitions. [2025-02-05 17:55:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:33,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:33,099 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:55:33,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:55:33,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:33,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1075014973, now seen corresponding path program 1 times [2025-02-05 17:55:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:33,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959134144] [2025-02-05 17:55:33,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:33,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:33,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:33,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:33,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:33,248 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:55:33,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:33,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959134144] [2025-02-05 17:55:33,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959134144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:33,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:33,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:33,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713262399] [2025-02-05 17:55:33,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:33,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:33,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:33,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:33,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:33,250 INFO L87 Difference]: Start difference. First operand 626 states and 928 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:55:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:34,297 INFO L93 Difference]: Finished difference Result 949 states and 1361 transitions. [2025-02-05 17:55:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:34,297 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:55:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:34,303 INFO L225 Difference]: With dead ends: 949 [2025-02-05 17:55:34,303 INFO L226 Difference]: Without dead ends: 768 [2025-02-05 17:55:34,304 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:55:34,305 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 1165 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:34,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 1921 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:55:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-05 17:55:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 724. [2025-02-05 17:55:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 628 states have (on average 1.4729299363057324) internal successors, (925), 636 states have internal predecessors, (925), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2025-02-05 17:55:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1062 transitions. [2025-02-05 17:55:34,360 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1062 transitions. Word has length 65 [2025-02-05 17:55:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:34,360 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1062 transitions. [2025-02-05 17:55:34,360 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:55:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1062 transitions. [2025-02-05 17:55:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:34,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:34,362 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:55:34,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:55:34,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:34,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:34,362 INFO L85 PathProgramCache]: Analyzing trace with hash 58175620, now seen corresponding path program 1 times [2025-02-05 17:55:34,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:34,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823362959] [2025-02-05 17:55:34,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:34,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:34,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:34,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:34,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:34,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:34,452 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:55:34,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:34,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823362959] [2025-02-05 17:55:34,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823362959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:34,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328537287] [2025-02-05 17:55:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:34,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:34,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:34,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:34,453 INFO L87 Difference]: Start difference. First operand 724 states and 1062 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:55:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:34,510 INFO L93 Difference]: Finished difference Result 1002 states and 1438 transitions. [2025-02-05 17:55:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:34,511 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:55:34,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:34,516 INFO L225 Difference]: With dead ends: 1002 [2025-02-05 17:55:34,516 INFO L226 Difference]: Without dead ends: 729 [2025-02-05 17:55:34,517 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:55:34,518 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 0 mSDsluCounter, 3167 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3960 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:55:34,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3960 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-02-05 17:55:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2025-02-05 17:55:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 632 states have (on average 1.4667721518987342) internal successors, (927), 640 states have internal predecessors, (927), 63 states have call successors, (63), 28 states have call predecessors, (63), 32 states have return successors, (75), 64 states have call predecessors, (75), 61 states have call successors, (75) [2025-02-05 17:55:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1065 transitions. [2025-02-05 17:55:34,553 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1065 transitions. Word has length 65 [2025-02-05 17:55:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:34,553 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1065 transitions. [2025-02-05 17:55:34,553 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:55:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1065 transitions. [2025-02-05 17:55:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:34,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:34,556 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:55:34,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:55:34,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:34,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:34,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1690979619, now seen corresponding path program 1 times [2025-02-05 17:55:34,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:34,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158277066] [2025-02-05 17:55:34,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:34,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:34,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:34,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:34,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:34,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:34,641 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:55:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158277066] [2025-02-05 17:55:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158277066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:34,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:55:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439878155] [2025-02-05 17:55:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:55:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:34,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:55:34,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:55:34,643 INFO L87 Difference]: Start difference. First operand 729 states and 1065 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:55:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:35,762 INFO L93 Difference]: Finished difference Result 1997 states and 2769 transitions. [2025-02-05 17:55:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:55:35,763 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:55:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:35,769 INFO L225 Difference]: With dead ends: 1997 [2025-02-05 17:55:35,770 INFO L226 Difference]: Without dead ends: 1701 [2025-02-05 17:55:35,771 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:55:35,771 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 3393 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3407 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:35,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3407 Valid, 2089 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:55:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2025-02-05 17:55:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1647. [2025-02-05 17:55:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1364 states have (on average 1.3717008797653958) internal successors, (1871), 1387 states have internal predecessors, (1871), 151 states have call successors, (151), 111 states have call predecessors, (151), 130 states have return successors, (189), 151 states have call predecessors, (189), 149 states have call successors, (189) [2025-02-05 17:55:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2211 transitions. [2025-02-05 17:55:35,957 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2211 transitions. Word has length 65 [2025-02-05 17:55:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:35,957 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2211 transitions. [2025-02-05 17:55:35,957 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:55:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2211 transitions. [2025-02-05 17:55:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:35,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:35,958 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:55:35,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:55:35,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:35,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:35,963 INFO L85 PathProgramCache]: Analyzing trace with hash -612637219, now seen corresponding path program 1 times [2025-02-05 17:55:35,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:35,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984036099] [2025-02-05 17:55:35,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:35,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:35,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:35,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:35,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:35,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:36,042 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:55:36,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:36,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984036099] [2025-02-05 17:55:36,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984036099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:36,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:36,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119538152] [2025-02-05 17:55:36,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:36,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:36,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:36,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:36,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:36,043 INFO L87 Difference]: Start difference. First operand 1647 states and 2211 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:55:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:36,132 INFO L93 Difference]: Finished difference Result 2885 states and 3795 transitions. [2025-02-05 17:55:36,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:36,136 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:55:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:36,146 INFO L225 Difference]: With dead ends: 2885 [2025-02-05 17:55:36,147 INFO L226 Difference]: Without dead ends: 1677 [2025-02-05 17:55:36,150 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:55:36,151 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 0 mSDsluCounter, 3167 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3960 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:55:36,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3960 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2025-02-05 17:55:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1677. [2025-02-05 17:55:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1388 states have (on average 1.3595100864553313) internal successors, (1887), 1411 states have internal predecessors, (1887), 151 states have call successors, (151), 111 states have call predecessors, (151), 136 states have return successors, (195), 157 states have call predecessors, (195), 149 states have call successors, (195) [2025-02-05 17:55:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2233 transitions. [2025-02-05 17:55:36,249 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2233 transitions. Word has length 66 [2025-02-05 17:55:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:36,251 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2233 transitions. [2025-02-05 17:55:36,251 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:55:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2233 transitions. [2025-02-05 17:55:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:36,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:36,252 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:55:36,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:55:36,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:36,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:36,253 INFO L85 PathProgramCache]: Analyzing trace with hash -601321092, now seen corresponding path program 1 times [2025-02-05 17:55:36,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:36,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688820312] [2025-02-05 17:55:36,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:36,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:36,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:36,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:36,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:36,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:36,525 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:55:36,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:36,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688820312] [2025-02-05 17:55:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688820312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:36,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:36,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652333204] [2025-02-05 17:55:36,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:36,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:36,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:36,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:36,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:36,526 INFO L87 Difference]: Start difference. First operand 1677 states and 2233 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:55:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:37,368 INFO L93 Difference]: Finished difference Result 2909 states and 3736 transitions. [2025-02-05 17:55:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:55:37,368 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:55:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:37,376 INFO L225 Difference]: With dead ends: 2909 [2025-02-05 17:55:37,376 INFO L226 Difference]: Without dead ends: 1899 [2025-02-05 17:55:37,378 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:55:37,378 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 1150 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:37,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1708 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-02-05 17:55:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1618. [2025-02-05 17:55:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1345 states have (on average 1.3576208178438662) internal successors, (1826), 1363 states have internal predecessors, (1826), 145 states have call successors, (145), 106 states have call predecessors, (145), 126 states have return successors, (180), 150 states have call predecessors, (180), 143 states have call successors, (180) [2025-02-05 17:55:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2151 transitions. [2025-02-05 17:55:37,444 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2151 transitions. Word has length 66 [2025-02-05 17:55:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:37,444 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2151 transitions. [2025-02-05 17:55:37,444 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:55:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2151 transitions. [2025-02-05 17:55:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:37,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:37,445 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:55:37,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:55:37,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:37,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1616436861, now seen corresponding path program 1 times [2025-02-05 17:55:37,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:37,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633831740] [2025-02-05 17:55:37,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:37,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:37,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:37,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:37,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:37,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:37,499 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:55:37,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:37,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633831740] [2025-02-05 17:55:37,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633831740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:37,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:37,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:55:37,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743263569] [2025-02-05 17:55:37,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:37,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:55:37,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:37,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:55:37,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:55:37,505 INFO L87 Difference]: Start difference. First operand 1618 states and 2151 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:55:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:38,457 INFO L93 Difference]: Finished difference Result 3864 states and 4985 transitions. [2025-02-05 17:55:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:55:38,458 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:55:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:38,471 INFO L225 Difference]: With dead ends: 3864 [2025-02-05 17:55:38,472 INFO L226 Difference]: Without dead ends: 2686 [2025-02-05 17:55:38,475 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:55:38,476 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 1109 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:38,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 872 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:55:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-02-05 17:55:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2682. [2025-02-05 17:55:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2682 states, 2169 states have (on average 1.3005993545412633) internal successors, (2821), 2203 states have internal predecessors, (2821), 261 states have call successors, (261), 205 states have call predecessors, (261), 250 states have return successors, (368), 275 states have call predecessors, (368), 259 states have call successors, (368) [2025-02-05 17:55:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3450 transitions. [2025-02-05 17:55:38,615 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 3450 transitions. Word has length 66 [2025-02-05 17:55:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:38,615 INFO L471 AbstractCegarLoop]: Abstraction has 2682 states and 3450 transitions. [2025-02-05 17:55:38,615 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:55:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 3450 transitions. [2025-02-05 17:55:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:55:38,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:38,616 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:55:38,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:55:38,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:38,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1621614853, now seen corresponding path program 1 times [2025-02-05 17:55:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284083889] [2025-02-05 17:55:38,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:38,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:55:38,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:55:38,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:38,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:38,652 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:55:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:38,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284083889] [2025-02-05 17:55:38,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284083889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:38,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:38,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:38,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071270373] [2025-02-05 17:55:38,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:38,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:38,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:38,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:38,654 INFO L87 Difference]: Start difference. First operand 2682 states and 3450 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:55:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:38,808 INFO L93 Difference]: Finished difference Result 5781 states and 7314 transitions. [2025-02-05 17:55:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:38,808 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:55:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:38,824 INFO L225 Difference]: With dead ends: 5781 [2025-02-05 17:55:38,826 INFO L226 Difference]: Without dead ends: 3503 [2025-02-05 17:55:38,831 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:55:38,831 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 101 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1576 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:55:38,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1576 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2025-02-05 17:55:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3441. [2025-02-05 17:55:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 2757 states have (on average 1.2840043525571274) internal successors, (3540), 2796 states have internal predecessors, (3540), 345 states have call successors, (345), 278 states have call predecessors, (345), 337 states have return successors, (472), 368 states have call predecessors, (472), 343 states have call successors, (472) [2025-02-05 17:55:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4357 transitions. [2025-02-05 17:55:39,038 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4357 transitions. Word has length 67 [2025-02-05 17:55:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:39,038 INFO L471 AbstractCegarLoop]: Abstraction has 3441 states and 4357 transitions. [2025-02-05 17:55:39,039 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:55:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4357 transitions. [2025-02-05 17:55:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 17:55:39,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:39,039 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:55:39,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:55:39,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:39,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -447520233, now seen corresponding path program 1 times [2025-02-05 17:55:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:39,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99920079] [2025-02-05 17:55:39,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:39,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:39,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:55:39,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:55:39,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:39,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:39,071 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:55:39,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99920079] [2025-02-05 17:55:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99920079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:39,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177127380] [2025-02-05 17:55:39,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:39,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:39,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:39,072 INFO L87 Difference]: Start difference. First operand 3441 states and 4357 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:55:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:39,124 INFO L93 Difference]: Finished difference Result 3791 states and 4776 transitions. [2025-02-05 17:55:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:39,124 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:55:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:39,130 INFO L225 Difference]: With dead ends: 3791 [2025-02-05 17:55:39,130 INFO L226 Difference]: Without dead ends: 785 [2025-02-05 17:55:39,134 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:55:39,135 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 756 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 774 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:55:39,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 774 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-02-05 17:55:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 741. [2025-02-05 17:55:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 632 states have (on average 1.3955696202531647) internal successors, (882), 638 states have internal predecessors, (882), 67 states have call successors, (67), 37 states have call predecessors, (67), 40 states have return successors, (69), 67 states have call predecessors, (69), 65 states have call successors, (69) [2025-02-05 17:55:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1018 transitions. [2025-02-05 17:55:39,161 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1018 transitions. Word has length 73 [2025-02-05 17:55:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:39,162 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1018 transitions. [2025-02-05 17:55:39,162 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:55:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1018 transitions. [2025-02-05 17:55:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:55:39,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:39,163 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:55:39,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:55:39,163 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:39,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1299114373, now seen corresponding path program 1 times [2025-02-05 17:55:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:39,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564195819] [2025-02-05 17:55:39,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:39,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:55:39,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:55:39,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:39,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:39,242 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:55:39,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:39,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564195819] [2025-02-05 17:55:39,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564195819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:39,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:39,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:39,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806914900] [2025-02-05 17:55:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:39,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:39,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:39,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:39,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:39,244 INFO L87 Difference]: Start difference. First operand 741 states and 1018 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:55:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:40,165 INFO L93 Difference]: Finished difference Result 1342 states and 1695 transitions. [2025-02-05 17:55:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 17:55:40,166 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:55:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:40,170 INFO L225 Difference]: With dead ends: 1342 [2025-02-05 17:55:40,171 INFO L226 Difference]: Without dead ends: 978 [2025-02-05 17:55:40,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:55:40,172 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 656 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:40,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 2091 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:55:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-02-05 17:55:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 938. [2025-02-05 17:55:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 780 states have (on average 1.3397435897435896) internal successors, (1045), 787 states have internal predecessors, (1045), 91 states have call successors, (91), 58 states have call predecessors, (91), 65 states have return successors, (100), 94 states have call predecessors, (100), 89 states have call successors, (100) [2025-02-05 17:55:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1236 transitions. [2025-02-05 17:55:40,212 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1236 transitions. Word has length 84 [2025-02-05 17:55:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:40,213 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1236 transitions. [2025-02-05 17:55:40,213 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:55:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1236 transitions. [2025-02-05 17:55:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:55:40,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:40,215 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:40,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:55:40,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:40,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1675349065, now seen corresponding path program 1 times [2025-02-05 17:55:40,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:40,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65885403] [2025-02-05 17:55:40,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:40,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:55:40,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:55:40,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:40,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-05 17:55:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65885403] [2025-02-05 17:55:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65885403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:55:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479760465] [2025-02-05 17:55:40,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:40,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:55:40,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:55:40,354 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:55:40,370 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:55:40,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:55:40,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:55:40,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:40,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:40,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 17:55:40,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:55:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 17:55:40,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:55:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479760465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:40,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:55:40,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 17:55:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319655995] [2025-02-05 17:55:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:40,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:40,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:40,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:55:40,782 INFO L87 Difference]: Start difference. First operand 938 states and 1236 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 17:55:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:40,828 INFO L93 Difference]: Finished difference Result 1002 states and 1299 transitions. [2025-02-05 17:55:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:40,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-02-05 17:55:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:40,846 INFO L225 Difference]: With dead ends: 1002 [2025-02-05 17:55:40,848 INFO L226 Difference]: Without dead ends: 431 [2025-02-05 17:55:40,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:55:40,853 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 0 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:40,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3624 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-05 17:55:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-02-05 17:55:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 397 states have (on average 1.5390428211586902) internal successors, (611), 398 states have internal predecessors, (611), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 17:55:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 665 transitions. [2025-02-05 17:55:40,865 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 665 transitions. Word has length 145 [2025-02-05 17:55:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:40,865 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 665 transitions. [2025-02-05 17:55:40,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 17:55:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 665 transitions. [2025-02-05 17:55:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:40,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:40,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:40,879 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:41,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 17:55:41,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:41,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1768724028, now seen corresponding path program 1 times [2025-02-05 17:55:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:41,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021203781] [2025-02-05 17:55:41,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:41,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:41,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:41,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:41,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:41,197 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:55:41,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:41,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021203781] [2025-02-05 17:55:41,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021203781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:41,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41805053] [2025-02-05 17:55:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:41,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:41,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:41,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:41,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:41,199 INFO L87 Difference]: Start difference. First operand 431 states and 665 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:41,230 INFO L93 Difference]: Finished difference Result 852 states and 1315 transitions. [2025-02-05 17:55:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:41,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2025-02-05 17:55:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:41,233 INFO L225 Difference]: With dead ends: 852 [2025-02-05 17:55:41,234 INFO L226 Difference]: Without dead ends: 431 [2025-02-05 17:55:41,236 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:55:41,237 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 655 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 664 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:55:41,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 664 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-05 17:55:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-02-05 17:55:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 397 states have (on average 1.5365239294710327) internal successors, (610), 398 states have internal predecessors, (610), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 17:55:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 664 transitions. [2025-02-05 17:55:41,280 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 664 transitions. Word has length 189 [2025-02-05 17:55:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:41,280 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 664 transitions. [2025-02-05 17:55:41,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 664 transitions. [2025-02-05 17:55:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:41,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:41,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:41,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:55:41,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:41,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1543249891, now seen corresponding path program 1 times [2025-02-05 17:55:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513846284] [2025-02-05 17:55:41,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:41,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:41,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:41,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:41,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:41,341 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:55:41,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513846284] [2025-02-05 17:55:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513846284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:41,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:41,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770249917] [2025-02-05 17:55:41,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:41,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:41,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:41,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:41,347 INFO L87 Difference]: Start difference. First operand 431 states and 664 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:41,363 INFO L93 Difference]: Finished difference Result 844 states and 1298 transitions. [2025-02-05 17:55:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:41,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2025-02-05 17:55:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:41,366 INFO L225 Difference]: With dead ends: 844 [2025-02-05 17:55:41,366 INFO L226 Difference]: Without dead ends: 431 [2025-02-05 17:55:41,367 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:55:41,369 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 646 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 663 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:55:41,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 663 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-05 17:55:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-02-05 17:55:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 397 states have (on average 1.5340050377833754) internal successors, (609), 398 states have internal predecessors, (609), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 17:55:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 663 transitions. [2025-02-05 17:55:41,383 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 663 transitions. Word has length 189 [2025-02-05 17:55:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:41,383 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 663 transitions. [2025-02-05 17:55:41,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 663 transitions. [2025-02-05 17:55:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:41,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:41,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:41,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:55:41,386 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:41,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash -791700738, now seen corresponding path program 1 times [2025-02-05 17:55:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106587509] [2025-02-05 17:55:41,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:41,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:41,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:41,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:41,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:41,501 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:55:41,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:41,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106587509] [2025-02-05 17:55:41,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106587509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:41,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:41,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828319150] [2025-02-05 17:55:41,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:41,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:41,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:41,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:41,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:41,504 INFO L87 Difference]: Start difference. First operand 431 states and 663 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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:55:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:43,370 INFO L93 Difference]: Finished difference Result 1301 states and 2023 transitions. [2025-02-05 17:55:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:43,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:43,376 INFO L225 Difference]: With dead ends: 1301 [2025-02-05 17:55:43,376 INFO L226 Difference]: Without dead ends: 892 [2025-02-05 17:55:43,379 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:55:43,380 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 1263 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:43,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1867 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 17:55:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-02-05 17:55:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 861. [2025-02-05 17:55:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 798 states have (on average 1.5463659147869675) internal successors, (1234), 800 states have internal predecessors, (1234), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (50), 49 states have call predecessors, (50), 49 states have call successors, (50) [2025-02-05 17:55:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1333 transitions. [2025-02-05 17:55:43,411 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1333 transitions. Word has length 189 [2025-02-05 17:55:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:43,411 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1333 transitions. [2025-02-05 17:55:43,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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:55:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1333 transitions. [2025-02-05 17:55:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:43,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:43,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:43,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:55:43,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:43,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash 217613504, now seen corresponding path program 1 times [2025-02-05 17:55:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:43,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291584273] [2025-02-05 17:55:43,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:43,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:43,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:43,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:43,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:43,753 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:55:43,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:43,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291584273] [2025-02-05 17:55:43,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291584273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:43,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:43,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:43,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246610864] [2025-02-05 17:55:43,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:43,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:43,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:43,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:43,754 INFO L87 Difference]: Start difference. First operand 861 states and 1333 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:44,693 INFO L93 Difference]: Finished difference Result 2244 states and 3520 transitions. [2025-02-05 17:55:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:44,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:44,700 INFO L225 Difference]: With dead ends: 2244 [2025-02-05 17:55:44,700 INFO L226 Difference]: Without dead ends: 1405 [2025-02-05 17:55:44,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:55:44,703 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 1275 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 3649 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:44,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 3649 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:55:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2025-02-05 17:55:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1262. [2025-02-05 17:55:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1170 states have (on average 1.5393162393162394) internal successors, (1801), 1173 states have internal predecessors, (1801), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (75), 72 states have call predecessors, (75), 71 states have call successors, (75) [2025-02-05 17:55:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1947 transitions. [2025-02-05 17:55:44,737 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1947 transitions. Word has length 189 [2025-02-05 17:55:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:44,738 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1947 transitions. [2025-02-05 17:55:44,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1947 transitions. [2025-02-05 17:55:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:44,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:44,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:44,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:55:44,741 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:44,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash -644690657, now seen corresponding path program 1 times [2025-02-05 17:55:44,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:44,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050454232] [2025-02-05 17:55:44,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:44,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:44,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:44,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:44,892 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:55:44,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:44,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050454232] [2025-02-05 17:55:44,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050454232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:44,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:44,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:44,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360579453] [2025-02-05 17:55:44,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:44,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:44,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:44,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:44,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:44,895 INFO L87 Difference]: Start difference. First operand 1262 states and 1947 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:45,719 INFO L93 Difference]: Finished difference Result 3523 states and 5513 transitions. [2025-02-05 17:55:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:45,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:45,728 INFO L225 Difference]: With dead ends: 3523 [2025-02-05 17:55:45,728 INFO L226 Difference]: Without dead ends: 2283 [2025-02-05 17:55:45,730 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:55:45,731 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 1270 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:45,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 3633 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2025-02-05 17:55:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2117. [2025-02-05 17:55:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1965 states have (on average 1.5440203562340966) internal successors, (3034), 1972 states have internal predecessors, (3034), 115 states have call successors, (115), 30 states have call predecessors, (115), 36 states have return successors, (131), 118 states have call predecessors, (131), 115 states have call successors, (131) [2025-02-05 17:55:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3280 transitions. [2025-02-05 17:55:45,795 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3280 transitions. Word has length 189 [2025-02-05 17:55:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:45,795 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3280 transitions. [2025-02-05 17:55:45,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3280 transitions. [2025-02-05 17:55:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:45,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:45,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:45,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:55:45,798 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:45,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:45,799 INFO L85 PathProgramCache]: Analyzing trace with hash -395412256, now seen corresponding path program 1 times [2025-02-05 17:55:45,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:45,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731002162] [2025-02-05 17:55:45,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:45,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:45,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:45,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:45,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:45,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:45,931 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:55:45,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:45,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731002162] [2025-02-05 17:55:45,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731002162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:45,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:45,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:45,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563927338] [2025-02-05 17:55:45,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:45,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:45,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:45,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:45,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:45,933 INFO L87 Difference]: Start difference. First operand 2117 states and 3280 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:46,739 INFO L93 Difference]: Finished difference Result 6288 states and 9916 transitions. [2025-02-05 17:55:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:46,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:46,754 INFO L225 Difference]: With dead ends: 6288 [2025-02-05 17:55:46,754 INFO L226 Difference]: Without dead ends: 4193 [2025-02-05 17:55:46,762 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:55:46,762 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1265 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:46,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 3621 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2025-02-05 17:55:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 3980. [2025-02-05 17:55:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3702 states have (on average 1.5629389519178822) internal successors, (5786), 3723 states have internal predecessors, (5786), 203 states have call successors, (203), 54 states have call predecessors, (203), 74 states have return successors, (267), 210 states have call predecessors, (267), 203 states have call successors, (267) [2025-02-05 17:55:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 6256 transitions. [2025-02-05 17:55:46,874 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 6256 transitions. Word has length 189 [2025-02-05 17:55:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:46,874 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 6256 transitions. [2025-02-05 17:55:46,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 6256 transitions. [2025-02-05 17:55:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:46,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:46,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:46,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:55:46,878 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:46,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:46,879 INFO L85 PathProgramCache]: Analyzing trace with hash -110276353, now seen corresponding path program 1 times [2025-02-05 17:55:46,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:46,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956823041] [2025-02-05 17:55:46,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:46,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:46,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:46,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:46,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:46,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:47,011 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:55:47,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:47,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956823041] [2025-02-05 17:55:47,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956823041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:47,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:47,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232977502] [2025-02-05 17:55:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:47,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:47,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:47,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:47,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:47,013 INFO L87 Difference]: Start difference. First operand 3980 states and 6256 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:47,796 INFO L93 Difference]: Finished difference Result 12411 states and 19950 transitions. [2025-02-05 17:55:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:47,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:47,825 INFO L225 Difference]: With dead ends: 12411 [2025-02-05 17:55:47,825 INFO L226 Difference]: Without dead ends: 8453 [2025-02-05 17:55:47,835 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:55:47,836 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 1260 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:47,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 3609 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8453 states. [2025-02-05 17:55:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8453 to 8147. [2025-02-05 17:55:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8147 states, 7599 states have (on average 1.5941571259376233) internal successors, (12114), 7666 states have internal predecessors, (12114), 379 states have call successors, (379), 102 states have call predecessors, (379), 168 states have return successors, (635), 394 states have call predecessors, (635), 379 states have call successors, (635) [2025-02-05 17:55:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8147 states to 8147 states and 13128 transitions. [2025-02-05 17:55:48,069 INFO L78 Accepts]: Start accepts. Automaton has 8147 states and 13128 transitions. Word has length 189 [2025-02-05 17:55:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:48,069 INFO L471 AbstractCegarLoop]: Abstraction has 8147 states and 13128 transitions. [2025-02-05 17:55:48,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 8147 states and 13128 transitions. [2025-02-05 17:55:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:48,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:48,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:48,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:55:48,074 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 591658240, now seen corresponding path program 1 times [2025-02-05 17:55:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:48,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083323253] [2025-02-05 17:55:48,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:48,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:48,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:48,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:48,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:48,214 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:55:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083323253] [2025-02-05 17:55:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083323253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:48,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:48,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478090463] [2025-02-05 17:55:48,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:48,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:48,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:48,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:48,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:48,216 INFO L87 Difference]: Start difference. First operand 8147 states and 13128 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:55:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:48,720 INFO L93 Difference]: Finished difference Result 18264 states and 30247 transitions. [2025-02-05 17:55:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:48,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:48,746 INFO L225 Difference]: With dead ends: 18264 [2025-02-05 17:55:48,746 INFO L226 Difference]: Without dead ends: 10139 [2025-02-05 17:55:48,759 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:55:48,760 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 895 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:48,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1341 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10139 states. [2025-02-05 17:55:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10139 to 8147. [2025-02-05 17:55:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8147 states, 7599 states have (on average 1.591919989472299) internal successors, (12097), 7666 states have internal predecessors, (12097), 379 states have call successors, (379), 102 states have call predecessors, (379), 168 states have return successors, (635), 394 states have call predecessors, (635), 379 states have call successors, (635) [2025-02-05 17:55:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8147 states to 8147 states and 13111 transitions. [2025-02-05 17:55:49,096 INFO L78 Accepts]: Start accepts. Automaton has 8147 states and 13111 transitions. Word has length 189 [2025-02-05 17:55:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:49,096 INFO L471 AbstractCegarLoop]: Abstraction has 8147 states and 13111 transitions. [2025-02-05 17:55:49,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:55:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 8147 states and 13111 transitions. [2025-02-05 17:55:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:49,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:49,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:49,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:55:49,102 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:49,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 198659295, now seen corresponding path program 1 times [2025-02-05 17:55:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336690746] [2025-02-05 17:55:49,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:49,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:49,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:49,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:49,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:49,345 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:55:49,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:49,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336690746] [2025-02-05 17:55:49,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336690746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:49,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:49,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:49,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356383116] [2025-02-05 17:55:49,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:49,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:49,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:49,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:49,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:49,348 INFO L87 Difference]: Start difference. First operand 8147 states and 13111 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:55:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:49,906 INFO L93 Difference]: Finished difference Result 18181 states and 30047 transitions. [2025-02-05 17:55:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:49,935 INFO L225 Difference]: With dead ends: 18181 [2025-02-05 17:55:49,935 INFO L226 Difference]: Without dead ends: 10056 [2025-02-05 17:55:49,951 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:55:49,951 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 892 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:49,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1333 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10056 states. [2025-02-05 17:55:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10056 to 8147. [2025-02-05 17:55:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8147 states, 7599 states have (on average 1.5896828530069746) internal successors, (12080), 7666 states have internal predecessors, (12080), 379 states have call successors, (379), 102 states have call predecessors, (379), 168 states have return successors, (635), 394 states have call predecessors, (635), 379 states have call successors, (635) [2025-02-05 17:55:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8147 states to 8147 states and 13094 transitions. [2025-02-05 17:55:50,211 INFO L78 Accepts]: Start accepts. Automaton has 8147 states and 13094 transitions. Word has length 189 [2025-02-05 17:55:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:50,211 INFO L471 AbstractCegarLoop]: Abstraction has 8147 states and 13094 transitions. [2025-02-05 17:55:50,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:55:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 8147 states and 13094 transitions. [2025-02-05 17:55:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:50,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:50,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:50,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:55:50,215 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:50,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:50,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1615133408, now seen corresponding path program 1 times [2025-02-05 17:55:50,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:50,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998205199] [2025-02-05 17:55:50,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:50,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:50,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:50,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:50,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:50,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:50,304 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:55:50,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:50,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998205199] [2025-02-05 17:55:50,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998205199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:50,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:50,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:50,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765346453] [2025-02-05 17:55:50,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:50,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:50,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:50,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:50,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:50,307 INFO L87 Difference]: Start difference. First operand 8147 states and 13094 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:55:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:50,776 INFO L93 Difference]: Finished difference Result 18098 states and 29847 transitions. [2025-02-05 17:55:50,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:50,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:50,811 INFO L225 Difference]: With dead ends: 18098 [2025-02-05 17:55:50,811 INFO L226 Difference]: Without dead ends: 9973 [2025-02-05 17:55:50,827 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:55:50,829 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 889 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:50,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1325 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9973 states. [2025-02-05 17:55:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9973 to 8147. [2025-02-05 17:55:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8147 states, 7599 states have (on average 1.5874457165416502) internal successors, (12063), 7666 states have internal predecessors, (12063), 379 states have call successors, (379), 102 states have call predecessors, (379), 168 states have return successors, (635), 394 states have call predecessors, (635), 379 states have call successors, (635) [2025-02-05 17:55:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8147 states to 8147 states and 13077 transitions. [2025-02-05 17:55:51,105 INFO L78 Accepts]: Start accepts. Automaton has 8147 states and 13077 transitions. Word has length 189 [2025-02-05 17:55:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:51,105 INFO L471 AbstractCegarLoop]: Abstraction has 8147 states and 13077 transitions. [2025-02-05 17:55:51,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:55:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8147 states and 13077 transitions. [2025-02-05 17:55:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:51,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:51,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:51,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:55:51,109 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:51,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:51,110 INFO L85 PathProgramCache]: Analyzing trace with hash -565264193, now seen corresponding path program 1 times [2025-02-05 17:55:51,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:51,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355009926] [2025-02-05 17:55:51,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:51,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:51,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:51,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:51,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:51,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:51,221 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:55:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355009926] [2025-02-05 17:55:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355009926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:51,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:51,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:51,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250391422] [2025-02-05 17:55:51,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:51,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:51,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:51,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:51,222 INFO L87 Difference]: Start difference. First operand 8147 states and 13077 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:52,604 INFO L93 Difference]: Finished difference Result 26062 states and 42927 transitions. [2025-02-05 17:55:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:52,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:52,659 INFO L225 Difference]: With dead ends: 26062 [2025-02-05 17:55:52,660 INFO L226 Difference]: Without dead ends: 17937 [2025-02-05 17:55:52,685 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:55:52,686 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 1231 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 3540 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:52,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 3540 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17937 states. [2025-02-05 17:55:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17937 to 17507. [2025-02-05 17:55:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17507 states, 16365 states have (on average 1.6225481209899175) internal successors, (26553), 16578 states have internal predecessors, (26553), 731 states have call successors, (731), 198 states have call predecessors, (731), 410 states have return successors, (1755), 762 states have call predecessors, (1755), 731 states have call successors, (1755) [2025-02-05 17:55:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17507 states to 17507 states and 29039 transitions. [2025-02-05 17:55:53,292 INFO L78 Accepts]: Start accepts. Automaton has 17507 states and 29039 transitions. Word has length 189 [2025-02-05 17:55:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:53,293 INFO L471 AbstractCegarLoop]: Abstraction has 17507 states and 29039 transitions. [2025-02-05 17:55:53,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 17507 states and 29039 transitions. [2025-02-05 17:55:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:53,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:53,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:53,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 17:55:53,300 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:53,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:53,301 INFO L85 PathProgramCache]: Analyzing trace with hash -392850112, now seen corresponding path program 1 times [2025-02-05 17:55:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:53,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649610213] [2025-02-05 17:55:53,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:53,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:53,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:53,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:53,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:53,422 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:55:53,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:53,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649610213] [2025-02-05 17:55:53,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649610213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208203112] [2025-02-05 17:55:53,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:53,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:53,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:53,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:53,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:53,427 INFO L87 Difference]: Start difference. First operand 17507 states and 29039 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:55:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:54,273 INFO L93 Difference]: Finished difference Result 39892 states and 68199 transitions. [2025-02-05 17:55:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:54,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:54,337 INFO L225 Difference]: With dead ends: 39892 [2025-02-05 17:55:54,337 INFO L226 Difference]: Without dead ends: 22407 [2025-02-05 17:55:54,372 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:55:54,373 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 885 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:54,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1311 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22407 states. [2025-02-05 17:55:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22407 to 17507. [2025-02-05 17:55:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17507 states, 16365 states have (on average 1.620531622364803) internal successors, (26520), 16578 states have internal predecessors, (26520), 731 states have call successors, (731), 198 states have call predecessors, (731), 410 states have return successors, (1755), 762 states have call predecessors, (1755), 731 states have call successors, (1755) [2025-02-05 17:55:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17507 states to 17507 states and 29006 transitions. [2025-02-05 17:55:54,993 INFO L78 Accepts]: Start accepts. Automaton has 17507 states and 29006 transitions. Word has length 189 [2025-02-05 17:55:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:54,993 INFO L471 AbstractCegarLoop]: Abstraction has 17507 states and 29006 transitions. [2025-02-05 17:55:54,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:55:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 17507 states and 29006 transitions. [2025-02-05 17:55:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:54,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:54,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:54,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 17:55:54,999 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:55,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2049856353, now seen corresponding path program 1 times [2025-02-05 17:55:55,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:55,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102518115] [2025-02-05 17:55:55,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:55,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:55,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:55,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:55,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:55,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:55,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:55:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102518115] [2025-02-05 17:55:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102518115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:55,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:55,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737072823] [2025-02-05 17:55:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:55,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:55,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:55,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:55,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:55,101 INFO L87 Difference]: Start difference. First operand 17507 states and 29006 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:57,033 INFO L93 Difference]: Finished difference Result 57324 states and 98112 transitions. [2025-02-05 17:55:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:57,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:55:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:57,149 INFO L225 Difference]: With dead ends: 57324 [2025-02-05 17:55:57,149 INFO L226 Difference]: Without dead ends: 39839 [2025-02-05 17:55:57,201 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:55:57,202 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 1218 mSDsluCounter, 2656 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 3509 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:57,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 3509 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39839 states. [2025-02-05 17:55:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39839 to 39143. [2025-02-05 17:55:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39143 states, 36651 states have (on average 1.6588360481296553) internal successors, (60798), 37318 states have internal predecessors, (60798), 1435 states have call successors, (1435), 390 states have call predecessors, (1435), 1056 states have return successors, (5531), 1498 states have call predecessors, (5531), 1435 states have call successors, (5531) [2025-02-05 17:55:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39143 states to 39143 states and 67764 transitions. [2025-02-05 17:55:58,695 INFO L78 Accepts]: Start accepts. Automaton has 39143 states and 67764 transitions. Word has length 189 [2025-02-05 17:55:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:58,695 INFO L471 AbstractCegarLoop]: Abstraction has 39143 states and 67764 transitions. [2025-02-05 17:55:58,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:55:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 39143 states and 67764 transitions. [2025-02-05 17:55:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:55:58,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:58,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:58,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 17:55:58,704 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:58,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1360375136, now seen corresponding path program 1 times [2025-02-05 17:55:58,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:58,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473680809] [2025-02-05 17:55:58,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:58,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:58,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:55:58,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:55:58,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:58,803 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:55:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473680809] [2025-02-05 17:55:58,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473680809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:58,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:58,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:58,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366268808] [2025-02-05 17:55:58,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:58,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:58,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:58,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:58,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:58,805 INFO L87 Difference]: Start difference. First operand 39143 states and 67764 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:56:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:01,982 INFO L93 Difference]: Finished difference Result 131278 states and 237132 transitions. [2025-02-05 17:56:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:56:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:02,334 INFO L225 Difference]: With dead ends: 131278 [2025-02-05 17:56:02,335 INFO L226 Difference]: Without dead ends: 92157 [2025-02-05 17:56:02,587 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:56:02,588 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1213 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 3497 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:02,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 3497 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:56:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92157 states. [2025-02-05 17:56:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92157 to 90920. [2025-02-05 17:56:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90920 states, 85242 states have (on average 1.6995612491494803) internal successors, (144874), 87303 states have internal predecessors, (144874), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 2834 states have return successors, (19227), 2970 states have call predecessors, (19227), 2843 states have call successors, (19227) [2025-02-05 17:56:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90920 states to 90920 states and 166944 transitions. [2025-02-05 17:56:06,661 INFO L78 Accepts]: Start accepts. Automaton has 90920 states and 166944 transitions. Word has length 189 [2025-02-05 17:56:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:06,662 INFO L471 AbstractCegarLoop]: Abstraction has 90920 states and 166944 transitions. [2025-02-05 17:56:06,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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:56:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 90920 states and 166944 transitions. [2025-02-05 17:56:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:56:06,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:06,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:56:06,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 17:56:06,684 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:06,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1054740607, now seen corresponding path program 1 times [2025-02-05 17:56:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:06,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586381950] [2025-02-05 17:56:06,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:06,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:56:06,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:56:06,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:06,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:06,871 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:56:06,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:06,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586381950] [2025-02-05 17:56:06,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586381950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:06,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:06,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:56:06,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612900169] [2025-02-05 17:56:06,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:06,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:56:06,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:06,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:56:06,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:56:06,873 INFO L87 Difference]: Start difference. First operand 90920 states and 166944 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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:56:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:11,624 INFO L93 Difference]: Finished difference Result 219031 states and 418355 transitions. [2025-02-05 17:56:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:56:11,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 189 [2025-02-05 17:56:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:12,283 INFO L225 Difference]: With dead ends: 219031 [2025-02-05 17:56:12,283 INFO L226 Difference]: Without dead ends: 128133 [2025-02-05 17:56:12,566 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:56:12,566 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 880 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:12,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1291 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:56:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128133 states.