./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 9475964eaf3c99c585f18d5c2e0c0a26c1a8a589a644152df77fbb74995f4153 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:43:45,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:43:45,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:43:45,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:43:45,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:43:45,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:43:45,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:43:45,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:43:45,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:43:45,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:43:45,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:43:45,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:43:45,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:43:45,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:43:45,257 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:43:45,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:43:45,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:43:45,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:43:45,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:43:45,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:43:45,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:43:45,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:43:45,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:43:45,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:43:45,260 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:43:45,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:43:45,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:43:45,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:43:45,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:43:45,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:43:45,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:43:45,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:43:45,260 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 -> 9475964eaf3c99c585f18d5c2e0c0a26c1a8a589a644152df77fbb74995f4153 [2025-02-05 16:43:45,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:43:45,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:43:45,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:43:45,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:43:45,492 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:43:45,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:43:46,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/507b16f9b/b180d4bd22144e25af618ea3a5e383d9/FLAG2c6e097d6 [2025-02-05 16:43:46,998 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:43:46,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:43:47,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/507b16f9b/b180d4bd22144e25af618ea3a5e383d9/FLAG2c6e097d6 [2025-02-05 16:43:47,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/507b16f9b/b180d4bd22144e25af618ea3a5e383d9 [2025-02-05 16:43:47,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:43:47,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:43:47,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:43:47,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:43:47,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:43:47,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4803923b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47, skipping insertion in model container [2025-02-05 16:43:47,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:43:47,487 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6732,6745] [2025-02-05 16:43:47,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:43:47,517 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:43:47,543 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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6732,6745] [2025-02-05 16:43:47,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:43:47,566 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:43:47,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47 WrapperNode [2025-02-05 16:43:47,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:43:47,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:43:47,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:43:47,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:43:47,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,610 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 537 [2025-02-05 16:43:47,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:43:47,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:43:47,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:43:47,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:43:47,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,636 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 16:43:47,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:43:47,655 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:43:47,655 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:43:47,655 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:43:47,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (1/1) ... [2025-02-05 16:43:47,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:43:47,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:43:47,690 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 16:43:47,698 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 16:43:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:43:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:43:47,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:43:47,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:43:47,808 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:43:47,810 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:43:48,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:48,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L335: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:43:48,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L584: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:48,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:48,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:48,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:48,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: havoc main_~node6__m6~0#1; [2025-02-05 16:43:48,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: havoc main_~node5__m5~0#1; [2025-02-05 16:43:48,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:43:48,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L494: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:43:48,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node4__m4~0#1; [2025-02-05 16:43:48,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~node3__m3~0#1; [2025-02-05 16:43:48,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L233: havoc main_~node2__m2~0#1; [2025-02-05 16:43:48,167 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-02-05 16:43:48,167 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:43:48,177 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:43:48,178 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:43:48,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:43:48 BoogieIcfgContainer [2025-02-05 16:43:48,179 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:43:48,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:43:48,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:43:48,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:43:48,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:43:47" (1/3) ... [2025-02-05 16:43:48,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1e6928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:43:48, skipping insertion in model container [2025-02-05 16:43:48,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:47" (2/3) ... [2025-02-05 16:43:48,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1e6928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:43:48, skipping insertion in model container [2025-02-05 16:43:48,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:43:48" (3/3) ... [2025-02-05 16:43:48,187 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:43:48,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:43:48,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 118 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:43:48,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:43:48,250 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;@6a10546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:43:48,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:43:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 117 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:43:48,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:48,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:48,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:48,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash -283769924, now seen corresponding path program 1 times [2025-02-05 16:43:48,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:48,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858527891] [2025-02-05 16:43:48,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:48,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:48,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:43:48,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:43:48,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:48,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:48,698 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 16:43:48,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:48,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858527891] [2025-02-05 16:43:48,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858527891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:48,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:48,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073595293] [2025-02-05 16:43:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:48,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:48,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:48,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:48,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:48,720 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 117 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:48,767 INFO L93 Difference]: Finished difference Result 260 states and 422 transitions. [2025-02-05 16:43:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 16:43:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:48,774 INFO L225 Difference]: With dead ends: 260 [2025-02-05 16:43:48,774 INFO L226 Difference]: Without dead ends: 179 [2025-02-05 16:43:48,776 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 16:43:48,779 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 133 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:48,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 403 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-05 16:43:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2025-02-05 16:43:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2025-02-05 16:43:48,804 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 73 [2025-02-05 16:43:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:48,805 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2025-02-05 16:43:48,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2025-02-05 16:43:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:43:48,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:48,806 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] [2025-02-05 16:43:48,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:43:48,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:48,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1249178734, now seen corresponding path program 1 times [2025-02-05 16:43:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665484030] [2025-02-05 16:43:48,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:48,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:43:48,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:43:48,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:48,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:48,923 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 16:43:48,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:48,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665484030] [2025-02-05 16:43:48,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665484030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:48,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:48,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:48,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114768994] [2025-02-05 16:43:48,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:48,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:48,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:48,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:48,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:48,925 INFO L87 Difference]: Start difference. First operand 177 states and 256 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:48,945 INFO L93 Difference]: Finished difference Result 429 states and 656 transitions. [2025-02-05 16:43:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:48,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-02-05 16:43:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:48,947 INFO L225 Difference]: With dead ends: 429 [2025-02-05 16:43:48,947 INFO L226 Difference]: Without dead ends: 295 [2025-02-05 16:43:48,948 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 16:43:48,948 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 94 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:48,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-05 16:43:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2025-02-05 16:43:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 440 transitions. [2025-02-05 16:43:48,959 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 440 transitions. Word has length 74 [2025-02-05 16:43:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:48,959 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 440 transitions. [2025-02-05 16:43:48,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 440 transitions. [2025-02-05 16:43:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:43:48,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:48,961 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] [2025-02-05 16:43:48,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:43:48,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:48,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash -446595927, now seen corresponding path program 1 times [2025-02-05 16:43:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:48,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647413963] [2025-02-05 16:43:48,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:48,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:49,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:43:49,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:43:49,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:49,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:49,118 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 16:43:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:49,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647413963] [2025-02-05 16:43:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647413963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:49,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:49,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674960481] [2025-02-05 16:43:49,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:49,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:49,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:49,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:49,121 INFO L87 Difference]: Start difference. First operand 293 states and 440 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:49,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:49,150 INFO L93 Difference]: Finished difference Result 761 states and 1182 transitions. [2025-02-05 16:43:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:43:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:49,152 INFO L225 Difference]: With dead ends: 761 [2025-02-05 16:43:49,152 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 16:43:49,153 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 16:43:49,153 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 89 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:49,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 16:43:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 509. [2025-02-05 16:43:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 780 transitions. [2025-02-05 16:43:49,169 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 780 transitions. Word has length 75 [2025-02-05 16:43:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:49,169 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 780 transitions. [2025-02-05 16:43:49,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 780 transitions. [2025-02-05 16:43:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:43:49,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:49,171 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] [2025-02-05 16:43:49,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:43:49,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:49,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash -248788193, now seen corresponding path program 1 times [2025-02-05 16:43:49,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:49,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850806787] [2025-02-05 16:43:49,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:49,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:43:49,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:43:49,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:49,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:49,299 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 16:43:49,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:49,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850806787] [2025-02-05 16:43:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850806787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:49,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:49,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496878563] [2025-02-05 16:43:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:49,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:49,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:49,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:49,301 INFO L87 Difference]: Start difference. First operand 509 states and 780 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:49,328 INFO L93 Difference]: Finished difference Result 1377 states and 2150 transitions. [2025-02-05 16:43:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:49,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 16:43:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:49,332 INFO L225 Difference]: With dead ends: 1377 [2025-02-05 16:43:49,334 INFO L226 Difference]: Without dead ends: 911 [2025-02-05 16:43:49,336 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 16:43:49,337 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 84 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:49,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 336 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-02-05 16:43:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 909. [2025-02-05 16:43:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1404 transitions. [2025-02-05 16:43:49,413 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1404 transitions. Word has length 76 [2025-02-05 16:43:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:49,414 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1404 transitions. [2025-02-05 16:43:49,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1404 transitions. [2025-02-05 16:43:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:43:49,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:49,417 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] [2025-02-05 16:43:49,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:43:49,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:49,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2054768278, now seen corresponding path program 1 times [2025-02-05 16:43:49,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:49,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535347371] [2025-02-05 16:43:49,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:49,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:43:49,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:43:49,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:49,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:49,506 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 16:43:49,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:49,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535347371] [2025-02-05 16:43:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535347371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:49,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334874814] [2025-02-05 16:43:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:49,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:49,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:49,508 INFO L87 Difference]: Start difference. First operand 909 states and 1404 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:49,530 INFO L93 Difference]: Finished difference Result 2513 states and 3918 transitions. [2025-02-05 16:43:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:49,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:43:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:49,537 INFO L225 Difference]: With dead ends: 2513 [2025-02-05 16:43:49,537 INFO L226 Difference]: Without dead ends: 1647 [2025-02-05 16:43:49,538 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 16:43:49,539 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 79 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:49,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 332 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-02-05 16:43:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1645. [2025-02-05 16:43:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2540 transitions. [2025-02-05 16:43:49,583 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2540 transitions. Word has length 77 [2025-02-05 16:43:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:49,584 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2540 transitions. [2025-02-05 16:43:49,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2540 transitions. [2025-02-05 16:43:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:43:49,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:49,586 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] [2025-02-05 16:43:49,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:43:49,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:49,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1058526124, now seen corresponding path program 1 times [2025-02-05 16:43:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188002160] [2025-02-05 16:43:49,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:49,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:43:49,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:43:49,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:49,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:49,774 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 16:43:49,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:49,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188002160] [2025-02-05 16:43:49,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188002160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:49,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:49,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:49,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447916620] [2025-02-05 16:43:49,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:49,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:49,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:49,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:49,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:49,777 INFO L87 Difference]: Start difference. First operand 1645 states and 2540 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:50,139 INFO L93 Difference]: Finished difference Result 20869 states and 32504 transitions. [2025-02-05 16:43:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:43:50,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:43:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:50,189 INFO L225 Difference]: With dead ends: 20869 [2025-02-05 16:43:50,189 INFO L226 Difference]: Without dead ends: 19267 [2025-02-05 16:43:50,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:43:50,193 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1508 mSDsluCounter, 3050 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 3203 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:50,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 3203 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:43:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19267 states. [2025-02-05 16:43:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19267 to 3245. [2025-02-05 16:43:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 3245 states and 4972 transitions. [2025-02-05 16:43:50,374 INFO L78 Accepts]: Start accepts. Automaton has 3245 states and 4972 transitions. Word has length 78 [2025-02-05 16:43:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:50,374 INFO L471 AbstractCegarLoop]: Abstraction has 3245 states and 4972 transitions. [2025-02-05 16:43:50,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3245 states and 4972 transitions. [2025-02-05 16:43:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:43:50,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:50,375 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] [2025-02-05 16:43:50,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:43:50,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:50,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash -624762443, now seen corresponding path program 1 times [2025-02-05 16:43:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:50,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615932778] [2025-02-05 16:43:50,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:50,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:43:50,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:43:50,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:50,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:50,477 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 16:43:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615932778] [2025-02-05 16:43:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615932778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:50,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923926670] [2025-02-05 16:43:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:50,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:50,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:50,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:50,478 INFO L87 Difference]: Start difference. First operand 3245 states and 4972 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:50,521 INFO L93 Difference]: Finished difference Result 9297 states and 14222 transitions. [2025-02-05 16:43:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:50,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:43:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:50,536 INFO L225 Difference]: With dead ends: 9297 [2025-02-05 16:43:50,536 INFO L226 Difference]: Without dead ends: 6095 [2025-02-05 16:43:50,538 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 16:43:50,539 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 69 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:50,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 261 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2025-02-05 16:43:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 6029. [2025-02-05 16:43:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6029 states, 6028 states have (on average 1.504313205043132) internal successors, (9068), 6028 states have internal predecessors, (9068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6029 states to 6029 states and 9068 transitions. [2025-02-05 16:43:50,638 INFO L78 Accepts]: Start accepts. Automaton has 6029 states and 9068 transitions. Word has length 80 [2025-02-05 16:43:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:50,638 INFO L471 AbstractCegarLoop]: Abstraction has 6029 states and 9068 transitions. [2025-02-05 16:43:50,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 6029 states and 9068 transitions. [2025-02-05 16:43:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:43:50,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:50,639 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] [2025-02-05 16:43:50,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:43:50,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -623600594, now seen corresponding path program 1 times [2025-02-05 16:43:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:50,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876086960] [2025-02-05 16:43:50,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:50,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:43:50,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:43:50,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:50,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:50,953 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 16:43:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876086960] [2025-02-05 16:43:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876086960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:50,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:50,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:50,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513020544] [2025-02-05 16:43:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:50,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:50,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:50,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:50,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:50,955 INFO L87 Difference]: Start difference. First operand 6029 states and 9068 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:51,233 INFO L93 Difference]: Finished difference Result 12017 states and 18094 transitions. [2025-02-05 16:43:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:43:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:51,251 INFO L225 Difference]: With dead ends: 12017 [2025-02-05 16:43:51,251 INFO L226 Difference]: Without dead ends: 6031 [2025-02-05 16:43:51,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:43:51,260 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 472 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:51,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 703 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:51,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2025-02-05 16:43:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 6029. [2025-02-05 16:43:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6029 states, 6028 states have (on average 1.493696084936961) internal successors, (9004), 6028 states have internal predecessors, (9004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6029 states to 6029 states and 9004 transitions. [2025-02-05 16:43:51,347 INFO L78 Accepts]: Start accepts. Automaton has 6029 states and 9004 transitions. Word has length 80 [2025-02-05 16:43:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:51,348 INFO L471 AbstractCegarLoop]: Abstraction has 6029 states and 9004 transitions. [2025-02-05 16:43:51,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6029 states and 9004 transitions. [2025-02-05 16:43:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:43:51,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:51,350 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] [2025-02-05 16:43:51,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:43:51,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:51,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2144173374, now seen corresponding path program 1 times [2025-02-05 16:43:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:51,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582277722] [2025-02-05 16:43:51,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:51,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:43:51,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:43:51,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:51,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:51,625 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 16:43:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582277722] [2025-02-05 16:43:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582277722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:51,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:51,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:43:51,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645329412] [2025-02-05 16:43:51,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:51,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:43:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:51,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:43:51,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:43:51,627 INFO L87 Difference]: Start difference. First operand 6029 states and 9004 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:51,675 INFO L93 Difference]: Finished difference Result 6159 states and 9197 transitions. [2025-02-05 16:43:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:43:51,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:43:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:51,682 INFO L225 Difference]: With dead ends: 6159 [2025-02-05 16:43:51,682 INFO L226 Difference]: Without dead ends: 6157 [2025-02-05 16:43:51,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:43:51,684 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:51,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 605 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6157 states. [2025-02-05 16:43:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6157 to 6157. [2025-02-05 16:43:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6157 states, 6156 states have (on average 1.4782326185834957) internal successors, (9100), 6156 states have internal predecessors, (9100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6157 states to 6157 states and 9100 transitions. [2025-02-05 16:43:51,787 INFO L78 Accepts]: Start accepts. Automaton has 6157 states and 9100 transitions. Word has length 81 [2025-02-05 16:43:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:51,787 INFO L471 AbstractCegarLoop]: Abstraction has 6157 states and 9100 transitions. [2025-02-05 16:43:51,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6157 states and 9100 transitions. [2025-02-05 16:43:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:43:51,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:51,788 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] [2025-02-05 16:43:51,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:43:51,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:51,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 33644467, now seen corresponding path program 1 times [2025-02-05 16:43:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:51,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412883149] [2025-02-05 16:43:51,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:51,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:43:51,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:43:51,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:51,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:51,850 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 16:43:51,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:51,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412883149] [2025-02-05 16:43:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412883149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:51,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:51,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:43:51,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551145351] [2025-02-05 16:43:51,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:51,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:43:51,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:51,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:43:51,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:43:51,852 INFO L87 Difference]: Start difference. First operand 6157 states and 9100 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:51,880 INFO L93 Difference]: Finished difference Result 12180 states and 18130 transitions. [2025-02-05 16:43:51,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:43:51,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:43:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:51,891 INFO L225 Difference]: With dead ends: 12180 [2025-02-05 16:43:51,891 INFO L226 Difference]: Without dead ends: 8849 [2025-02-05 16:43:51,895 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 16:43:51,896 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 101 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:51,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 356 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:43:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8849 states. [2025-02-05 16:43:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8849 to 8847. [2025-02-05 16:43:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8847 states, 8846 states have (on average 1.4738865023739542) internal successors, (13038), 8846 states have internal predecessors, (13038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 13038 transitions. [2025-02-05 16:43:52,019 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 13038 transitions. Word has length 81 [2025-02-05 16:43:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:52,019 INFO L471 AbstractCegarLoop]: Abstraction has 8847 states and 13038 transitions. [2025-02-05 16:43:52,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 13038 transitions. [2025-02-05 16:43:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:43:52,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:52,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:43:52,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:43:52,023 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:52,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2076925945, now seen corresponding path program 1 times [2025-02-05 16:43:52,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:52,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809718175] [2025-02-05 16:43:52,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:52,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:52,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:43:52,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:43:52,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:52,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:43:52,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:52,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809718175] [2025-02-05 16:43:52,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809718175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:52,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:52,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:52,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944290501] [2025-02-05 16:43:52,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:52,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:52,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:52,190 INFO L87 Difference]: Start difference. First operand 8847 states and 13038 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:52,472 INFO L93 Difference]: Finished difference Result 63293 states and 93333 transitions. [2025-02-05 16:43:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-02-05 16:43:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:52,553 INFO L225 Difference]: With dead ends: 63293 [2025-02-05 16:43:52,554 INFO L226 Difference]: Without dead ends: 54491 [2025-02-05 16:43:52,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:52,573 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 1247 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:52,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 1439 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54491 states. [2025-02-05 16:43:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54491 to 17647. [2025-02-05 16:43:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17647 states, 17646 states have (on average 1.4696815142241868) internal successors, (25934), 17646 states have internal predecessors, (25934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17647 states to 17647 states and 25934 transitions. [2025-02-05 16:43:52,954 INFO L78 Accepts]: Start accepts. Automaton has 17647 states and 25934 transitions. Word has length 112 [2025-02-05 16:43:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:52,955 INFO L471 AbstractCegarLoop]: Abstraction has 17647 states and 25934 transitions. [2025-02-05 16:43:52,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 17647 states and 25934 transitions. [2025-02-05 16:43:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:43:52,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:52,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:43:52,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:43:52,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:52,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1535391545, now seen corresponding path program 1 times [2025-02-05 16:43:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:52,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827742239] [2025-02-05 16:43:52,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:52,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:52,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:43:52,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:43:52,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:52,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:43:53,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:53,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827742239] [2025-02-05 16:43:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827742239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508493743] [2025-02-05 16:43:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:53,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:53,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:53,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:53,199 INFO L87 Difference]: Start difference. First operand 17647 states and 25934 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:53,459 INFO L93 Difference]: Finished difference Result 72093 states and 106229 transitions. [2025-02-05 16:43:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:53,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-02-05 16:43:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:53,551 INFO L225 Difference]: With dead ends: 72093 [2025-02-05 16:43:53,551 INFO L226 Difference]: Without dead ends: 63291 [2025-02-05 16:43:53,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:53,576 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 1305 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:53,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 1405 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63291 states. [2025-02-05 16:43:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63291 to 30863. [2025-02-05 16:43:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30863 states, 30862 states have (on average 1.4645194737865337) internal successors, (45198), 30862 states have internal predecessors, (45198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30863 states to 30863 states and 45198 transitions. [2025-02-05 16:43:54,130 INFO L78 Accepts]: Start accepts. Automaton has 30863 states and 45198 transitions. Word has length 112 [2025-02-05 16:43:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:54,131 INFO L471 AbstractCegarLoop]: Abstraction has 30863 states and 45198 transitions. [2025-02-05 16:43:54,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 30863 states and 45198 transitions. [2025-02-05 16:43:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:43:54,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:54,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:43:54,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:43:54,135 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:54,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash -607855911, now seen corresponding path program 1 times [2025-02-05 16:43:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:54,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91310571] [2025-02-05 16:43:54,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:54,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:54,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:43:54,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:43:54,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:54,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:43:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91310571] [2025-02-05 16:43:54,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91310571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:54,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300221950] [2025-02-05 16:43:54,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:54,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:54,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:54,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:54,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:54,394 INFO L87 Difference]: Start difference. First operand 30863 states and 45198 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:54,645 INFO L93 Difference]: Finished difference Result 80893 states and 119125 transitions. [2025-02-05 16:43:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:54,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-02-05 16:43:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:54,731 INFO L225 Difference]: With dead ends: 80893 [2025-02-05 16:43:54,731 INFO L226 Difference]: Without dead ends: 72091 [2025-02-05 16:43:54,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:54,762 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 1390 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:54,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 1351 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72091 states. [2025-02-05 16:43:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72091 to 39663. [2025-02-05 16:43:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39663 states, 39662 states have (on average 1.4647269426655236) internal successors, (58094), 39662 states have internal predecessors, (58094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39663 states to 39663 states and 58094 transitions. [2025-02-05 16:43:55,534 INFO L78 Accepts]: Start accepts. Automaton has 39663 states and 58094 transitions. Word has length 112 [2025-02-05 16:43:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:55,536 INFO L471 AbstractCegarLoop]: Abstraction has 39663 states and 58094 transitions. [2025-02-05 16:43:55,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39663 states and 58094 transitions. [2025-02-05 16:43:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:43:55,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:55,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:43:55,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:43:55,545 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:55,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:55,550 INFO L85 PathProgramCache]: Analyzing trace with hash -400011655, now seen corresponding path program 1 times [2025-02-05 16:43:55,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:55,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544625495] [2025-02-05 16:43:55,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:55,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:43:55,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:43:55,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 16:43:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544625495] [2025-02-05 16:43:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544625495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:55,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125791409] [2025-02-05 16:43:55,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:55,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:55,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:55,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:55,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:55,739 INFO L87 Difference]: Start difference. First operand 39663 states and 58094 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:56,032 INFO L93 Difference]: Finished difference Result 89693 states and 132021 transitions. [2025-02-05 16:43:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:56,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-02-05 16:43:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:56,126 INFO L225 Difference]: With dead ends: 89693 [2025-02-05 16:43:56,126 INFO L226 Difference]: Without dead ends: 80891 [2025-02-05 16:43:56,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:56,160 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 1242 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:56,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 1459 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80891 states. [2025-02-05 16:43:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80891 to 48463. [2025-02-05 16:43:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48463 states, 48462 states have (on average 1.4648590648343032) internal successors, (70990), 48462 states have internal predecessors, (70990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48463 states to 48463 states and 70990 transitions. [2025-02-05 16:43:57,105 INFO L78 Accepts]: Start accepts. Automaton has 48463 states and 70990 transitions. Word has length 112 [2025-02-05 16:43:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:57,106 INFO L471 AbstractCegarLoop]: Abstraction has 48463 states and 70990 transitions. [2025-02-05 16:43:57,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 48463 states and 70990 transitions. [2025-02-05 16:43:57,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:43:57,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:57,120 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:43:57,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:43:57,120 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:57,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash -109157479, now seen corresponding path program 1 times [2025-02-05 16:43:57,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:57,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136865464] [2025-02-05 16:43:57,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:57,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:57,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:43:57,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:43:57,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:57,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:43:57,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136865464] [2025-02-05 16:43:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136865464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:57,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:57,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134755174] [2025-02-05 16:43:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:57,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:57,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:57,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:57,368 INFO L87 Difference]: Start difference. First operand 48463 states and 70990 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:58,028 INFO L93 Difference]: Finished difference Result 98493 states and 144917 transitions. [2025-02-05 16:43:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-02-05 16:43:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:58,234 INFO L225 Difference]: With dead ends: 98493 [2025-02-05 16:43:58,235 INFO L226 Difference]: Without dead ends: 89691 [2025-02-05 16:43:58,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:58,246 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 1156 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:58,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 1669 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89691 states. [2025-02-05 16:43:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89691 to 57263. [2025-02-05 16:43:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57263 states, 57262 states have (on average 1.4649505780447767) internal successors, (83886), 57262 states have internal predecessors, (83886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57263 states to 57263 states and 83886 transitions. [2025-02-05 16:43:58,871 INFO L78 Accepts]: Start accepts. Automaton has 57263 states and 83886 transitions. Word has length 112 [2025-02-05 16:43:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:58,871 INFO L471 AbstractCegarLoop]: Abstraction has 57263 states and 83886 transitions. [2025-02-05 16:43:58,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 57263 states and 83886 transitions. [2025-02-05 16:43:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 16:43:58,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:58,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:43:58,878 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:58,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -604433996, now seen corresponding path program 1 times [2025-02-05 16:43:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346975131] [2025-02-05 16:43:58,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:58,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 16:43:58,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 16:43:58,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:58,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:43:59,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:59,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346975131] [2025-02-05 16:43:59,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346975131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:59,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:59,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462830067] [2025-02-05 16:43:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:59,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:59,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:59,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:59,235 INFO L87 Difference]: Start difference. First operand 57263 states and 83886 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:59,574 INFO L93 Difference]: Finished difference Result 101725 states and 149749 transitions. [2025-02-05 16:43:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:59,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-02-05 16:43:59,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:59,872 INFO L225 Difference]: With dead ends: 101725 [2025-02-05 16:43:59,873 INFO L226 Difference]: Without dead ends: 95707 [2025-02-05 16:43:59,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:59,899 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 1233 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:59,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 1728 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:59,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95707 states. [2025-02-05 16:44:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95707 to 63279. [2025-02-05 16:44:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63279 states, 63278 states have (on average 1.4662599955750815) internal successors, (92782), 63278 states have internal predecessors, (92782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63279 states to 63279 states and 92782 transitions. [2025-02-05 16:44:00,693 INFO L78 Accepts]: Start accepts. Automaton has 63279 states and 92782 transitions. Word has length 113 [2025-02-05 16:44:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:00,693 INFO L471 AbstractCegarLoop]: Abstraction has 63279 states and 92782 transitions. [2025-02-05 16:44:00,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 63279 states and 92782 transitions. [2025-02-05 16:44:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:44:00,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:00,698 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:44:00,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:44:00,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:00,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash -533396875, now seen corresponding path program 1 times [2025-02-05 16:44:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:00,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109186430] [2025-02-05 16:44:00,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:00,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:44:00,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:44:00,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:00,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109186430] [2025-02-05 16:44:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109186430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:00,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:00,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513297031] [2025-02-05 16:44:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:00,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:00,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:00,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:00,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:00,773 INFO L87 Difference]: Start difference. First operand 63279 states and 92782 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:01,243 INFO L93 Difference]: Finished difference Result 108447 states and 159561 transitions. [2025-02-05 16:44:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:01,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-02-05 16:44:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:01,299 INFO L225 Difference]: With dead ends: 108447 [2025-02-05 16:44:01,299 INFO L226 Difference]: Without dead ends: 45213 [2025-02-05 16:44:01,336 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 16:44:01,337 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 73 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:01,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 346 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45213 states. [2025-02-05 16:44:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45213 to 45211. [2025-02-05 16:44:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45211 states, 45210 states have (on average 1.467418712674187) internal successors, (66342), 45210 states have internal predecessors, (66342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45211 states to 45211 states and 66342 transitions. [2025-02-05 16:44:02,193 INFO L78 Accepts]: Start accepts. Automaton has 45211 states and 66342 transitions. Word has length 114 [2025-02-05 16:44:02,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:02,193 INFO L471 AbstractCegarLoop]: Abstraction has 45211 states and 66342 transitions. [2025-02-05 16:44:02,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 45211 states and 66342 transitions. [2025-02-05 16:44:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:44:02,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:02,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:02,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:44:02,197 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:02,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1039414891, now seen corresponding path program 1 times [2025-02-05 16:44:02,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:02,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939235858] [2025-02-05 16:44:02,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:02,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:44:02,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:44:02,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:02,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:02,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:02,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939235858] [2025-02-05 16:44:02,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939235858] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:44:02,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822259474] [2025-02-05 16:44:02,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:02,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:44:02,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:44:02,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:44:02,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:44:02,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:44:02,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:44:02,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:02,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:02,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 16:44:02,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:44:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:44:03,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:44:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:44:03,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822259474] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:44:03,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:44:03,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 4] total 19 [2025-02-05 16:44:03,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036713779] [2025-02-05 16:44:03,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:44:03,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:44:03,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:03,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:44:03,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:44:03,348 INFO L87 Difference]: Start difference. First operand 45211 states and 66342 transitions. Second operand has 19 states, 19 states have (on average 17.263157894736842) internal successors, (328), 19 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:07,317 INFO L93 Difference]: Finished difference Result 482337 states and 701123 transitions. [2025-02-05 16:44:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-02-05 16:44:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 17.263157894736842) internal successors, (328), 19 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-02-05 16:44:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:07,827 INFO L225 Difference]: With dead ends: 482337 [2025-02-05 16:44:07,827 INFO L226 Difference]: Without dead ends: 437173 [2025-02-05 16:44:08,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3344 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1558, Invalid=7754, Unknown=0, NotChecked=0, Total=9312 [2025-02-05 16:44:08,191 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 4764 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4764 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:08,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4764 Valid, 1725 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1926 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:44:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437173 states. [2025-02-05 16:44:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437173 to 339484. [2025-02-05 16:44:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339484 states, 339483 states have (on average 1.419599803230206) internal successors, (481930), 339483 states have internal predecessors, (481930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339484 states to 339484 states and 481930 transitions. [2025-02-05 16:44:13,082 INFO L78 Accepts]: Start accepts. Automaton has 339484 states and 481930 transitions. Word has length 114 [2025-02-05 16:44:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:13,083 INFO L471 AbstractCegarLoop]: Abstraction has 339484 states and 481930 transitions. [2025-02-05 16:44:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 17.263157894736842) internal successors, (328), 19 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 339484 states and 481930 transitions. [2025-02-05 16:44:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:44:13,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:13,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:13,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:44:13,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 16:44:13,294 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:13,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:13,294 INFO L85 PathProgramCache]: Analyzing trace with hash 201611824, now seen corresponding path program 1 times [2025-02-05 16:44:13,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:13,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005736749] [2025-02-05 16:44:13,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:13,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:13,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:44:13,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:44:13,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:13,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005736749] [2025-02-05 16:44:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005736749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:44:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073916165] [2025-02-05 16:44:14,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:14,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:44:14,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:44:14,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:44:14,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:44:14,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:44:14,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:44:14,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:14,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:14,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:44:14,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:44:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:15,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:44:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:16,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073916165] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:44:16,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:44:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-02-05 16:44:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37552606] [2025-02-05 16:44:16,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:44:16,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:44:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:16,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:44:16,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:44:16,358 INFO L87 Difference]: Start difference. First operand 339484 states and 481930 transitions. Second operand has 30 states, 30 states have (on average 10.133333333333333) internal successors, (304), 30 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:40,097 INFO L93 Difference]: Finished difference Result 4016361 states and 5759283 transitions. [2025-02-05 16:44:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2025-02-05 16:44:40,098 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 10.133333333333333) internal successors, (304), 30 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-02-05 16:44:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:46,212 INFO L225 Difference]: With dead ends: 4016361 [2025-02-05 16:44:46,212 INFO L226 Difference]: Without dead ends: 3676935 [2025-02-05 16:44:46,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43781 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=12022, Invalid=89420, Unknown=0, NotChecked=0, Total=101442 [2025-02-05 16:44:46,992 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 16972 mSDsluCounter, 4091 mSDsCounter, 0 mSdLazyCounter, 5082 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16972 SdHoareTripleChecker+Valid, 4300 SdHoareTripleChecker+Invalid, 5195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 5082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:46,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16972 Valid, 4300 Invalid, 5195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 5082 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 16:44:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676935 states.