./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.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.8.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 e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:46:32,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:46:32,131 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:46:32,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:46:32,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:46:32,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:46:32,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:46:32,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:46:32,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:46:32,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:46:32,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:46:32,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:46:32,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:46:32,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:46:32,148 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:46:32,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:46:32,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:46:32,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:46:32,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:46:32,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:46:32,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:46:32,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:46:32,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:46:32,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:46:32,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:46:32,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:46:32,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:46:32,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:46:32,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:46:32,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:46:32,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:46:32,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:46:32,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:46:32,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:46:32,150 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 -> e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d [2025-02-05 16:46:32,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:46:32,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:46:32,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:46:32,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:46:32,346 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:46:32,347 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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:46:33,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c0aa820b/be77912da11e4d119b1f38e4f6481e4d/FLAGd4cad4142 [2025-02-05 16:46:33,730 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:46:33,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:46:33,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c0aa820b/be77912da11e4d119b1f38e4f6481e4d/FLAGd4cad4142 [2025-02-05 16:46:34,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c0aa820b/be77912da11e4d119b1f38e4f6481e4d [2025-02-05 16:46:34,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:46:34,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:46:34,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:46:34,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:46:34,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:46:34,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66582dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34, skipping insertion in model container [2025-02-05 16:46:34,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:46:34,241 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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2025-02-05 16:46:34,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:46:34,281 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:46:34,350 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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2025-02-05 16:46:34,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:46:34,370 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:46:34,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34 WrapperNode [2025-02-05 16:46:34,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:46:34,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:46:34,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:46:34,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:46:34,375 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:46:34" (1/1) ... [2025-02-05 16:46:34,382 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:46:34" (1/1) ... [2025-02-05 16:46:34,403 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 716 [2025-02-05 16:46:34,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:46:34,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:46:34,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:46:34,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:46:34,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,427 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:46:34,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:46:34,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:46:34,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:46:34,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:46:34,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (1/1) ... [2025-02-05 16:46:34,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:46:34,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:46:34,465 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:46:34,473 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:46:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:46:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:46:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:46:34,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:46:34,582 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:46:34,583 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:46:35,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:46:35,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node4__m4~0#1; [2025-02-05 16:46:35,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:46:35,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-02-05 16:46:35,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: havoc main_~node3__m3~0#1; [2025-02-05 16:46:35,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node2__m2~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc main_~node7____CPAchecker_TMP_0~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L688: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L508: havoc main_~node8____CPAchecker_TMP_0~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_~node8__m8~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node7__m7~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L363: havoc main_~node6__m6~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: havoc main_~node5__m5~0#1; [2025-02-05 16:46:35,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L778: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:46:35,068 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-02-05 16:46:35,068 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:46:35,080 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:46:35,083 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:46:35,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:46:35 BoogieIcfgContainer [2025-02-05 16:46:35,084 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:46:35,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:46:35,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:46:35,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:46:35,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:46:34" (1/3) ... [2025-02-05 16:46:35,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5409c828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:46:35, skipping insertion in model container [2025-02-05 16:46:35,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:46:34" (2/3) ... [2025-02-05 16:46:35,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5409c828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:46:35, skipping insertion in model container [2025-02-05 16:46:35,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:46:35" (3/3) ... [2025-02-05 16:46:35,098 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:46:35,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:46:35,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 159 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:46:35,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:46:35,166 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;@2f6a8033, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:46:35,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:46:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 157 states have (on average 1.7515923566878981) internal successors, (275), 158 states have internal predecessors, (275), 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:46:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:46:35,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:35,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:35,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:35,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash 881999085, now seen corresponding path program 1 times [2025-02-05 16:46:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:35,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165785738] [2025-02-05 16:46:35,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:35,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:35,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:46:35,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:46:35,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:35,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:35,548 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:46:35,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:35,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165785738] [2025-02-05 16:46:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165785738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:35,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:35,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759769862] [2025-02-05 16:46:35,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:35,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:35,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:35,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:35,568 INFO L87 Difference]: Start difference. First operand has 159 states, 157 states have (on average 1.7515923566878981) internal successors, (275), 158 states have internal predecessors, (275), 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 34.0) internal successors, (102), 3 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:46:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:35,637 INFO L93 Difference]: Finished difference Result 341 states and 560 transitions. [2025-02-05 16:46:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:35,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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 102 [2025-02-05 16:46:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:35,649 INFO L225 Difference]: With dead ends: 341 [2025-02-05 16:46:35,649 INFO L226 Difference]: Without dead ends: 240 [2025-02-05 16:46:35,651 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:46:35,657 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 186 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 541 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:46:35,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 541 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-05 16:46:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2025-02-05 16:46:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.4388185654008439) internal successors, (341), 237 states have internal predecessors, (341), 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:46:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 341 transitions. [2025-02-05 16:46:35,699 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 341 transitions. Word has length 102 [2025-02-05 16:46:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:35,700 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 341 transitions. [2025-02-05 16:46:35,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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:46:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 341 transitions. [2025-02-05 16:46:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:46:35,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:35,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:35,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:46:35,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:35,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1317820329, now seen corresponding path program 1 times [2025-02-05 16:46:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851944324] [2025-02-05 16:46:35,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:35,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:46:35,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:46:35,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:35,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:35,894 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:46:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851944324] [2025-02-05 16:46:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851944324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:35,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:35,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:35,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011683087] [2025-02-05 16:46:35,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:35,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:35,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:35,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:35,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:35,898 INFO L87 Difference]: Start difference. First operand 238 states and 341 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 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:46:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:35,930 INFO L93 Difference]: Finished difference Result 570 states and 869 transitions. [2025-02-05 16:46:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:35,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 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 103 [2025-02-05 16:46:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:35,933 INFO L225 Difference]: With dead ends: 570 [2025-02-05 16:46:35,933 INFO L226 Difference]: Without dead ends: 396 [2025-02-05 16:46:35,933 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:46:35,934 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 461 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:46:35,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-05 16:46:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2025-02-05 16:46:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.4987277353689568) internal successors, (589), 393 states have internal predecessors, (589), 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:46:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 589 transitions. [2025-02-05 16:46:35,946 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 589 transitions. Word has length 103 [2025-02-05 16:46:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:35,947 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 589 transitions. [2025-02-05 16:46:35,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 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:46:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 589 transitions. [2025-02-05 16:46:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:46:35,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:35,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:35,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:46:35,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:35,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash 271160730, now seen corresponding path program 1 times [2025-02-05 16:46:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243917857] [2025-02-05 16:46:35,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:35,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:46:35,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:46:35,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:35,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:36,088 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:46:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:36,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243917857] [2025-02-05 16:46:36,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243917857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:36,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:36,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388463874] [2025-02-05 16:46:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:36,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:36,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:36,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:36,094 INFO L87 Difference]: Start difference. First operand 394 states and 589 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:46:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:36,118 INFO L93 Difference]: Finished difference Result 1022 states and 1587 transitions. [2025-02-05 16:46:36,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:36,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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 104 [2025-02-05 16:46:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:36,121 INFO L225 Difference]: With dead ends: 1022 [2025-02-05 16:46:36,122 INFO L226 Difference]: Without dead ends: 692 [2025-02-05 16:46:36,122 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:46:36,123 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 121 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 457 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:46:36,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 457 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-02-05 16:46:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2025-02-05 16:46:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 1.5341074020319303) internal successors, (1057), 689 states have internal predecessors, (1057), 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:46:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1057 transitions. [2025-02-05 16:46:36,146 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1057 transitions. Word has length 104 [2025-02-05 16:46:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:36,146 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1057 transitions. [2025-02-05 16:46:36,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:46:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1057 transitions. [2025-02-05 16:46:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:46:36,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:36,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:36,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:46:36,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:36,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1226197642, now seen corresponding path program 1 times [2025-02-05 16:46:36,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:36,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42946481] [2025-02-05 16:46:36,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:36,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:36,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:46:36,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:46:36,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:36,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:36,280 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:46:36,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:36,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42946481] [2025-02-05 16:46:36,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42946481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:36,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:36,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:36,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389880308] [2025-02-05 16:46:36,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:36,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:36,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:36,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:36,282 INFO L87 Difference]: Start difference. First operand 690 states and 1057 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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:46:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:36,302 INFO L93 Difference]: Finished difference Result 1878 states and 2939 transitions. [2025-02-05 16:46:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:36,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 105 [2025-02-05 16:46:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:36,307 INFO L225 Difference]: With dead ends: 1878 [2025-02-05 16:46:36,307 INFO L226 Difference]: Without dead ends: 1252 [2025-02-05 16:46:36,308 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:46:36,308 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 116 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 453 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:46:36,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 453 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-02-05 16:46:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2025-02-05 16:46:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.5508406725380304) internal successors, (1937), 1249 states have internal predecessors, (1937), 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:46:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1937 transitions. [2025-02-05 16:46:36,335 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1937 transitions. Word has length 105 [2025-02-05 16:46:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:36,336 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1937 transitions. [2025-02-05 16:46:36,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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:46:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1937 transitions. [2025-02-05 16:46:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:46:36,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:36,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:36,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:46:36,337 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:36,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash 265817927, now seen corresponding path program 1 times [2025-02-05 16:46:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:36,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239851845] [2025-02-05 16:46:36,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:36,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:46:36,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:46:36,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:36,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:36,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:36,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239851845] [2025-02-05 16:46:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239851845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:36,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:36,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346076184] [2025-02-05 16:46:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:36,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:36,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:36,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:36,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:36,455 INFO L87 Difference]: Start difference. First operand 1250 states and 1937 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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:46:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:36,483 INFO L93 Difference]: Finished difference Result 3494 states and 5475 transitions. [2025-02-05 16:46:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:36,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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 106 [2025-02-05 16:46:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:36,492 INFO L225 Difference]: With dead ends: 3494 [2025-02-05 16:46:36,492 INFO L226 Difference]: Without dead ends: 2308 [2025-02-05 16:46:36,494 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:46:36,495 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 111 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 449 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:46:36,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 449 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2025-02-05 16:46:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2306. [2025-02-05 16:46:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.5553145336225596) internal successors, (3585), 2305 states have internal predecessors, (3585), 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:46:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3585 transitions. [2025-02-05 16:46:36,532 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3585 transitions. Word has length 106 [2025-02-05 16:46:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:36,532 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3585 transitions. [2025-02-05 16:46:36,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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:46:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3585 transitions. [2025-02-05 16:46:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 16:46:36,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:36,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:36,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:46:36,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:36,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash 361204803, now seen corresponding path program 1 times [2025-02-05 16:46:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382836485] [2025-02-05 16:46:36,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:36,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 16:46:36,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 16:46:36,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:36,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:36,635 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:46:36,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:36,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382836485] [2025-02-05 16:46:36,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382836485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:36,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:36,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:36,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179372882] [2025-02-05 16:46:36,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:36,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:36,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:36,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:36,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:36,637 INFO L87 Difference]: Start difference. First operand 2306 states and 3585 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:46:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:36,674 INFO L93 Difference]: Finished difference Result 6534 states and 10211 transitions. [2025-02-05 16:46:36,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:36,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 107 [2025-02-05 16:46:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:36,686 INFO L225 Difference]: With dead ends: 6534 [2025-02-05 16:46:36,687 INFO L226 Difference]: Without dead ends: 4292 [2025-02-05 16:46:36,690 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:46:36,694 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 106 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 445 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:46:36,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 445 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2025-02-05 16:46:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 4290. [2025-02-05 16:46:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4290 states, 4289 states have (on average 1.5521100489624622) internal successors, (6657), 4289 states have internal predecessors, (6657), 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:46:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 6657 transitions. [2025-02-05 16:46:36,816 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 6657 transitions. Word has length 107 [2025-02-05 16:46:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:36,817 INFO L471 AbstractCegarLoop]: Abstraction has 4290 states and 6657 transitions. [2025-02-05 16:46:36,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:46:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 6657 transitions. [2025-02-05 16:46:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:46:36,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:36,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:36,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:46:36,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:36,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash -510285324, now seen corresponding path program 1 times [2025-02-05 16:46:36,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:36,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753050779] [2025-02-05 16:46:36,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:36,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:46:36,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:46:36,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:36,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:36,928 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:46:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753050779] [2025-02-05 16:46:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753050779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:36,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:36,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960878592] [2025-02-05 16:46:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:36,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:36,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:36,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:36,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:36,930 INFO L87 Difference]: Start difference. First operand 4290 states and 6657 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:46:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:36,980 INFO L93 Difference]: Finished difference Result 12230 states and 19011 transitions. [2025-02-05 16:46:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:36,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 108 [2025-02-05 16:46:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:37,002 INFO L225 Difference]: With dead ends: 12230 [2025-02-05 16:46:37,003 INFO L226 Difference]: Without dead ends: 8004 [2025-02-05 16:46:37,008 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:46:37,009 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 101 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 441 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:46:37,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 441 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8004 states. [2025-02-05 16:46:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8004 to 8002. [2025-02-05 16:46:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8002 states, 8001 states have (on average 1.5439320084989376) internal successors, (12353), 8001 states have internal predecessors, (12353), 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:46:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8002 states to 8002 states and 12353 transitions. [2025-02-05 16:46:37,250 INFO L78 Accepts]: Start accepts. Automaton has 8002 states and 12353 transitions. Word has length 108 [2025-02-05 16:46:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:37,251 INFO L471 AbstractCegarLoop]: Abstraction has 8002 states and 12353 transitions. [2025-02-05 16:46:37,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:46:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8002 states and 12353 transitions. [2025-02-05 16:46:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:46:37,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:37,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:37,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:46:37,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:37,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1148724208, now seen corresponding path program 1 times [2025-02-05 16:46:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:37,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125962459] [2025-02-05 16:46:37,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:37,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:46:37,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:46:37,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:37,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:37,611 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:46:37,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125962459] [2025-02-05 16:46:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125962459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:37,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:37,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:37,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554670887] [2025-02-05 16:46:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:37,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:37,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:37,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:37,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:37,613 INFO L87 Difference]: Start difference. First operand 8002 states and 12353 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 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:46:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:38,365 INFO L93 Difference]: Finished difference Result 135010 states and 208977 transitions. [2025-02-05 16:46:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:46:38,366 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 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 109 [2025-02-05 16:46:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:38,638 INFO L225 Difference]: With dead ends: 135010 [2025-02-05 16:46:38,639 INFO L226 Difference]: Without dead ends: 127072 [2025-02-05 16:46:38,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:46:38,662 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 2641 mSDsluCounter, 6729 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2641 SdHoareTripleChecker+Valid, 6935 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:38,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2641 Valid, 6935 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127072 states. [2025-02-05 16:46:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127072 to 15938. [2025-02-05 16:46:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15938 states, 15937 states have (on average 1.5300872184225387) internal successors, (24385), 15937 states have internal predecessors, (24385), 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:46:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15938 states to 15938 states and 24385 transitions. [2025-02-05 16:46:39,802 INFO L78 Accepts]: Start accepts. Automaton has 15938 states and 24385 transitions. Word has length 109 [2025-02-05 16:46:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:39,802 INFO L471 AbstractCegarLoop]: Abstraction has 15938 states and 24385 transitions. [2025-02-05 16:46:39,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 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:46:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15938 states and 24385 transitions. [2025-02-05 16:46:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 16:46:39,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:39,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:39,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:46:39,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:39,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash -78487207, now seen corresponding path program 1 times [2025-02-05 16:46:39,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:39,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069468666] [2025-02-05 16:46:39,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:39,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 16:46:39,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 16:46:39,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:39,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:39,930 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:46:39,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069468666] [2025-02-05 16:46:39,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069468666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:39,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:39,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:39,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812144742] [2025-02-05 16:46:39,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:39,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:39,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:39,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:39,933 INFO L87 Difference]: Start difference. First operand 15938 states and 24385 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:46:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:40,020 INFO L93 Difference]: Finished difference Result 46278 states and 70595 transitions. [2025-02-05 16:46:40,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:40,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 111 [2025-02-05 16:46:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:40,053 INFO L225 Difference]: With dead ends: 46278 [2025-02-05 16:46:40,053 INFO L226 Difference]: Without dead ends: 30404 [2025-02-05 16:46:40,072 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:46:40,073 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 91 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 346 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:46:40,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 346 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30404 states. [2025-02-05 16:46:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30404 to 30146. [2025-02-05 16:46:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30146 states, 30145 states have (on average 1.505291093050257) internal successors, (45377), 30145 states have internal predecessors, (45377), 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:46:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30146 states to 30146 states and 45377 transitions. [2025-02-05 16:46:40,702 INFO L78 Accepts]: Start accepts. Automaton has 30146 states and 45377 transitions. Word has length 111 [2025-02-05 16:46:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:40,703 INFO L471 AbstractCegarLoop]: Abstraction has 30146 states and 45377 transitions. [2025-02-05 16:46:40,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:46:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 30146 states and 45377 transitions. [2025-02-05 16:46:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 16:46:40,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:40,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:40,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:46:40,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:40,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash -77325358, now seen corresponding path program 1 times [2025-02-05 16:46:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:40,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941809564] [2025-02-05 16:46:40,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:40,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:40,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 16:46:40,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 16:46:40,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:40,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:41,324 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:46:41,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:41,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941809564] [2025-02-05 16:46:41,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941809564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:41,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:41,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:41,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175059841] [2025-02-05 16:46:41,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:41,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:41,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:41,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:41,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:41,327 INFO L87 Difference]: Start difference. First operand 30146 states and 45377 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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:46:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:41,858 INFO L93 Difference]: Finished difference Result 60230 states and 90691 transitions. [2025-02-05 16:46:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:41,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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 111 [2025-02-05 16:46:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:41,907 INFO L225 Difference]: With dead ends: 60230 [2025-02-05 16:46:41,907 INFO L226 Difference]: Without dead ends: 30148 [2025-02-05 16:46:41,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:46:41,939 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 820 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:41,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1205 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30148 states. [2025-02-05 16:46:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30148 to 30146. [2025-02-05 16:46:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30146 states, 30145 states have (on average 1.4967988057721016) internal successors, (45121), 30145 states have internal predecessors, (45121), 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:46:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30146 states to 30146 states and 45121 transitions. [2025-02-05 16:46:42,299 INFO L78 Accepts]: Start accepts. Automaton has 30146 states and 45121 transitions. Word has length 111 [2025-02-05 16:46:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:42,299 INFO L471 AbstractCegarLoop]: Abstraction has 30146 states and 45121 transitions. [2025-02-05 16:46:42,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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:46:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 30146 states and 45121 transitions. [2025-02-05 16:46:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:46:42,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:42,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:42,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:46:42,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:42,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1898836508, now seen corresponding path program 1 times [2025-02-05 16:46:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:42,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374425971] [2025-02-05 16:46:42,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:42,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:46:42,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:46:42,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:42,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:42,618 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:46:42,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:42,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374425971] [2025-02-05 16:46:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374425971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:42,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:42,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:46:42,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472358290] [2025-02-05 16:46:42,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:42,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:46:42,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:42,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:46:42,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:46:42,620 INFO L87 Difference]: Start difference. First operand 30146 states and 45121 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 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:46:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:42,701 INFO L93 Difference]: Finished difference Result 30660 states and 45890 transitions. [2025-02-05 16:46:42,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:46:42,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 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 112 [2025-02-05 16:46:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:42,752 INFO L225 Difference]: With dead ends: 30660 [2025-02-05 16:46:42,752 INFO L226 Difference]: Without dead ends: 30658 [2025-02-05 16:46:42,764 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:46:42,764 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 817 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:46:42,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 817 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:42,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30658 states. [2025-02-05 16:46:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30658 to 30658. [2025-02-05 16:46:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30658 states, 30657 states have (on average 1.484326581204945) internal successors, (45505), 30657 states have internal predecessors, (45505), 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:46:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30658 states to 30658 states and 45505 transitions. [2025-02-05 16:46:43,161 INFO L78 Accepts]: Start accepts. Automaton has 30658 states and 45505 transitions. Word has length 112 [2025-02-05 16:46:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:43,161 INFO L471 AbstractCegarLoop]: Abstraction has 30658 states and 45505 transitions. [2025-02-05 16:46:43,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 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:46:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 30658 states and 45505 transitions. [2025-02-05 16:46:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:46:43,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:43,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:43,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:46:43,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:43,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:43,162 INFO L85 PathProgramCache]: Analyzing trace with hash -447106959, now seen corresponding path program 1 times [2025-02-05 16:46:43,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:43,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416247234] [2025-02-05 16:46:43,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:43,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:43,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:46:43,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:46:43,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:43,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:43,237 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:46:43,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416247234] [2025-02-05 16:46:43,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416247234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:43,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:43,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:46:43,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899019833] [2025-02-05 16:46:43,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:43,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:46:43,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:43,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:46:43,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:46:43,239 INFO L87 Difference]: Start difference. First operand 30658 states and 45505 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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:46:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:43,501 INFO L93 Difference]: Finished difference Result 60873 states and 90823 transitions. [2025-02-05 16:46:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:46:43,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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 112 [2025-02-05 16:46:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:43,554 INFO L225 Difference]: With dead ends: 60873 [2025-02-05 16:46:43,554 INFO L226 Difference]: Without dead ends: 44486 [2025-02-05 16:46:43,565 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:46:43,566 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 133 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 473 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:46:43,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 473 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:46:43,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44486 states. [2025-02-05 16:46:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44486 to 44484. [2025-02-05 16:46:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44484 states, 44483 states have (on average 1.480543128835735) internal successors, (65859), 44483 states have internal predecessors, (65859), 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:46:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44484 states to 44484 states and 65859 transitions. [2025-02-05 16:46:43,992 INFO L78 Accepts]: Start accepts. Automaton has 44484 states and 65859 transitions. Word has length 112 [2025-02-05 16:46:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:43,992 INFO L471 AbstractCegarLoop]: Abstraction has 44484 states and 65859 transitions. [2025-02-05 16:46:43,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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:46:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 44484 states and 65859 transitions. [2025-02-05 16:46:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:46:44,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:44,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:44,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:46:44,003 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:44,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1736475865, now seen corresponding path program 1 times [2025-02-05 16:46:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:44,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072935675] [2025-02-05 16:46:44,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:44,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:46:44,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:46:44,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:44,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:46:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072935675] [2025-02-05 16:46:44,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072935675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:44,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:44,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58413338] [2025-02-05 16:46:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:44,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:44,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:44,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:44,214 INFO L87 Difference]: Start difference. First operand 44484 states and 65859 transitions. Second operand has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 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:46:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:45,604 INFO L93 Difference]: Finished difference Result 407894 states and 603852 transitions. [2025-02-05 16:46:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:45,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 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 151 [2025-02-05 16:46:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:46,199 INFO L225 Difference]: With dead ends: 407894 [2025-02-05 16:46:46,199 INFO L226 Difference]: Without dead ends: 363476 [2025-02-05 16:46:46,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:46,279 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 2296 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:46,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 3160 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:46,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363476 states. [2025-02-05 16:46:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363476 to 88900. [2025-02-05 16:46:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88900 states, 88899 states have (on average 1.4765857883665734) internal successors, (131267), 88899 states have internal predecessors, (131267), 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:46:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88900 states to 88900 states and 131267 transitions. [2025-02-05 16:46:49,057 INFO L78 Accepts]: Start accepts. Automaton has 88900 states and 131267 transitions. Word has length 151 [2025-02-05 16:46:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:49,058 INFO L471 AbstractCegarLoop]: Abstraction has 88900 states and 131267 transitions. [2025-02-05 16:46:49,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 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:46:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 88900 states and 131267 transitions. [2025-02-05 16:46:49,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:46:49,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:49,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:49,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:46:49,073 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:49,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1718739943, now seen corresponding path program 1 times [2025-02-05 16:46:49,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:49,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465045090] [2025-02-05 16:46:49,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:49,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:49,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:46:49,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:46:49,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:49,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:46:49,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465045090] [2025-02-05 16:46:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465045090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:49,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:49,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768619187] [2025-02-05 16:46:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:49,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:49,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:49,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:49,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:49,356 INFO L87 Difference]: Start difference. First operand 88900 states and 131267 transitions. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 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:46:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:50,947 INFO L93 Difference]: Finished difference Result 452310 states and 669260 transitions. [2025-02-05 16:46:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:50,947 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 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 151 [2025-02-05 16:46:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:51,602 INFO L225 Difference]: With dead ends: 452310 [2025-02-05 16:46:51,602 INFO L226 Difference]: Without dead ends: 407892 [2025-02-05 16:46:51,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:51,724 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 2358 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2358 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:51,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2358 Valid, 3064 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:51,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407892 states. [2025-02-05 16:46:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407892 to 155588. [2025-02-05 16:46:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155588 states, 155587 states have (on average 1.4722245431816283) internal successors, (229059), 155587 states have internal predecessors, (229059), 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:46:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155588 states to 155588 states and 229059 transitions. [2025-02-05 16:46:55,508 INFO L78 Accepts]: Start accepts. Automaton has 155588 states and 229059 transitions. Word has length 151 [2025-02-05 16:46:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:55,508 INFO L471 AbstractCegarLoop]: Abstraction has 155588 states and 229059 transitions. [2025-02-05 16:46:55,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 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:46:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 155588 states and 229059 transitions. [2025-02-05 16:46:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:46:55,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:55,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:55,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:46:55,536 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash 390143929, now seen corresponding path program 1 times [2025-02-05 16:46:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987291445] [2025-02-05 16:46:55,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:55,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:46:55,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:46:55,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:55,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:46:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:55,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987291445] [2025-02-05 16:46:55,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987291445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:55,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:55,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:46:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572296417] [2025-02-05 16:46:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:55,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:46:55,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:55,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:46:55,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:46:55,848 INFO L87 Difference]: Start difference. First operand 155588 states and 229059 transitions. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 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:46:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:57,379 INFO L93 Difference]: Finished difference Result 496726 states and 734668 transitions. [2025-02-05 16:46:57,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:46:57,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 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 151 [2025-02-05 16:46:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:58,369 INFO L225 Difference]: With dead ends: 496726 [2025-02-05 16:46:58,369 INFO L226 Difference]: Without dead ends: 452308 [2025-02-05 16:46:58,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:46:58,442 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 2445 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2445 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:58,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2445 Valid, 2889 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452308 states. [2025-02-05 16:47:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452308 to 200004. [2025-02-05 16:47:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200004 states, 200003 states have (on average 1.4723129153062704) internal successors, (294467), 200003 states have internal predecessors, (294467), 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:47:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200004 states to 200004 states and 294467 transitions. [2025-02-05 16:47:02,444 INFO L78 Accepts]: Start accepts. Automaton has 200004 states and 294467 transitions. Word has length 151 [2025-02-05 16:47:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:02,445 INFO L471 AbstractCegarLoop]: Abstraction has 200004 states and 294467 transitions. [2025-02-05 16:47:02,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 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:47:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 200004 states and 294467 transitions. [2025-02-05 16:47:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:47:02,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:02,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:02,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:47:02,461 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:02,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2034692953, now seen corresponding path program 1 times [2025-02-05 16:47:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:02,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439387327] [2025-02-05 16:47:02,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:02,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:47:02,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:47:02,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:02,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 16:47:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:02,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439387327] [2025-02-05 16:47:02,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439387327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:02,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:02,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:47:02,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899603202] [2025-02-05 16:47:02,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:02,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:47:02,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:02,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:47:02,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:47:02,717 INFO L87 Difference]: Start difference. First operand 200004 states and 294467 transitions. Second operand has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 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:47:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:04,651 INFO L93 Difference]: Finished difference Result 541142 states and 800076 transitions. [2025-02-05 16:47:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:47:04,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 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 151 [2025-02-05 16:47:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:05,347 INFO L225 Difference]: With dead ends: 541142 [2025-02-05 16:47:05,348 INFO L226 Difference]: Without dead ends: 496724 [2025-02-05 16:47:05,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:47:05,446 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 2528 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2528 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:05,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2528 Valid, 2837 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:47:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496724 states. [2025-02-05 16:47:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496724 to 244420. [2025-02-05 16:47:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244420 states, 244419 states have (on average 1.4723691693362628) internal successors, (359875), 244419 states have internal predecessors, (359875), 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:47:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244420 states to 244420 states and 359875 transitions. [2025-02-05 16:47:10,334 INFO L78 Accepts]: Start accepts. Automaton has 244420 states and 359875 transitions. Word has length 151 [2025-02-05 16:47:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:10,334 INFO L471 AbstractCegarLoop]: Abstraction has 244420 states and 359875 transitions. [2025-02-05 16:47:10,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 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:47:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 244420 states and 359875 transitions. [2025-02-05 16:47:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 16:47:10,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:10,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:47:10,350 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:10,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash -108554503, now seen corresponding path program 1 times [2025-02-05 16:47:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:10,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425295494] [2025-02-05 16:47:10,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:10,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:10,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 16:47:10,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 16:47:10,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:10,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 16:47:10,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:10,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425295494] [2025-02-05 16:47:10,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425295494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:10,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:10,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:47:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867241190] [2025-02-05 16:47:10,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:10,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:47:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:10,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:47:10,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:47:10,979 INFO L87 Difference]: Start difference. First operand 244420 states and 359875 transitions. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 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:47:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:12,880 INFO L93 Difference]: Finished difference Result 585558 states and 865484 transitions. [2025-02-05 16:47:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:47:12,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 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 151 [2025-02-05 16:47:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:13,593 INFO L225 Difference]: With dead ends: 585558 [2025-02-05 16:47:13,593 INFO L226 Difference]: Without dead ends: 541140 [2025-02-05 16:47:13,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:47:13,659 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 2628 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2628 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:13,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2628 Valid, 2892 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:47:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541140 states.