./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.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_1.cil-2+token_ring.09.cil-1.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 6d55d399b7f413c968459e57be858565c9c3a03797404fd2613513b79af9aeb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:53:22,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:53:22,924 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:53:22,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:53:22,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:53:22,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:53:22,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:53:22,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:53:22,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:53:22,947 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:53:22,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:53:22,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:53:22,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:53:22,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:53:22,947 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:53:22,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:53:22,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:53:22,947 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:53:22,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:53:22,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:53:22,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:53:22,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:53:22,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:53:22,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:53:22,948 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:53:22,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:53:22,948 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:53:22,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:53:22,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:53:22,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:53:22,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:53:22,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:53:22,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:53:22,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:53:22,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:53:22,949 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:53:22,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:53:22,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:53:22,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:53:22,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:53:22,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:53:22,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:53:22,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:53:22,950 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 -> 6d55d399b7f413c968459e57be858565c9c3a03797404fd2613513b79af9aeb3 [2025-02-05 17:53:23,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:53:23,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:53:23,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:53:23,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:53:23,217 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:53:23,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c [2025-02-05 17:53:24,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13e29f04f/7dfd73047d8841988b47b46961d0add0/FLAG9c6f0258c [2025-02-05 17:53:24,691 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:53:24,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-1.c [2025-02-05 17:53:24,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13e29f04f/7dfd73047d8841988b47b46961d0add0/FLAG9c6f0258c [2025-02-05 17:53:24,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13e29f04f/7dfd73047d8841988b47b46961d0add0 [2025-02-05 17:53:24,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:53:24,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:53:24,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:53:24,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:53:24,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:53:24,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:53:24" (1/1) ... [2025-02-05 17:53:24,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f46f020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:24, skipping insertion in model container [2025-02-05 17:53:24,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:53:24" (1/1) ... [2025-02-05 17:53:24,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:53:25,094 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_1.cil-2+token_ring.09.cil-1.c[913,926] [2025-02-05 17:53:25,129 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_1.cil-2+token_ring.09.cil-1.c[5977,5990] [2025-02-05 17:53:25,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:53:25,241 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:53:25,250 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_1.cil-2+token_ring.09.cil-1.c[913,926] [2025-02-05 17:53:25,265 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_1.cil-2+token_ring.09.cil-1.c[5977,5990] [2025-02-05 17:53:25,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:53:25,335 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:53:25,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25 WrapperNode [2025-02-05 17:53:25,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:53:25,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:53:25,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:53:25,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:53:25,342 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:53:25" (1/1) ... [2025-02-05 17:53:25,354 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:53:25" (1/1) ... [2025-02-05 17:53:25,396 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 855 [2025-02-05 17:53:25,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:53:25,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:53:25,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:53:25,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:53:25,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,431 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:53:25,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,441 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:53:25,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:53:25,457 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:53:25,457 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:53:25,457 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (1/1) ... [2025-02-05 17:53:25,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:53:25,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:53:25,481 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:53:25,484 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:53:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:53:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:53:25,501 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:53:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-02-05 17:53:25,501 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-02-05 17:53:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:53:25,502 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:53:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:53:25,502 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:53:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:53:25,502 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:53:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:53:25,502 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:53:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:53:25,502 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:53:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:53:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:53:25,503 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:53:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:53:25,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:53:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:53:25,503 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:53:25,613 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:53:25,614 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:53:26,205 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-02-05 17:53:26,205 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:53:26,243 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:53:26,244 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:53:26,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:53:26 BoogieIcfgContainer [2025-02-05 17:53:26,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:53:26,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:53:26,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:53:26,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:53:26,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:53:24" (1/3) ... [2025-02-05 17:53:26,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b5096e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:53:26, skipping insertion in model container [2025-02-05 17:53:26,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:53:25" (2/3) ... [2025-02-05 17:53:26,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b5096e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:53:26, skipping insertion in model container [2025-02-05 17:53:26,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:53:26" (3/3) ... [2025-02-05 17:53:26,251 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.09.cil-1.c [2025-02-05 17:53:26,261 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:53:26,263 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.09.cil-1.c that has 10 procedures, 401 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-02-05 17:53:26,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:53:26,342 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;@73454b5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:53:26,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:53:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 402 states, 360 states have (on average 1.5527777777777778) internal successors, (559), 366 states have internal predecessors, (559), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 17:53:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:53:26,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:26,354 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] [2025-02-05 17:53:26,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:26,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1449278362, now seen corresponding path program 1 times [2025-02-05 17:53:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:26,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900526525] [2025-02-05 17:53:26,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:26,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:53:26,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:53:26,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:26,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:26,515 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:53:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:26,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900526525] [2025-02-05 17:53:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900526525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:26,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:26,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:26,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932763329] [2025-02-05 17:53:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:26,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:26,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:26,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:26,534 INFO L87 Difference]: Start difference. First operand has 402 states, 360 states have (on average 1.5527777777777778) internal successors, (559), 366 states have internal predecessors, (559), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 17:53:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:26,587 INFO L93 Difference]: Finished difference Result 781 states and 1194 transitions. [2025-02-05 17:53:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:26,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-02-05 17:53:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:26,596 INFO L225 Difference]: With dead ends: 781 [2025-02-05 17:53:26,596 INFO L226 Difference]: Without dead ends: 391 [2025-02-05 17:53:26,599 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:53:26,601 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 95 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1090 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:53:26,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1090 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-05 17:53:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-02-05 17:53:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 352 states have (on average 1.5028409090909092) internal successors, (529), 355 states have internal predecessors, (529), 29 states have call successors, (29), 9 states have call predecessors, (29), 8 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 17:53:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 585 transitions. [2025-02-05 17:53:26,645 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 585 transitions. Word has length 44 [2025-02-05 17:53:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:26,646 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 585 transitions. [2025-02-05 17:53:26,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 17:53:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 585 transitions. [2025-02-05 17:53:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:53:26,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:26,647 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] [2025-02-05 17:53:26,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:53:26,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:26,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -526594779, now seen corresponding path program 1 times [2025-02-05 17:53:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766099402] [2025-02-05 17:53:26,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:26,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:26,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:53:26,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:53:26,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:26,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:26,708 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:53:26,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:26,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766099402] [2025-02-05 17:53:26,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766099402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:26,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273427348] [2025-02-05 17:53:26,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:26,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:26,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:26,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:26,710 INFO L87 Difference]: Start difference. First operand 391 states and 585 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:53:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:26,745 INFO L93 Difference]: Finished difference Result 513 states and 752 transitions. [2025-02-05 17:53:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:26,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-02-05 17:53:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:26,749 INFO L225 Difference]: With dead ends: 513 [2025-02-05 17:53:26,749 INFO L226 Difference]: Without dead ends: 449 [2025-02-05 17:53:26,749 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:53:26,750 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 562 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:26,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 676 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-05 17:53:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 442. [2025-02-05 17:53:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 398 states have (on average 1.4824120603015076) internal successors, (590), 401 states have internal predecessors, (590), 32 states have call successors, (32), 11 states have call predecessors, (32), 10 states have return successors, (34), 30 states have call predecessors, (34), 30 states have call successors, (34) [2025-02-05 17:53:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 656 transitions. [2025-02-05 17:53:26,771 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 656 transitions. Word has length 44 [2025-02-05 17:53:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:26,772 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 656 transitions. [2025-02-05 17:53:26,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:53:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 656 transitions. [2025-02-05 17:53:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 17:53:26,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:26,773 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] [2025-02-05 17:53:26,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:53:26,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:26,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:26,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1312727774, now seen corresponding path program 1 times [2025-02-05 17:53:26,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:26,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145845984] [2025-02-05 17:53:26,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:26,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 17:53:26,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 17:53:26,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:26,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:26,826 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:53:26,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:26,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145845984] [2025-02-05 17:53:26,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145845984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:26,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:26,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894511902] [2025-02-05 17:53:26,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:26,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:26,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:26,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:26,828 INFO L87 Difference]: Start difference. First operand 442 states and 656 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:53:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:26,890 INFO L93 Difference]: Finished difference Result 660 states and 959 transitions. [2025-02-05 17:53:26,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:26,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-02-05 17:53:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:26,893 INFO L225 Difference]: With dead ends: 660 [2025-02-05 17:53:26,894 INFO L226 Difference]: Without dead ends: 547 [2025-02-05 17:53:26,894 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:53:26,895 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 560 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:26,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 662 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-05 17:53:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 543. [2025-02-05 17:53:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 488 states have (on average 1.4508196721311475) internal successors, (708), 491 states have internal predecessors, (708), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (45), 37 states have call predecessors, (45), 37 states have call successors, (45) [2025-02-05 17:53:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 792 transitions. [2025-02-05 17:53:26,920 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 792 transitions. Word has length 45 [2025-02-05 17:53:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:26,920 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 792 transitions. [2025-02-05 17:53:26,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:53:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 792 transitions. [2025-02-05 17:53:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 17:53:26,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:26,922 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] [2025-02-05 17:53:26,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:53:26,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:26,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:26,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1921508417, now seen corresponding path program 1 times [2025-02-05 17:53:26,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:26,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405264213] [2025-02-05 17:53:26,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:26,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:26,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 17:53:26,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 17:53:26,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:26,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:26,966 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:53:26,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:26,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405264213] [2025-02-05 17:53:26,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405264213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:26,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:26,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:26,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576235906] [2025-02-05 17:53:26,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:26,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:26,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:26,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:26,967 INFO L87 Difference]: Start difference. First operand 543 states and 792 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:53:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:27,001 INFO L93 Difference]: Finished difference Result 927 states and 1307 transitions. [2025-02-05 17:53:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:27,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2025-02-05 17:53:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:27,005 INFO L225 Difference]: With dead ends: 927 [2025-02-05 17:53:27,005 INFO L226 Difference]: Without dead ends: 707 [2025-02-05 17:53:27,006 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:53:27,006 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 66 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:27,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1174 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-02-05 17:53:27,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 672. [2025-02-05 17:53:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 603 states have (on average 1.4212271973466004) internal successors, (857), 608 states have internal predecessors, (857), 47 states have call successors, (47), 21 states have call predecessors, (47), 20 states have return successors, (55), 43 states have call predecessors, (55), 45 states have call successors, (55) [2025-02-05 17:53:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 959 transitions. [2025-02-05 17:53:27,034 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 959 transitions. Word has length 46 [2025-02-05 17:53:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:27,034 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 959 transitions. [2025-02-05 17:53:27,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:53:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 959 transitions. [2025-02-05 17:53:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 17:53:27,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:27,037 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] [2025-02-05 17:53:27,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:53:27,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:27,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1516699, now seen corresponding path program 1 times [2025-02-05 17:53:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984099151] [2025-02-05 17:53:27,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:27,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:53:27,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:53:27,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:27,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:27,106 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:53:27,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:27,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984099151] [2025-02-05 17:53:27,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984099151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:27,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:27,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:27,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297451108] [2025-02-05 17:53:27,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:27,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:27,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:27,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:27,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:27,108 INFO L87 Difference]: Start difference. First operand 672 states and 959 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 17:53:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:27,144 INFO L93 Difference]: Finished difference Result 958 states and 1343 transitions. [2025-02-05 17:53:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:27,145 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-02-05 17:53:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:27,150 INFO L225 Difference]: With dead ends: 958 [2025-02-05 17:53:27,150 INFO L226 Difference]: Without dead ends: 733 [2025-02-05 17:53:27,151 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:53:27,152 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 54 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:27,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1218 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-02-05 17:53:27,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2025-02-05 17:53:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 656 states have (on average 1.396341463414634) internal successors, (916), 661 states have internal predecessors, (916), 52 states have call successors, (52), 24 states have call predecessors, (52), 23 states have return successors, (63), 48 states have call predecessors, (63), 50 states have call successors, (63) [2025-02-05 17:53:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1031 transitions. [2025-02-05 17:53:27,181 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1031 transitions. Word has length 63 [2025-02-05 17:53:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:27,181 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1031 transitions. [2025-02-05 17:53:27,181 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 17:53:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1031 transitions. [2025-02-05 17:53:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:53:27,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:27,184 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] [2025-02-05 17:53:27,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:53:27,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:27,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash 32243891, now seen corresponding path program 1 times [2025-02-05 17:53:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:27,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681020289] [2025-02-05 17:53:27,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:27,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:53:27,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:53:27,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:27,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 17:53:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681020289] [2025-02-05 17:53:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681020289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:27,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:27,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154198287] [2025-02-05 17:53:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:27,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:27,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:27,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:27,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:27,306 INFO L87 Difference]: Start difference. First operand 733 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 17:53:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:27,325 INFO L93 Difference]: Finished difference Result 782 states and 1091 transitions. [2025-02-05 17:53:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2025-02-05 17:53:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:27,327 INFO L225 Difference]: With dead ends: 782 [2025-02-05 17:53:27,328 INFO L226 Difference]: Without dead ends: 323 [2025-02-05 17:53:27,328 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:53:27,329 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 522 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:27,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 536 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-05 17:53:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-02-05 17:53:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 293 states have (on average 1.5255972696245734) internal successors, (447), 294 states have internal predecessors, (447), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 17:53:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 493 transitions. [2025-02-05 17:53:27,340 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 493 transitions. Word has length 68 [2025-02-05 17:53:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:27,340 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 493 transitions. [2025-02-05 17:53:27,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 17:53:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 493 transitions. [2025-02-05 17:53:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:27,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:27,341 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] [2025-02-05 17:53:27,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:53:27,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:27,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:27,342 INFO L85 PathProgramCache]: Analyzing trace with hash -988821003, now seen corresponding path program 1 times [2025-02-05 17:53:27,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:27,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113058491] [2025-02-05 17:53:27,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:27,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:27,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:27,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:27,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:27,410 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:53:27,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:27,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113058491] [2025-02-05 17:53:27,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113058491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:27,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780831068] [2025-02-05 17:53:27,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:27,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:27,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:27,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:27,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:27,412 INFO L87 Difference]: Start difference. First operand 323 states and 493 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:53:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:27,428 INFO L93 Difference]: Finished difference Result 634 states and 967 transitions. [2025-02-05 17:53:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:27,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:27,430 INFO L225 Difference]: With dead ends: 634 [2025-02-05 17:53:27,431 INFO L226 Difference]: Without dead ends: 323 [2025-02-05 17:53:27,431 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:53:27,432 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 481 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 492 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:53:27,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 492 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-05 17:53:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-02-05 17:53:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 293 states have (on average 1.522184300341297) internal successors, (446), 294 states have internal predecessors, (446), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 17:53:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 492 transitions. [2025-02-05 17:53:27,443 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 492 transitions. Word has length 145 [2025-02-05 17:53:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:27,444 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 492 transitions. [2025-02-05 17:53:27,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:53:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 492 transitions. [2025-02-05 17:53:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:27,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:27,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:53:27,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:27,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:27,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1133230698, now seen corresponding path program 1 times [2025-02-05 17:53:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:27,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693118467] [2025-02-05 17:53:27,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:27,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:27,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:27,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:27,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:27,589 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:53:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:27,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693118467] [2025-02-05 17:53:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693118467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:27,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:27,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245612559] [2025-02-05 17:53:27,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:27,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:27,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:27,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:27,591 INFO L87 Difference]: Start difference. First operand 323 states and 492 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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:53:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:28,052 INFO L93 Difference]: Finished difference Result 969 states and 1492 transitions. [2025-02-05 17:53:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:53:28,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:28,056 INFO L225 Difference]: With dead ends: 969 [2025-02-05 17:53:28,056 INFO L226 Difference]: Without dead ends: 664 [2025-02-05 17:53:28,057 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:53:28,057 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 916 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:28,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 1374 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:53:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-02-05 17:53:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 641. [2025-02-05 17:53:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 586 states have (on average 1.5341296928327646) internal successors, (899), 588 states have internal predecessors, (899), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:53:28,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 982 transitions. [2025-02-05 17:53:28,078 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 982 transitions. Word has length 145 [2025-02-05 17:53:28,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:28,079 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 982 transitions. [2025-02-05 17:53:28,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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:53:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 982 transitions. [2025-02-05 17:53:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:28,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:28,080 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] [2025-02-05 17:53:28,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:53:28,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:28,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash -261728936, now seen corresponding path program 1 times [2025-02-05 17:53:28,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:28,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251468969] [2025-02-05 17:53:28,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:28,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:28,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:28,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:28,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:28,361 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:53:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251468969] [2025-02-05 17:53:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251468969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:28,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:28,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:28,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499879969] [2025-02-05 17:53:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:28,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:28,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:28,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:28,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:28,365 INFO L87 Difference]: Start difference. First operand 641 states and 982 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:29,067 INFO L93 Difference]: Finished difference Result 1659 states and 2571 transitions. [2025-02-05 17:53:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:29,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:29,074 INFO L225 Difference]: With dead ends: 1659 [2025-02-05 17:53:29,074 INFO L226 Difference]: Without dead ends: 1036 [2025-02-05 17:53:29,076 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:53:29,077 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 917 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:29,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 2651 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-02-05 17:53:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 937. [2025-02-05 17:53:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 857 states have (on average 1.5262543757292881) internal successors, (1308), 860 states have internal predecessors, (1308), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-02-05 17:53:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1430 transitions. [2025-02-05 17:53:29,126 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1430 transitions. Word has length 145 [2025-02-05 17:53:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:29,126 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1430 transitions. [2025-02-05 17:53:29,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1430 transitions. [2025-02-05 17:53:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:29,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:29,127 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] [2025-02-05 17:53:29,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:53:29,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:29,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash 169187865, now seen corresponding path program 1 times [2025-02-05 17:53:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:29,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156825259] [2025-02-05 17:53:29,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:29,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:29,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:29,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:29,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:29,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:29,252 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:53:29,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:29,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156825259] [2025-02-05 17:53:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156825259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:29,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:29,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:29,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195087165] [2025-02-05 17:53:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:29,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:29,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:29,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:29,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:29,254 INFO L87 Difference]: Start difference. First operand 937 states and 1430 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:29,883 INFO L93 Difference]: Finished difference Result 2596 states and 4012 transitions. [2025-02-05 17:53:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:29,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:29,889 INFO L225 Difference]: With dead ends: 2596 [2025-02-05 17:53:29,889 INFO L226 Difference]: Without dead ends: 1677 [2025-02-05 17:53:29,891 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:53:29,891 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 912 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:29,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 2635 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:53:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2025-02-05 17:53:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1564. [2025-02-05 17:53:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1432 states have (on average 1.5286312849162011) internal successors, (2189), 1439 states have internal predecessors, (2189), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-02-05 17:53:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2395 transitions. [2025-02-05 17:53:29,948 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2395 transitions. Word has length 145 [2025-02-05 17:53:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:29,948 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2395 transitions. [2025-02-05 17:53:29,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2395 transitions. [2025-02-05 17:53:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:29,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:29,950 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] [2025-02-05 17:53:29,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:53:29,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:29,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1291467064, now seen corresponding path program 1 times [2025-02-05 17:53:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261266113] [2025-02-05 17:53:29,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:29,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:29,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:29,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:29,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:30,083 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:53:30,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:30,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261266113] [2025-02-05 17:53:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261266113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:30,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:30,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:30,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015858111] [2025-02-05 17:53:30,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:30,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:30,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:30,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:30,084 INFO L87 Difference]: Start difference. First operand 1564 states and 2395 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:30,745 INFO L93 Difference]: Finished difference Result 4605 states and 7167 transitions. [2025-02-05 17:53:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:30,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:30,771 INFO L225 Difference]: With dead ends: 4605 [2025-02-05 17:53:30,771 INFO L226 Difference]: Without dead ends: 3059 [2025-02-05 17:53:30,783 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:53:30,784 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 907 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:30,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 2623 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:53:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2025-02-05 17:53:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2917. [2025-02-05 17:53:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2675 states have (on average 1.543551401869159) internal successors, (4129), 2696 states have internal predecessors, (4129), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-02-05 17:53:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4527 transitions. [2025-02-05 17:53:30,986 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4527 transitions. Word has length 145 [2025-02-05 17:53:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:30,986 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 4527 transitions. [2025-02-05 17:53:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4527 transitions. [2025-02-05 17:53:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:30,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:30,989 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] [2025-02-05 17:53:30,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:53:30,989 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash -611993031, now seen corresponding path program 1 times [2025-02-05 17:53:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415765019] [2025-02-05 17:53:30,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:30,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:31,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:31,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:31,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:31,107 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:53:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415765019] [2025-02-05 17:53:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415765019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506740706] [2025-02-05 17:53:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:31,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:31,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:31,109 INFO L87 Difference]: Start difference. First operand 2917 states and 4527 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:53:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:31,620 INFO L93 Difference]: Finished difference Result 6280 states and 9950 transitions. [2025-02-05 17:53:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:31,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:31,635 INFO L225 Difference]: With dead ends: 6280 [2025-02-05 17:53:31,635 INFO L226 Difference]: Without dead ends: 3381 [2025-02-05 17:53:31,642 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:53:31,643 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 652 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:31,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 976 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:53:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2025-02-05 17:53:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 2917. [2025-02-05 17:53:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2675 states have (on average 1.5401869158878505) internal successors, (4120), 2696 states have internal predecessors, (4120), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-02-05 17:53:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4518 transitions. [2025-02-05 17:53:31,750 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4518 transitions. Word has length 145 [2025-02-05 17:53:31,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:31,750 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 4518 transitions. [2025-02-05 17:53:31,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:53:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4518 transitions. [2025-02-05 17:53:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:31,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:31,754 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] [2025-02-05 17:53:31,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:53:31,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:31,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:31,754 INFO L85 PathProgramCache]: Analyzing trace with hash 989173016, now seen corresponding path program 1 times [2025-02-05 17:53:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481608371] [2025-02-05 17:53:31,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:31,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:31,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:31,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:31,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:31,854 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:53:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:31,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481608371] [2025-02-05 17:53:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481608371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248416405] [2025-02-05 17:53:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:31,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:31,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:31,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:31,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:31,856 INFO L87 Difference]: Start difference. First operand 2917 states and 4518 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:53:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:32,180 INFO L93 Difference]: Finished difference Result 6251 states and 9874 transitions. [2025-02-05 17:53:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:32,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:32,193 INFO L225 Difference]: With dead ends: 6251 [2025-02-05 17:53:32,193 INFO L226 Difference]: Without dead ends: 3352 [2025-02-05 17:53:32,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:32,199 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 649 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:32,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 968 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:53:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2025-02-05 17:53:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 2917. [2025-02-05 17:53:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2675 states have (on average 1.536822429906542) internal successors, (4111), 2696 states have internal predecessors, (4111), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-02-05 17:53:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4509 transitions. [2025-02-05 17:53:32,331 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4509 transitions. Word has length 145 [2025-02-05 17:53:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:32,332 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 4509 transitions. [2025-02-05 17:53:32,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:53:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4509 transitions. [2025-02-05 17:53:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:32,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:32,335 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] [2025-02-05 17:53:32,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:53:32,335 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:32,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash 348086873, now seen corresponding path program 1 times [2025-02-05 17:53:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:32,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887760295] [2025-02-05 17:53:32,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:32,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:32,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:32,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:32,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:32,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:32,432 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:53:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887760295] [2025-02-05 17:53:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887760295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:32,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:32,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:53:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747482931] [2025-02-05 17:53:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:32,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:53:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:32,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:53:32,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:53:32,434 INFO L87 Difference]: Start difference. First operand 2917 states and 4509 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:53:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:32,790 INFO L93 Difference]: Finished difference Result 6222 states and 9798 transitions. [2025-02-05 17:53:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:32,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:32,802 INFO L225 Difference]: With dead ends: 6222 [2025-02-05 17:53:32,802 INFO L226 Difference]: Without dead ends: 3323 [2025-02-05 17:53:32,808 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:53:32,808 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 646 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:32,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 960 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:53:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2025-02-05 17:53:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 2917. [2025-02-05 17:53:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2675 states have (on average 1.5334579439252336) internal successors, (4102), 2696 states have internal predecessors, (4102), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-02-05 17:53:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4500 transitions. [2025-02-05 17:53:32,925 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4500 transitions. Word has length 145 [2025-02-05 17:53:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:32,926 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 4500 transitions. [2025-02-05 17:53:32,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:53:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4500 transitions. [2025-02-05 17:53:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:32,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:32,928 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] [2025-02-05 17:53:32,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:53:32,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:32,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1574332664, now seen corresponding path program 1 times [2025-02-05 17:53:32,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:32,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734673814] [2025-02-05 17:53:32,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:32,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:32,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:32,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:32,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:32,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:33,093 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:53:33,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:33,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734673814] [2025-02-05 17:53:33,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734673814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:33,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:33,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:33,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360414998] [2025-02-05 17:53:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:33,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:33,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:33,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:33,096 INFO L87 Difference]: Start difference. First operand 2917 states and 4500 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:33,896 INFO L93 Difference]: Finished difference Result 8886 states and 13964 transitions. [2025-02-05 17:53:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:33,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:33,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:33,919 INFO L225 Difference]: With dead ends: 8886 [2025-02-05 17:53:33,920 INFO L226 Difference]: Without dead ends: 5987 [2025-02-05 17:53:33,925 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:53:33,925 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 878 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:33,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 2554 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2025-02-05 17:53:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 5821. [2025-02-05 17:53:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5821 states, 5341 states have (on average 1.5532671784310055) internal successors, (8296), 5408 states have internal predecessors, (8296), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:53:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5821 states to 5821 states and 9174 transitions. [2025-02-05 17:53:34,123 INFO L78 Accepts]: Start accepts. Automaton has 5821 states and 9174 transitions. Word has length 145 [2025-02-05 17:53:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:34,123 INFO L471 AbstractCegarLoop]: Abstraction has 5821 states and 9174 transitions. [2025-02-05 17:53:34,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5821 states and 9174 transitions. [2025-02-05 17:53:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:34,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:34,126 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] [2025-02-05 17:53:34,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:53:34,126 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:34,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:34,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1434152327, now seen corresponding path program 1 times [2025-02-05 17:53:34,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:34,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335475567] [2025-02-05 17:53:34,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:34,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:34,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:34,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:34,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:34,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:34,246 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:53:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335475567] [2025-02-05 17:53:34,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335475567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:34,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:34,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247376304] [2025-02-05 17:53:34,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:34,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:34,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:34,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:34,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:34,248 INFO L87 Difference]: Start difference. First operand 5821 states and 9174 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:35,157 INFO L93 Difference]: Finished difference Result 19292 states and 31077 transitions. [2025-02-05 17:53:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:35,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:35,206 INFO L225 Difference]: With dead ends: 19292 [2025-02-05 17:53:35,206 INFO L226 Difference]: Without dead ends: 13489 [2025-02-05 17:53:35,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:53:35,222 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1154 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:35,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 2515 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:53:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13489 states. [2025-02-05 17:53:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13489 to 12121. [2025-02-05 17:53:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12121 states, 11127 states have (on average 1.578322998112699) internal successors, (17562), 11340 states have internal predecessors, (17562), 583 states have call successors, (583), 198 states have call predecessors, (583), 410 states have return successors, (1607), 614 states have call predecessors, (1607), 583 states have call successors, (1607) [2025-02-05 17:53:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12121 states to 12121 states and 19752 transitions. [2025-02-05 17:53:35,829 INFO L78 Accepts]: Start accepts. Automaton has 12121 states and 19752 transitions. Word has length 145 [2025-02-05 17:53:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:35,829 INFO L471 AbstractCegarLoop]: Abstraction has 12121 states and 19752 transitions. [2025-02-05 17:53:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 12121 states and 19752 transitions. [2025-02-05 17:53:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:35,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:35,837 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] [2025-02-05 17:53:35,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:53:35,838 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:35,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1677797434, now seen corresponding path program 1 times [2025-02-05 17:53:35,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:35,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313621232] [2025-02-05 17:53:35,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:35,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:35,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:35,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:35,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:35,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:35,947 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:53:35,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:35,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313621232] [2025-02-05 17:53:35,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313621232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:35,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:35,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:35,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688785004] [2025-02-05 17:53:35,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:35,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:35,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:35,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:35,950 INFO L87 Difference]: Start difference. First operand 12121 states and 19752 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:37,259 INFO L93 Difference]: Finished difference Result 40704 states and 68501 transitions. [2025-02-05 17:53:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:37,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:37,367 INFO L225 Difference]: With dead ends: 40704 [2025-02-05 17:53:37,367 INFO L226 Difference]: Without dead ends: 28601 [2025-02-05 17:53:37,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:53:37,409 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 1118 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:37,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2499 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:53:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28601 states. [2025-02-05 17:53:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28601 to 26020. [2025-02-05 17:53:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26020 states, 23852 states have (on average 1.607831628374979) internal successors, (38350), 24519 states have internal predecessors, (38350), 1111 states have call successors, (1111), 390 states have call predecessors, (1111), 1056 states have return successors, (5207), 1174 states have call predecessors, (5207), 1111 states have call successors, (5207) [2025-02-05 17:53:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26020 states to 26020 states and 44668 transitions. [2025-02-05 17:53:38,717 INFO L78 Accepts]: Start accepts. Automaton has 26020 states and 44668 transitions. Word has length 145 [2025-02-05 17:53:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:38,717 INFO L471 AbstractCegarLoop]: Abstraction has 26020 states and 44668 transitions. [2025-02-05 17:53:38,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 26020 states and 44668 transitions. [2025-02-05 17:53:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:38,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:38,726 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] [2025-02-05 17:53:38,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:53:38,726 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:38,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash 531256921, now seen corresponding path program 1 times [2025-02-05 17:53:38,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:38,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795425359] [2025-02-05 17:53:38,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:38,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:38,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:38,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:38,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:38,838 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:53:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795425359] [2025-02-05 17:53:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795425359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:38,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:38,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087430278] [2025-02-05 17:53:38,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:38,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:38,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:38,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:38,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:38,840 INFO L87 Difference]: Start difference. First operand 26020 states and 44668 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:41,483 INFO L93 Difference]: Finished difference Result 88321 states and 159023 transitions. [2025-02-05 17:53:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:41,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:41,780 INFO L225 Difference]: With dead ends: 88321 [2025-02-05 17:53:41,780 INFO L226 Difference]: Without dead ends: 62319 [2025-02-05 17:53:41,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:53:41,870 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 1084 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:41,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 2491 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:53:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62319 states. [2025-02-05 17:53:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62319 to 58045. [2025-02-05 17:53:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58045 states, 53075 states have (on average 1.6377202072538861) internal successors, (86922), 55136 states have internal predecessors, (86922), 2135 states have call successors, (2135), 774 states have call predecessors, (2135), 2834 states have return successors, (18519), 2262 states have call predecessors, (18519), 2135 states have call successors, (18519) [2025-02-05 17:53:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58045 states to 58045 states and 107576 transitions. [2025-02-05 17:53:44,692 INFO L78 Accepts]: Start accepts. Automaton has 58045 states and 107576 transitions. Word has length 145 [2025-02-05 17:53:44,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:44,692 INFO L471 AbstractCegarLoop]: Abstraction has 58045 states and 107576 transitions. [2025-02-05 17:53:44,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 58045 states and 107576 transitions. [2025-02-05 17:53:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:53:44,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:44,709 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] [2025-02-05 17:53:44,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:53:44,710 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash -752654246, now seen corresponding path program 1 times [2025-02-05 17:53:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806302501] [2025-02-05 17:53:44,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:44,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:53:44,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:53:44,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:44,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:53:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:44,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806302501] [2025-02-05 17:53:44,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806302501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:44,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:44,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186876296] [2025-02-05 17:53:44,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:44,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:44,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:44,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:44,804 INFO L87 Difference]: Start difference. First operand 58045 states and 107576 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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:53:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:50,852 INFO L93 Difference]: Finished difference Result 198336 states and 394613 transitions. [2025-02-05 17:53:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:50,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-02-05 17:53:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:51,572 INFO L225 Difference]: With dead ends: 198336 [2025-02-05 17:53:51,572 INFO L226 Difference]: Without dead ends: 140309 [2025-02-05 17:53:51,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:53:51,780 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 1049 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:51,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 2479 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:53:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140309 states. [2025-02-05 17:53:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140309 to 132838. [2025-02-05 17:53:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132838 states, 120870 states have (on average 1.6660047985438902) internal successors, (201370), 127177 states have internal predecessors, (201370), 4119 states have call successors, (4119), 1542 states have call predecessors, (4119), 7848 states have return successors, (69655), 4374 states have call predecessors, (69655), 4119 states have call successors, (69655) [2025-02-05 17:54:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132838 states to 132838 states and 275144 transitions. [2025-02-05 17:54:00,223 INFO L78 Accepts]: Start accepts. Automaton has 132838 states and 275144 transitions. Word has length 145 [2025-02-05 17:54:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:00,223 INFO L471 AbstractCegarLoop]: Abstraction has 132838 states and 275144 transitions. [2025-02-05 17:54:00,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 132838 states and 275144 transitions. [2025-02-05 17:54:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:54:00,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:00,277 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] [2025-02-05 17:54:00,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:54:00,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:00,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash -516976071, now seen corresponding path program 1 times [2025-02-05 17:54:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124855552] [2025-02-05 17:54:00,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:00,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:54:00,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:54:00,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:00,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124855552] [2025-02-05 17:54:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124855552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:00,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:00,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928441400] [2025-02-05 17:54:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:00,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:00,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:00,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:00,385 INFO L87 Difference]: Start difference. First operand 132838 states and 275144 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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)