./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d2ba51bdecedc8a39a24625eeb8da910bb1c988071a15f12bed2cd804a9146c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:24:04,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:24:04,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:24:04,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:24:04,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:24:04,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:24:04,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:24:04,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:24:04,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:24:04,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:24:04,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:24:04,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:24:04,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:24:04,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:24:04,280 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:24:04,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:24:04,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:24:04,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:24:04,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:24:04,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:24:04,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:24:04,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:24:04,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:24:04,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:24:04,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:24:04,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:24:04,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:24:04,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:24:04,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:24:04,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:24:04,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:24:04,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:24:04,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:24:04,283 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/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 -> d2ba51bdecedc8a39a24625eeb8da910bb1c988071a15f12bed2cd804a9146c3 [2025-03-08 06:24:04,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:24:04,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:24:04,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:24:04,535 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:24:04,535 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:24:04,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:24:05,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1112f16f6/de6bfc951fe94727a1235d473bf12ec4/FLAG0ce762e18 [2025-03-08 06:24:05,976 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:24:05,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:24:05,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1112f16f6/de6bfc951fe94727a1235d473bf12ec4/FLAG0ce762e18 [2025-03-08 06:24:06,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1112f16f6/de6bfc951fe94727a1235d473bf12ec4 [2025-03-08 06:24:06,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:24:06,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:24:06,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:24:06,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:24:06,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:24:06,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ac2edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06, skipping insertion in model container [2025-03-08 06:24:06,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:24:06,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6638,6651] [2025-03-08 06:24:06,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:24:06,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:24:06,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6638,6651] [2025-03-08 06:24:06,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:24:06,341 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:24:06,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06 WrapperNode [2025-03-08 06:24:06,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:24:06,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:24:06,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:24:06,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:24:06,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,390 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 561 [2025-03-08 06:24:06,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:24:06,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:24:06,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:24:06,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:24:06,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,413 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-03-08 06:24:06,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:24:06,431 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:24:06,431 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:24:06,431 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:24:06,432 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (1/1) ... [2025-03-08 06:24:06,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:24:06,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:06,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:24:06,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:24:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:24:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:24:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:24:06,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:24:06,569 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:24:06,570 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:24:07,016 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L452: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~2#1; [2025-03-08 06:24:07,016 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L358: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:24:07,016 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_~node3__m3~2#1; [2025-03-08 06:24:07,016 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:24:07,017 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node2__m2~2#1; [2025-03-08 06:24:07,017 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L593: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:24:07,017 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:24:07,040 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-08 06:24:07,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:24:07,049 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:24:07,050 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:24:07,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:24:07 BoogieIcfgContainer [2025-03-08 06:24:07,050 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:24:07,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:24:07,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:24:07,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:24:07,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:24:06" (1/3) ... [2025-03-08 06:24:07,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1dc5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:24:07, skipping insertion in model container [2025-03-08 06:24:07,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:06" (2/3) ... [2025-03-08 06:24:07,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1dc5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:24:07, skipping insertion in model container [2025-03-08 06:24:07,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:24:07" (3/3) ... [2025-03-08 06:24:07,057 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:24:07,067 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:24:07,068 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 123 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:24:07,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:24:07,118 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;@51425402, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:24:07,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:24:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 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-03-08 06:24:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 06:24:07,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:07,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:07,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:07,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:07,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1027703963, now seen corresponding path program 1 times [2025-03-08 06:24:07,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:07,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548719420] [2025-03-08 06:24:07,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:07,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:07,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 06:24:07,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 06:24:07,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:07,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:07,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548719420] [2025-03-08 06:24:07,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548719420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:07,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:07,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011347539] [2025-03-08 06:24:07,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:07,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:07,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:07,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:07,626 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 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 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-03-08 06:24:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:07,896 INFO L93 Difference]: Finished difference Result 588 states and 943 transitions. [2025-03-08 06:24:07,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:24:07,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 61 [2025-03-08 06:24:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:07,908 INFO L225 Difference]: With dead ends: 588 [2025-03-08 06:24:07,908 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 06:24:07,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:24:07,914 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 816 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:07,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1918 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 06:24:07,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 186. [2025-03-08 06:24:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 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-03-08 06:24:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 270 transitions. [2025-03-08 06:24:07,978 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 270 transitions. Word has length 61 [2025-03-08 06:24:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:07,979 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 270 transitions. [2025-03-08 06:24:07,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-03-08 06:24:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 270 transitions. [2025-03-08 06:24:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:24:07,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:07,981 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] [2025-03-08 06:24:07,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:24:07,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:07,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1947986217, now seen corresponding path program 1 times [2025-03-08 06:24:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:07,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534759740] [2025-03-08 06:24:07,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:07,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:24:08,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:24:08,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:08,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534759740] [2025-03-08 06:24:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534759740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:08,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:08,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244703938] [2025-03-08 06:24:08,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:08,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:08,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:08,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:08,180 INFO L87 Difference]: Start difference. First operand 186 states and 270 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:08,304 INFO L93 Difference]: Finished difference Result 664 states and 1021 transitions. [2025-03-08 06:24:08,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:08,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 63 [2025-03-08 06:24:08,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:08,307 INFO L225 Difference]: With dead ends: 664 [2025-03-08 06:24:08,308 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 06:24:08,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:08,309 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 527 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:08,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1141 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 06:24:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 297. [2025-03-08 06:24:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.5067567567567568) internal successors, (446), 296 states have internal predecessors, (446), 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-03-08 06:24:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 446 transitions. [2025-03-08 06:24:08,330 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 446 transitions. Word has length 63 [2025-03-08 06:24:08,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:08,331 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 446 transitions. [2025-03-08 06:24:08,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 446 transitions. [2025-03-08 06:24:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:24:08,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:08,333 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] [2025-03-08 06:24:08,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:24:08,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:08,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash -267928799, now seen corresponding path program 1 times [2025-03-08 06:24:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413722633] [2025-03-08 06:24:08,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:08,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:24:08,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:24:08,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:08,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413722633] [2025-03-08 06:24:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413722633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229460208] [2025-03-08 06:24:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:08,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:08,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:08,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:08,479 INFO L87 Difference]: Start difference. First operand 297 states and 446 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:08,589 INFO L93 Difference]: Finished difference Result 775 states and 1197 transitions. [2025-03-08 06:24:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:08,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 63 [2025-03-08 06:24:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:08,592 INFO L225 Difference]: With dead ends: 775 [2025-03-08 06:24:08,593 INFO L226 Difference]: Without dead ends: 673 [2025-03-08 06:24:08,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:08,596 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 518 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:08,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1090 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-08 06:24:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 458. [2025-03-08 06:24:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5339168490153172) internal successors, (701), 457 states have internal predecessors, (701), 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-03-08 06:24:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 701 transitions. [2025-03-08 06:24:08,616 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 701 transitions. Word has length 63 [2025-03-08 06:24:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:08,617 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 701 transitions. [2025-03-08 06:24:08,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 701 transitions. [2025-03-08 06:24:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:24:08,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:08,618 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] [2025-03-08 06:24:08,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:24:08,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1034284073, now seen corresponding path program 1 times [2025-03-08 06:24:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:08,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509750176] [2025-03-08 06:24:08,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:08,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:24:08,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:24:08,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:08,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509750176] [2025-03-08 06:24:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509750176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:08,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:08,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:08,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630991200] [2025-03-08 06:24:08,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:08,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:08,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:08,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:08,797 INFO L87 Difference]: Start difference. First operand 458 states and 701 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:08,889 INFO L93 Difference]: Finished difference Result 881 states and 1365 transitions. [2025-03-08 06:24:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 63 [2025-03-08 06:24:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:08,892 INFO L225 Difference]: With dead ends: 881 [2025-03-08 06:24:08,894 INFO L226 Difference]: Without dead ends: 779 [2025-03-08 06:24:08,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:08,895 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 595 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:08,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 879 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-08 06:24:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 564. [2025-03-08 06:24:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.5435168738898757) internal successors, (869), 563 states have internal predecessors, (869), 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-03-08 06:24:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 869 transitions. [2025-03-08 06:24:08,911 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 869 transitions. Word has length 63 [2025-03-08 06:24:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:08,911 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 869 transitions. [2025-03-08 06:24:08,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 869 transitions. [2025-03-08 06:24:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:24:08,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:08,913 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] [2025-03-08 06:24:08,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:24:08,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:08,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1015769055, now seen corresponding path program 1 times [2025-03-08 06:24:08,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:08,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175984153] [2025-03-08 06:24:08,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:08,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:24:08,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:24:08,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175984153] [2025-03-08 06:24:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175984153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510468443] [2025-03-08 06:24:09,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:09,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:09,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:09,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:09,052 INFO L87 Difference]: Start difference. First operand 564 states and 869 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:09,139 INFO L93 Difference]: Finished difference Result 982 states and 1525 transitions. [2025-03-08 06:24:09,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:09,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 63 [2025-03-08 06:24:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:09,142 INFO L225 Difference]: With dead ends: 982 [2025-03-08 06:24:09,142 INFO L226 Difference]: Without dead ends: 880 [2025-03-08 06:24:09,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:09,143 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 667 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:09,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 944 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-08 06:24:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 665. [2025-03-08 06:24:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.5496987951807228) internal successors, (1029), 664 states have internal predecessors, (1029), 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-03-08 06:24:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1029 transitions. [2025-03-08 06:24:09,162 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1029 transitions. Word has length 63 [2025-03-08 06:24:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:09,162 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1029 transitions. [2025-03-08 06:24:09,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1029 transitions. [2025-03-08 06:24:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:24:09,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:09,163 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] [2025-03-08 06:24:09,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:24:09,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:09,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 257953070, now seen corresponding path program 1 times [2025-03-08 06:24:09,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089240806] [2025-03-08 06:24:09,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:09,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:24:09,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:24:09,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:09,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:09,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089240806] [2025-03-08 06:24:09,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089240806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:09,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:09,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357433413] [2025-03-08 06:24:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:09,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:09,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:09,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:09,243 INFO L87 Difference]: Start difference. First operand 665 states and 1029 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-08 06:24:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:09,276 INFO L93 Difference]: Finished difference Result 1698 states and 2656 transitions. [2025-03-08 06:24:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2025-03-08 06:24:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:09,282 INFO L225 Difference]: With dead ends: 1698 [2025-03-08 06:24:09,282 INFO L226 Difference]: Without dead ends: 1146 [2025-03-08 06:24:09,283 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-03-08 06:24:09,284 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 68 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:09,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 380 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-08 06:24:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1122. [2025-03-08 06:24:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.5379125780553078) internal successors, (1724), 1121 states have internal predecessors, (1724), 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-03-08 06:24:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1724 transitions. [2025-03-08 06:24:09,318 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1724 transitions. Word has length 63 [2025-03-08 06:24:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:09,318 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1724 transitions. [2025-03-08 06:24:09,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-08 06:24:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1724 transitions. [2025-03-08 06:24:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:24:09,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:09,319 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] [2025-03-08 06:24:09,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:24:09,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:09,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash 259114919, now seen corresponding path program 1 times [2025-03-08 06:24:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:09,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070008403] [2025-03-08 06:24:09,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:09,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:09,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:24:09,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:24:09,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:09,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:09,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070008403] [2025-03-08 06:24:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070008403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:09,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17540766] [2025-03-08 06:24:09,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:09,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:09,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:09,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:09,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:09,534 INFO L87 Difference]: Start difference. First operand 1122 states and 1724 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:09,636 INFO L93 Difference]: Finished difference Result 2133 states and 3296 transitions. [2025-03-08 06:24:09,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:09,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 63 [2025-03-08 06:24:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:09,639 INFO L225 Difference]: With dead ends: 2133 [2025-03-08 06:24:09,639 INFO L226 Difference]: Without dead ends: 1124 [2025-03-08 06:24:09,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:24:09,641 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 300 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:09,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 455 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-03-08 06:24:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1122. [2025-03-08 06:24:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 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-03-08 06:24:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1718 transitions. [2025-03-08 06:24:09,663 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1718 transitions. Word has length 63 [2025-03-08 06:24:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:09,664 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1718 transitions. [2025-03-08 06:24:09,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-08 06:24:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1718 transitions. [2025-03-08 06:24:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:24:09,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:09,664 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] [2025-03-08 06:24:09,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:24:09,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:09,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash -588617682, now seen corresponding path program 1 times [2025-03-08 06:24:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:09,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314754054] [2025-03-08 06:24:09,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:09,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:09,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:24:09,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:24:09,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:09,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:09,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314754054] [2025-03-08 06:24:09,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314754054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:09,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:09,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:09,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053502345] [2025-03-08 06:24:09,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:09,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:09,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:09,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:09,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:09,761 INFO L87 Difference]: Start difference. First operand 1122 states and 1718 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-03-08 06:24:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:09,920 INFO L93 Difference]: Finished difference Result 3264 states and 5032 transitions. [2025-03-08 06:24:09,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:09,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-03-08 06:24:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:09,926 INFO L225 Difference]: With dead ends: 3264 [2025-03-08 06:24:09,926 INFO L226 Difference]: Without dead ends: 2171 [2025-03-08 06:24:09,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:09,928 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 667 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:09,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 148 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2025-03-08 06:24:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2025-03-08 06:24:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.5313653136531364) internal successors, (3320), 2168 states have internal predecessors, (3320), 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-03-08 06:24:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3320 transitions. [2025-03-08 06:24:09,963 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3320 transitions. Word has length 64 [2025-03-08 06:24:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:09,964 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3320 transitions. [2025-03-08 06:24:09,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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-03-08 06:24:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3320 transitions. [2025-03-08 06:24:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 06:24:09,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:09,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:09,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:24:09,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:09,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash 199189182, now seen corresponding path program 1 times [2025-03-08 06:24:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800363138] [2025-03-08 06:24:09,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:09,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 06:24:09,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 06:24:09,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:09,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:10,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:10,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800363138] [2025-03-08 06:24:10,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800363138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:10,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:10,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:10,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719325551] [2025-03-08 06:24:10,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:10,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:10,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:10,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:10,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:10,039 INFO L87 Difference]: Start difference. First operand 2169 states and 3320 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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-03-08 06:24:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:10,135 INFO L93 Difference]: Finished difference Result 4297 states and 6596 transitions. [2025-03-08 06:24:10,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:10,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-03-08 06:24:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:10,141 INFO L225 Difference]: With dead ends: 4297 [2025-03-08 06:24:10,141 INFO L226 Difference]: Without dead ends: 2169 [2025-03-08 06:24:10,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:10,144 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 418 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:10,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 115 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2025-03-08 06:24:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2169. [2025-03-08 06:24:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.5106088560885609) internal successors, (3275), 2168 states have internal predecessors, (3275), 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-03-08 06:24:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3275 transitions. [2025-03-08 06:24:10,176 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3275 transitions. Word has length 65 [2025-03-08 06:24:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:10,176 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3275 transitions. [2025-03-08 06:24:10,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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-03-08 06:24:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3275 transitions. [2025-03-08 06:24:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:24:10,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:10,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:10,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:24:10,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:10,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:10,180 INFO L85 PathProgramCache]: Analyzing trace with hash -471963950, now seen corresponding path program 1 times [2025-03-08 06:24:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:10,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348585444] [2025-03-08 06:24:10,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:10,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:10,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:24:10,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:24:10,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:10,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348585444] [2025-03-08 06:24:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348585444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:10,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207844599] [2025-03-08 06:24:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:10,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:10,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:10,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:10,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:10,257 INFO L87 Difference]: Start difference. First operand 2169 states and 3275 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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-03-08 06:24:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:10,348 INFO L93 Difference]: Finished difference Result 4305 states and 6516 transitions. [2025-03-08 06:24:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-03-08 06:24:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:10,354 INFO L225 Difference]: With dead ends: 4305 [2025-03-08 06:24:10,355 INFO L226 Difference]: Without dead ends: 2169 [2025-03-08 06:24:10,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:10,357 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 434 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:10,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 99 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2025-03-08 06:24:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2169. [2025-03-08 06:24:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.4898523985239853) internal successors, (3230), 2168 states have internal predecessors, (3230), 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-03-08 06:24:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3230 transitions. [2025-03-08 06:24:10,389 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3230 transitions. Word has length 66 [2025-03-08 06:24:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:10,389 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3230 transitions. [2025-03-08 06:24:10,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 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-03-08 06:24:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3230 transitions. [2025-03-08 06:24:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:24:10,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:10,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:10,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:24:10,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1408914110, now seen corresponding path program 1 times [2025-03-08 06:24:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39219731] [2025-03-08 06:24:10,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:10,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:24:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:24:10,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:10,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:10,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39219731] [2025-03-08 06:24:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39219731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:10,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:10,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:10,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508512417] [2025-03-08 06:24:10,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:10,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:10,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:10,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:10,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:10,469 INFO L87 Difference]: Start difference. First operand 2169 states and 3230 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-03-08 06:24:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:10,558 INFO L93 Difference]: Finished difference Result 4301 states and 6422 transitions. [2025-03-08 06:24:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:10,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2025-03-08 06:24:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:10,564 INFO L225 Difference]: With dead ends: 4301 [2025-03-08 06:24:10,564 INFO L226 Difference]: Without dead ends: 2169 [2025-03-08 06:24:10,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:10,566 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 416 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:10,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 107 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2025-03-08 06:24:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2169. [2025-03-08 06:24:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.4690959409594095) internal successors, (3185), 2168 states have internal predecessors, (3185), 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-03-08 06:24:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3185 transitions. [2025-03-08 06:24:10,598 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3185 transitions. Word has length 67 [2025-03-08 06:24:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:10,598 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3185 transitions. [2025-03-08 06:24:10,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-03-08 06:24:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3185 transitions. [2025-03-08 06:24:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:24:10,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:10,599 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] [2025-03-08 06:24:10,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:24:10,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:10,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:10,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1972628598, now seen corresponding path program 1 times [2025-03-08 06:24:10,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:10,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863473832] [2025-03-08 06:24:10,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:10,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:10,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:24:10,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:24:10,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:10,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:10,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863473832] [2025-03-08 06:24:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863473832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:10,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:10,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:24:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099143338] [2025-03-08 06:24:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:10,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:24:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:10,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:24:10,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:10,827 INFO L87 Difference]: Start difference. First operand 2169 states and 3185 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 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-03-08 06:24:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:11,119 INFO L93 Difference]: Finished difference Result 6250 states and 9205 transitions. [2025-03-08 06:24:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:24:11,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-03-08 06:24:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:11,128 INFO L225 Difference]: With dead ends: 6250 [2025-03-08 06:24:11,129 INFO L226 Difference]: Without dead ends: 4194 [2025-03-08 06:24:11,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:24:11,131 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 823 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:11,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 370 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2025-03-08 06:24:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 2169. [2025-03-08 06:24:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.4686346863468636) internal successors, (3184), 2168 states have internal predecessors, (3184), 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-03-08 06:24:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3184 transitions. [2025-03-08 06:24:11,172 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3184 transitions. Word has length 68 [2025-03-08 06:24:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:11,173 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3184 transitions. [2025-03-08 06:24:11,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 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-03-08 06:24:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3184 transitions. [2025-03-08 06:24:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:24:11,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:11,174 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] [2025-03-08 06:24:11,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:24:11,174 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:11,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:11,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1436306698, now seen corresponding path program 1 times [2025-03-08 06:24:11,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:11,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644392319] [2025-03-08 06:24:11,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:11,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:11,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:24:11,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:24:11,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:11,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644392319] [2025-03-08 06:24:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644392319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:11,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:24:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534556798] [2025-03-08 06:24:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:11,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:24:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:11,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:24:11,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:24:11,515 INFO L87 Difference]: Start difference. First operand 2169 states and 3184 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 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-03-08 06:24:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:12,074 INFO L93 Difference]: Finished difference Result 6508 states and 9477 transitions. [2025-03-08 06:24:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:24:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 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 69 [2025-03-08 06:24:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:12,086 INFO L225 Difference]: With dead ends: 6508 [2025-03-08 06:24:12,086 INFO L226 Difference]: Without dead ends: 4486 [2025-03-08 06:24:12,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:24:12,090 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 703 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:12,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 617 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2025-03-08 06:24:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2202. [2025-03-08 06:24:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2201 states have (on average 1.46569741026806) internal successors, (3226), 2201 states have internal predecessors, (3226), 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-03-08 06:24:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 3226 transitions. [2025-03-08 06:24:12,146 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 3226 transitions. Word has length 69 [2025-03-08 06:24:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:12,146 INFO L471 AbstractCegarLoop]: Abstraction has 2202 states and 3226 transitions. [2025-03-08 06:24:12,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 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-03-08 06:24:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 3226 transitions. [2025-03-08 06:24:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:24:12,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:12,148 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] [2025-03-08 06:24:12,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:24:12,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:12,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1011338397, now seen corresponding path program 1 times [2025-03-08 06:24:12,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:12,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224680274] [2025-03-08 06:24:12,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:12,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:24:12,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:24:12,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:12,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:12,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:12,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224680274] [2025-03-08 06:24:12,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224680274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:12,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:24:12,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605785045] [2025-03-08 06:24:12,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:12,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:24:12,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:12,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:24:12,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:24:12,371 INFO L87 Difference]: Start difference. First operand 2202 states and 3226 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 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-03-08 06:24:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:12,726 INFO L93 Difference]: Finished difference Result 6424 states and 9411 transitions. [2025-03-08 06:24:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:24:12,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2025-03-08 06:24:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:12,740 INFO L225 Difference]: With dead ends: 6424 [2025-03-08 06:24:12,742 INFO L226 Difference]: Without dead ends: 4360 [2025-03-08 06:24:12,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:24:12,747 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 891 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:12,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 452 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2025-03-08 06:24:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 2202. [2025-03-08 06:24:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2201 states have (on average 1.461608359836438) internal successors, (3217), 2201 states have internal predecessors, (3217), 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-03-08 06:24:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 3217 transitions. [2025-03-08 06:24:12,810 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 3217 transitions. Word has length 69 [2025-03-08 06:24:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:12,810 INFO L471 AbstractCegarLoop]: Abstraction has 2202 states and 3217 transitions. [2025-03-08 06:24:12,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 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-03-08 06:24:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 3217 transitions. [2025-03-08 06:24:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:24:12,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:12,811 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] [2025-03-08 06:24:12,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:24:12,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:12,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash 525220637, now seen corresponding path program 1 times [2025-03-08 06:24:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545792628] [2025-03-08 06:24:12,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:12,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:24:12,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:24:12,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:12,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:13,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:13,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545792628] [2025-03-08 06:24:13,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545792628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:13,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:13,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:24:13,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760725351] [2025-03-08 06:24:13,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:13,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:24:13,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:13,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:24:13,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:24:13,012 INFO L87 Difference]: Start difference. First operand 2202 states and 3217 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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-03-08 06:24:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:13,329 INFO L93 Difference]: Finished difference Result 6379 states and 9330 transitions. [2025-03-08 06:24:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:24:13,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-03-08 06:24:13,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:13,339 INFO L225 Difference]: With dead ends: 6379 [2025-03-08 06:24:13,339 INFO L226 Difference]: Without dead ends: 4354 [2025-03-08 06:24:13,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:24:13,342 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 797 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:13,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 453 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2025-03-08 06:24:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 2169. [2025-03-08 06:24:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.4617158671586716) internal successors, (3169), 2168 states have internal predecessors, (3169), 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-03-08 06:24:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3169 transitions. [2025-03-08 06:24:13,375 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3169 transitions. Word has length 70 [2025-03-08 06:24:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,375 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3169 transitions. [2025-03-08 06:24:13,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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-03-08 06:24:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3169 transitions. [2025-03-08 06:24:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:24:13,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,376 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] [2025-03-08 06:24:13,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:24:13,376 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:13,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash 66254365, now seen corresponding path program 1 times [2025-03-08 06:24:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055233516] [2025-03-08 06:24:13,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:24:13,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:24:13,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:13,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:13,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:13,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055233516] [2025-03-08 06:24:13,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055233516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:13,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:13,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:24:13,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420820098] [2025-03-08 06:24:13,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:13,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:24:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:13,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:24:13,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:24:13,572 INFO L87 Difference]: Start difference. First operand 2169 states and 3169 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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-03-08 06:24:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:13,950 INFO L93 Difference]: Finished difference Result 4687 states and 6837 transitions. [2025-03-08 06:24:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:24:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-03-08 06:24:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:13,955 INFO L225 Difference]: With dead ends: 4687 [2025-03-08 06:24:13,955 INFO L226 Difference]: Without dead ends: 2617 [2025-03-08 06:24:13,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:24:13,957 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 327 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:13,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 674 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2025-03-08 06:24:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2169. [2025-03-08 06:24:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.4603321033210332) internal successors, (3166), 2168 states have internal predecessors, (3166), 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-03-08 06:24:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3166 transitions. [2025-03-08 06:24:13,983 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3166 transitions. Word has length 70 [2025-03-08 06:24:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,983 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3166 transitions. [2025-03-08 06:24:13,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 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-03-08 06:24:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3166 transitions. [2025-03-08 06:24:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:24:13,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,984 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] [2025-03-08 06:24:13,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:24:13,984 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:13,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1721514123, now seen corresponding path program 1 times [2025-03-08 06:24:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646480653] [2025-03-08 06:24:13,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:24:14,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:24:14,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:14,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:15,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646480653] [2025-03-08 06:24:15,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646480653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:15,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:15,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-03-08 06:24:15,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61862383] [2025-03-08 06:24:15,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:15,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 06:24:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:15,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 06:24:15,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:24:15,008 INFO L87 Difference]: Start difference. First operand 2169 states and 3166 transitions. Second operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 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-03-08 06:24:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:17,558 INFO L93 Difference]: Finished difference Result 4424 states and 6472 transitions. [2025-03-08 06:24:17,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 06:24:17,558 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 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 71 [2025-03-08 06:24:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:17,563 INFO L225 Difference]: With dead ends: 4424 [2025-03-08 06:24:17,563 INFO L226 Difference]: Without dead ends: 3688 [2025-03-08 06:24:17,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=365, Invalid=2085, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 06:24:17,565 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1047 mSDsluCounter, 4868 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 5187 SdHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:17,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 5187 Invalid, 3453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 06:24:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2025-03-08 06:24:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 2184. [2025-03-08 06:24:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 2183 states have (on average 1.4580852038479157) internal successors, (3183), 2183 states have internal predecessors, (3183), 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-03-08 06:24:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3183 transitions. [2025-03-08 06:24:17,594 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3183 transitions. Word has length 71 [2025-03-08 06:24:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:17,594 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 3183 transitions. [2025-03-08 06:24:17,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 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-03-08 06:24:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3183 transitions. [2025-03-08 06:24:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:24:17,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:17,596 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] [2025-03-08 06:24:17,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:24:17,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:17,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:17,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1419308701, now seen corresponding path program 1 times [2025-03-08 06:24:17,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440428578] [2025-03-08 06:24:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:17,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:24:17,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:24:17,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:17,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:18,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440428578] [2025-03-08 06:24:18,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440428578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:18,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:18,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:24:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326117923] [2025-03-08 06:24:18,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:24:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:18,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:24:18,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:18,059 INFO L87 Difference]: Start difference. First operand 2184 states and 3183 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-03-08 06:24:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:18,479 INFO L93 Difference]: Finished difference Result 4972 states and 7293 transitions. [2025-03-08 06:24:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:24:18,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 71 [2025-03-08 06:24:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:18,486 INFO L225 Difference]: With dead ends: 4972 [2025-03-08 06:24:18,486 INFO L226 Difference]: Without dead ends: 4234 [2025-03-08 06:24:18,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:24:18,488 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 618 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:18,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1090 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2025-03-08 06:24:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 2180. [2025-03-08 06:24:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.4547957778797613) internal successors, (3170), 2179 states have internal predecessors, (3170), 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-03-08 06:24:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3170 transitions. [2025-03-08 06:24:18,517 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3170 transitions. Word has length 71 [2025-03-08 06:24:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:18,517 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3170 transitions. [2025-03-08 06:24:18,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-03-08 06:24:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3170 transitions. [2025-03-08 06:24:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:24:18,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:18,518 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] [2025-03-08 06:24:18,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:24:18,518 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:18,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash -322564491, now seen corresponding path program 1 times [2025-03-08 06:24:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:18,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081456181] [2025-03-08 06:24:18,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:18,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:18,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:24:18,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:24:18,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:18,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081456181] [2025-03-08 06:24:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081456181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:18,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:24:18,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121369413] [2025-03-08 06:24:18,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:18,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:24:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:18,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:24:18,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:18,917 INFO L87 Difference]: Start difference. First operand 2180 states and 3170 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-03-08 06:24:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:19,357 INFO L93 Difference]: Finished difference Result 3288 states and 4801 transitions. [2025-03-08 06:24:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:24:19,357 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 71 [2025-03-08 06:24:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:19,360 INFO L225 Difference]: With dead ends: 3288 [2025-03-08 06:24:19,361 INFO L226 Difference]: Without dead ends: 2511 [2025-03-08 06:24:19,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:24:19,362 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 825 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:19,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 860 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2025-03-08 06:24:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2143. [2025-03-08 06:24:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2143 states, 2142 states have (on average 1.457049486461251) internal successors, (3121), 2142 states have internal predecessors, (3121), 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-03-08 06:24:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 3121 transitions. [2025-03-08 06:24:19,378 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 3121 transitions. Word has length 71 [2025-03-08 06:24:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:19,380 INFO L471 AbstractCegarLoop]: Abstraction has 2143 states and 3121 transitions. [2025-03-08 06:24:19,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-03-08 06:24:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 3121 transitions. [2025-03-08 06:24:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:24:19,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:19,380 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] [2025-03-08 06:24:19,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:24:19,381 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:19,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash 759390621, now seen corresponding path program 1 times [2025-03-08 06:24:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:19,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413965575] [2025-03-08 06:24:19,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:19,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:24:19,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:24:19,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:19,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:19,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:19,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413965575] [2025-03-08 06:24:19,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413965575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:19,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:19,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:24:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510109900] [2025-03-08 06:24:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:19,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:24:19,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:19,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:24:19,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:19,777 INFO L87 Difference]: Start difference. First operand 2143 states and 3121 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-03-08 06:24:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:20,245 INFO L93 Difference]: Finished difference Result 4921 states and 7216 transitions. [2025-03-08 06:24:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:24:20,246 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 71 [2025-03-08 06:24:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:20,252 INFO L225 Difference]: With dead ends: 4921 [2025-03-08 06:24:20,252 INFO L226 Difference]: Without dead ends: 4165 [2025-03-08 06:24:20,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:24:20,254 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 669 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:20,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1499 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2025-03-08 06:24:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 2116. [2025-03-08 06:24:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2115 states have (on average 1.4591016548463358) internal successors, (3086), 2115 states have internal predecessors, (3086), 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-03-08 06:24:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3086 transitions. [2025-03-08 06:24:20,278 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3086 transitions. Word has length 71 [2025-03-08 06:24:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:20,278 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 3086 transitions. [2025-03-08 06:24:20,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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-03-08 06:24:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3086 transitions. [2025-03-08 06:24:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:24:20,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:20,279 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] [2025-03-08 06:24:20,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:24:20,279 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:20,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1728873158, now seen corresponding path program 1 times [2025-03-08 06:24:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:20,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057659190] [2025-03-08 06:24:20,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:20,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:24:20,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:24:20,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:20,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:20,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:20,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057659190] [2025-03-08 06:24:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057659190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:20,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:20,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:24:20,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779141046] [2025-03-08 06:24:20,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:20,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:24:20,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:20,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:24:20,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:24:20,369 INFO L87 Difference]: Start difference. First operand 2116 states and 3086 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-08 06:24:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:20,403 INFO L93 Difference]: Finished difference Result 5025 states and 7384 transitions. [2025-03-08 06:24:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 72 [2025-03-08 06:24:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:20,407 INFO L225 Difference]: With dead ends: 5025 [2025-03-08 06:24:20,407 INFO L226 Difference]: Without dead ends: 3009 [2025-03-08 06:24:20,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:20,409 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 73 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:20,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 356 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2025-03-08 06:24:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 2987. [2025-03-08 06:24:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2986 states have (on average 1.4524447421299398) internal successors, (4337), 2986 states have internal predecessors, (4337), 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-03-08 06:24:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 4337 transitions. [2025-03-08 06:24:20,432 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 4337 transitions. Word has length 72 [2025-03-08 06:24:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:20,432 INFO L471 AbstractCegarLoop]: Abstraction has 2987 states and 4337 transitions. [2025-03-08 06:24:20,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-03-08 06:24:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 4337 transitions. [2025-03-08 06:24:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:24:20,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:20,433 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] [2025-03-08 06:24:20,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:24:20,433 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:20,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:20,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1761077229, now seen corresponding path program 1 times [2025-03-08 06:24:20,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:20,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333924597] [2025-03-08 06:24:20,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:20,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:20,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:24:20,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:24:20,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:20,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:20,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333924597] [2025-03-08 06:24:20,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333924597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:20,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:24:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883247348] [2025-03-08 06:24:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:20,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:20,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:20,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:20,568 INFO L87 Difference]: Start difference. First operand 2987 states and 4337 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-03-08 06:24:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:20,591 INFO L93 Difference]: Finished difference Result 3009 states and 4368 transitions. [2025-03-08 06:24:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2025-03-08 06:24:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:20,594 INFO L225 Difference]: With dead ends: 3009 [2025-03-08 06:24:20,595 INFO L226 Difference]: Without dead ends: 3007 [2025-03-08 06:24:20,595 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-03-08 06:24:20,596 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 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-03-08 06:24:20,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2025-03-08 06:24:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2025-03-08 06:24:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.441783100465735) internal successors, (4334), 3006 states have internal predecessors, (4334), 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-03-08 06:24:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4334 transitions. [2025-03-08 06:24:20,627 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4334 transitions. Word has length 72 [2025-03-08 06:24:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4334 transitions. [2025-03-08 06:24:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-03-08 06:24:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4334 transitions. [2025-03-08 06:24:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:24:20,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:20,628 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] [2025-03-08 06:24:20,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:24:20,628 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash -784929205, now seen corresponding path program 1 times [2025-03-08 06:24:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:20,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640956502] [2025-03-08 06:24:20,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:20,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:20,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:24:20,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:24:20,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:20,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640956502] [2025-03-08 06:24:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640956502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:20,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:20,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:24:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068329079] [2025-03-08 06:24:20,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:20,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:24:20,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:20,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:24:20,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:24:20,981 INFO L87 Difference]: Start difference. First operand 3007 states and 4334 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-03-08 06:24:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:21,304 INFO L93 Difference]: Finished difference Result 6658 states and 9649 transitions. [2025-03-08 06:24:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:24:21,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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 72 [2025-03-08 06:24:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:21,310 INFO L225 Difference]: With dead ends: 6658 [2025-03-08 06:24:21,310 INFO L226 Difference]: Without dead ends: 5726 [2025-03-08 06:24:21,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:24:21,312 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 557 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:21,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1171 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2025-03-08 06:24:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 2904. [2025-03-08 06:24:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2904 states, 2903 states have (on average 1.4436789528074405) internal successors, (4191), 2903 states have internal predecessors, (4191), 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-03-08 06:24:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 4191 transitions. [2025-03-08 06:24:21,346 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 4191 transitions. Word has length 72 [2025-03-08 06:24:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:21,346 INFO L471 AbstractCegarLoop]: Abstraction has 2904 states and 4191 transitions. [2025-03-08 06:24:21,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-03-08 06:24:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 4191 transitions. [2025-03-08 06:24:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:24:21,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:21,347 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:24:21,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:24:21,347 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:21,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1145008536, now seen corresponding path program 1 times [2025-03-08 06:24:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868996817] [2025-03-08 06:24:21,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:21,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:24:21,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:24:21,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:21,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868996817] [2025-03-08 06:24:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868996817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436476547] [2025-03-08 06:24:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:21,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:24:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:21,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:24:21,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:21,458 INFO L87 Difference]: Start difference. First operand 2904 states and 4191 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 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-03-08 06:24:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:21,672 INFO L93 Difference]: Finished difference Result 9414 states and 13781 transitions. [2025-03-08 06:24:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:24:21,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2025-03-08 06:24:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:21,679 INFO L225 Difference]: With dead ends: 9414 [2025-03-08 06:24:21,679 INFO L226 Difference]: Without dead ends: 6594 [2025-03-08 06:24:21,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:21,683 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 656 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:21,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 345 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2025-03-08 06:24:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 4556. [2025-03-08 06:24:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4556 states, 4555 states have (on average 1.4489571899012075) internal successors, (6600), 4555 states have internal predecessors, (6600), 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-03-08 06:24:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4556 states to 4556 states and 6600 transitions. [2025-03-08 06:24:21,727 INFO L78 Accepts]: Start accepts. Automaton has 4556 states and 6600 transitions. Word has length 97 [2025-03-08 06:24:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:21,727 INFO L471 AbstractCegarLoop]: Abstraction has 4556 states and 6600 transitions. [2025-03-08 06:24:21,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 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-03-08 06:24:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4556 states and 6600 transitions. [2025-03-08 06:24:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:24:21,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:21,729 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:24:21,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:24:21,729 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:21,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash 490571384, now seen corresponding path program 1 times [2025-03-08 06:24:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549111575] [2025-03-08 06:24:21,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:21,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:21,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:24:21,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:24:21,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:21,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549111575] [2025-03-08 06:24:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549111575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:21,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613104835] [2025-03-08 06:24:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:21,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:24:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:21,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:24:21,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:21,809 INFO L87 Difference]: Start difference. First operand 4556 states and 6600 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 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-03-08 06:24:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:22,004 INFO L93 Difference]: Finished difference Result 16788 states and 24568 transitions. [2025-03-08 06:24:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:24:22,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2025-03-08 06:24:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:22,016 INFO L225 Difference]: With dead ends: 16788 [2025-03-08 06:24:22,016 INFO L226 Difference]: Without dead ends: 12352 [2025-03-08 06:24:22,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:22,023 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 808 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:22,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 276 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12352 states. [2025-03-08 06:24:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12352 to 9830. [2025-03-08 06:24:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9830 states, 9829 states have (on average 1.4486722962661511) internal successors, (14239), 9829 states have internal predecessors, (14239), 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-03-08 06:24:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9830 states to 9830 states and 14239 transitions. [2025-03-08 06:24:22,124 INFO L78 Accepts]: Start accepts. Automaton has 9830 states and 14239 transitions. Word has length 97 [2025-03-08 06:24:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:22,124 INFO L471 AbstractCegarLoop]: Abstraction has 9830 states and 14239 transitions. [2025-03-08 06:24:22,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 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-03-08 06:24:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9830 states and 14239 transitions. [2025-03-08 06:24:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:24:22,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:22,125 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:24:22,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:24:22,126 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:22,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1741083670, now seen corresponding path program 1 times [2025-03-08 06:24:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:22,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203700406] [2025-03-08 06:24:22,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:22,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:22,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:24:22,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:24:22,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:22,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:22,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203700406] [2025-03-08 06:24:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203700406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:22,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757816566] [2025-03-08 06:24:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:24:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:22,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:24:22,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:24:22,204 INFO L87 Difference]: Start difference. First operand 9830 states and 14239 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 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-03-08 06:24:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:22,437 INFO L93 Difference]: Finished difference Result 32610 states and 47485 transitions. [2025-03-08 06:24:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:24:22,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2025-03-08 06:24:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:22,461 INFO L225 Difference]: With dead ends: 32610 [2025-03-08 06:24:22,461 INFO L226 Difference]: Without dead ends: 22900 [2025-03-08 06:24:22,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:24:22,474 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 723 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:22,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 274 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22900 states. [2025-03-08 06:24:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22900 to 21218. [2025-03-08 06:24:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21218 states, 21217 states have (on average 1.4466229909977848) internal successors, (30693), 21217 states have internal predecessors, (30693), 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-03-08 06:24:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21218 states to 21218 states and 30693 transitions. [2025-03-08 06:24:22,704 INFO L78 Accepts]: Start accepts. Automaton has 21218 states and 30693 transitions. Word has length 97 [2025-03-08 06:24:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:22,705 INFO L471 AbstractCegarLoop]: Abstraction has 21218 states and 30693 transitions. [2025-03-08 06:24:22,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 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-03-08 06:24:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 21218 states and 30693 transitions. [2025-03-08 06:24:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:24:22,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:22,707 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:24:22,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:24:22,708 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:22,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash 336710060, now seen corresponding path program 1 times [2025-03-08 06:24:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:22,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069771471] [2025-03-08 06:24:22,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:22,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:22,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:24:22,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:24:22,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:22,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:22,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069771471] [2025-03-08 06:24:22,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069771471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:22,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:22,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:22,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035283632] [2025-03-08 06:24:22,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:22,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:22,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:22,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:22,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:22,764 INFO L87 Difference]: Start difference. First operand 21218 states and 30693 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-03-08 06:24:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:22,896 INFO L93 Difference]: Finished difference Result 37494 states and 54279 transitions. [2025-03-08 06:24:22,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:22,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2025-03-08 06:24:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:22,918 INFO L225 Difference]: With dead ends: 37494 [2025-03-08 06:24:22,918 INFO L226 Difference]: Without dead ends: 20250 [2025-03-08 06:24:22,925 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-03-08 06:24:22,926 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 66 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:22,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 322 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20250 states. [2025-03-08 06:24:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20250 to 20248. [2025-03-08 06:24:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20248 states, 20247 states have (on average 1.4331505902108954) internal successors, (29017), 20247 states have internal predecessors, (29017), 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-03-08 06:24:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20248 states to 20248 states and 29017 transitions. [2025-03-08 06:24:23,105 INFO L78 Accepts]: Start accepts. Automaton has 20248 states and 29017 transitions. Word has length 97 [2025-03-08 06:24:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:23,105 INFO L471 AbstractCegarLoop]: Abstraction has 20248 states and 29017 transitions. [2025-03-08 06:24:23,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-03-08 06:24:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 20248 states and 29017 transitions. [2025-03-08 06:24:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:24:23,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:23,110 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:23,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:24:23,110 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:23,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1748203545, now seen corresponding path program 1 times [2025-03-08 06:24:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:23,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664527525] [2025-03-08 06:24:23,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:23,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:24:23,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:24:23,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:23,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 06:24:23,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:23,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664527525] [2025-03-08 06:24:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664527525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:23,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:23,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:23,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489652003] [2025-03-08 06:24:23,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:23,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:23,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:23,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:23,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:23,196 INFO L87 Difference]: Start difference. First operand 20248 states and 29017 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-03-08 06:24:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:23,268 INFO L93 Difference]: Finished difference Result 38604 states and 55199 transitions. [2025-03-08 06:24:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:23,268 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 121 [2025-03-08 06:24:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:23,287 INFO L225 Difference]: With dead ends: 38604 [2025-03-08 06:24:23,287 INFO L226 Difference]: Without dead ends: 18468 [2025-03-08 06:24:23,303 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-03-08 06:24:23,304 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 62 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 316 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18468 states. [2025-03-08 06:24:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18468 to 17926. [2025-03-08 06:24:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17926 states, 17925 states have (on average 1.4154532775453277) internal successors, (25372), 17925 states have internal predecessors, (25372), 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-03-08 06:24:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17926 states to 17926 states and 25372 transitions. [2025-03-08 06:24:23,546 INFO L78 Accepts]: Start accepts. Automaton has 17926 states and 25372 transitions. Word has length 121 [2025-03-08 06:24:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:23,546 INFO L471 AbstractCegarLoop]: Abstraction has 17926 states and 25372 transitions. [2025-03-08 06:24:23,546 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-03-08 06:24:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 17926 states and 25372 transitions. [2025-03-08 06:24:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:24:23,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:23,550 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:23,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:24:23,550 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:23,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1832175417, now seen corresponding path program 1 times [2025-03-08 06:24:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197517142] [2025-03-08 06:24:23,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:23,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:24:23,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:24:23,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:23,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 06:24:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197517142] [2025-03-08 06:24:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197517142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:23,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453788401] [2025-03-08 06:24:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:23,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:23,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:23,620 INFO L87 Difference]: Start difference. First operand 17926 states and 25372 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:23,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:23,684 INFO L93 Difference]: Finished difference Result 33990 states and 47950 transitions. [2025-03-08 06:24:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:23,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-08 06:24:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:23,701 INFO L225 Difference]: With dead ends: 33990 [2025-03-08 06:24:23,702 INFO L226 Difference]: Without dead ends: 16164 [2025-03-08 06:24:23,715 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-03-08 06:24:23,716 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 55 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:23,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 316 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16164 states. [2025-03-08 06:24:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16164 to 15658. [2025-03-08 06:24:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15658 states, 15657 states have (on average 1.3951587149517788) internal successors, (21844), 15657 states have internal predecessors, (21844), 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-03-08 06:24:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15658 states to 15658 states and 21844 transitions. [2025-03-08 06:24:23,960 INFO L78 Accepts]: Start accepts. Automaton has 15658 states and 21844 transitions. Word has length 122 [2025-03-08 06:24:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:23,960 INFO L471 AbstractCegarLoop]: Abstraction has 15658 states and 21844 transitions. [2025-03-08 06:24:23,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states and 21844 transitions. [2025-03-08 06:24:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:24:23,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:23,964 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:24:23,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:24:23,964 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:23,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash -506547666, now seen corresponding path program 1 times [2025-03-08 06:24:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:23,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369434668] [2025-03-08 06:24:23,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:23,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:24:23,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:24:23,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:23,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 06:24:24,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:24,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369434668] [2025-03-08 06:24:24,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369434668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:24,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:24,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:24,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395681798] [2025-03-08 06:24:24,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:24,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:24,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:24,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:24,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:24,068 INFO L87 Difference]: Start difference. First operand 15658 states and 21844 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-03-08 06:24:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:24,157 INFO L93 Difference]: Finished difference Result 44926 states and 62294 transitions. [2025-03-08 06:24:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:24,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 123 [2025-03-08 06:24:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:24,189 INFO L225 Difference]: With dead ends: 44926 [2025-03-08 06:24:24,189 INFO L226 Difference]: Without dead ends: 29368 [2025-03-08 06:24:24,205 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-03-08 06:24:24,206 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 48 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:24,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 318 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29368 states. [2025-03-08 06:24:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29368 to 27014. [2025-03-08 06:24:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27014 states, 27013 states have (on average 1.3769666456891128) internal successors, (37196), 27013 states have internal predecessors, (37196), 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-03-08 06:24:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27014 states to 27014 states and 37196 transitions. [2025-03-08 06:24:24,558 INFO L78 Accepts]: Start accepts. Automaton has 27014 states and 37196 transitions. Word has length 123 [2025-03-08 06:24:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:24,558 INFO L471 AbstractCegarLoop]: Abstraction has 27014 states and 37196 transitions. [2025-03-08 06:24:24,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-03-08 06:24:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 27014 states and 37196 transitions. [2025-03-08 06:24:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:24:24,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:24,562 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 06:24:24,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:24:24,562 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:24,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash -609908051, now seen corresponding path program 1 times [2025-03-08 06:24:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:24,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256030652] [2025-03-08 06:24:24,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:24,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:24:24,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:24:24,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:24,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256030652] [2025-03-08 06:24:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256030652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557273062] [2025-03-08 06:24:24,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:24,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:24,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:24,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:24,650 INFO L87 Difference]: Start difference. First operand 27014 states and 37196 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-03-08 06:24:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:24,763 INFO L93 Difference]: Finished difference Result 47218 states and 64817 transitions. [2025-03-08 06:24:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2025-03-08 06:24:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:24,785 INFO L225 Difference]: With dead ends: 47218 [2025-03-08 06:24:24,785 INFO L226 Difference]: Without dead ends: 20304 [2025-03-08 06:24:24,802 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-03-08 06:24:24,803 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 69 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:24,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20304 states. [2025-03-08 06:24:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20304 to 19966. [2025-03-08 06:24:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19966 states, 19965 states have (on average 1.350212872526922) internal successors, (26957), 19965 states have internal predecessors, (26957), 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-03-08 06:24:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19966 states to 19966 states and 26957 transitions. [2025-03-08 06:24:25,139 INFO L78 Accepts]: Start accepts. Automaton has 19966 states and 26957 transitions. Word has length 124 [2025-03-08 06:24:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:25,140 INFO L471 AbstractCegarLoop]: Abstraction has 19966 states and 26957 transitions. [2025-03-08 06:24:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-03-08 06:24:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 19966 states and 26957 transitions. [2025-03-08 06:24:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:24:25,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:25,142 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:25,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:24:25,142 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1418206527, now seen corresponding path program 1 times [2025-03-08 06:24:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:25,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491104909] [2025-03-08 06:24:25,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:25,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:24:25,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:24:25,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:25,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491104909] [2025-03-08 06:24:25,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491104909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:25,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245751488] [2025-03-08 06:24:25,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:25,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:25,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:25,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:24:25,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:24:25,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:24:25,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:24:25,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:25,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:25,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:24:25,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:24:25,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 06:24:26,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245751488] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:26,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:26,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 7] total 21 [2025-03-08 06:24:26,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130835565] [2025-03-08 06:24:26,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:26,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 06:24:26,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:26,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 06:24:26,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:24:26,320 INFO L87 Difference]: Start difference. First operand 19966 states and 26957 transitions. Second operand has 21 states, 21 states have (on average 16.61904761904762) internal successors, (349), 21 states have internal predecessors, (349), 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-03-08 06:24:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:31,937 INFO L93 Difference]: Finished difference Result 190766 states and 259414 transitions. [2025-03-08 06:24:31,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2025-03-08 06:24:31,937 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 16.61904761904762) internal successors, (349), 21 states have internal predecessors, (349), 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 124 [2025-03-08 06:24:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:32,130 INFO L225 Difference]: With dead ends: 190766 [2025-03-08 06:24:32,131 INFO L226 Difference]: Without dead ends: 170964 [2025-03-08 06:24:32,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11530 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3654, Invalid=24738, Unknown=0, NotChecked=0, Total=28392 [2025-03-08 06:24:32,170 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 5780 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 3004 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5780 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 3004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:32,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5780 Valid, 2035 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 3004 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:24:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170964 states. [2025-03-08 06:24:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170964 to 140200. [2025-03-08 06:24:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140200 states, 140199 states have (on average 1.326871090378676) internal successors, (186026), 140199 states have internal predecessors, (186026), 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-03-08 06:24:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140200 states to 140200 states and 186026 transitions. [2025-03-08 06:24:33,880 INFO L78 Accepts]: Start accepts. Automaton has 140200 states and 186026 transitions. Word has length 124 [2025-03-08 06:24:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:33,881 INFO L471 AbstractCegarLoop]: Abstraction has 140200 states and 186026 transitions. [2025-03-08 06:24:33,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 16.61904761904762) internal successors, (349), 21 states have internal predecessors, (349), 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-03-08 06:24:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 140200 states and 186026 transitions. [2025-03-08 06:24:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:24:33,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:33,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 06:24:33,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:24:34,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-08 06:24:34,085 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:34,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1301975866, now seen corresponding path program 1 times [2025-03-08 06:24:34,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:34,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138643171] [2025-03-08 06:24:34,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:34,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:24:34,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:24:34,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:34,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:34,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138643171] [2025-03-08 06:24:34,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138643171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675887013] [2025-03-08 06:24:34,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:34,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:34,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:34,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:24:34,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:24:34,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:24:34,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:24:34,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:34,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:34,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 06:24:34,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:35,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:38,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675887013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:38,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:38,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 44 [2025-03-08 06:24:38,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644490942] [2025-03-08 06:24:38,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:38,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 06:24:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:38,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 06:24:38,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1739, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 06:24:38,700 INFO L87 Difference]: Start difference. First operand 140200 states and 186026 transitions. Second operand has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 44 states have internal predecessors, (345), 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-03-08 06:24:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:50,595 INFO L93 Difference]: Finished difference Result 1199283 states and 1588170 transitions. [2025-03-08 06:24:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2025-03-08 06:24:50,596 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 44 states have internal predecessors, (345), 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 125 [2025-03-08 06:24:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:52,171 INFO L225 Difference]: With dead ends: 1199283 [2025-03-08 06:24:52,171 INFO L226 Difference]: Without dead ends: 1066304 [2025-03-08 06:24:52,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13618 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=5641, Invalid=36589, Unknown=0, NotChecked=0, Total=42230 [2025-03-08 06:24:52,944 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 10097 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 5027 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10097 SdHoareTripleChecker+Valid, 4232 SdHoareTripleChecker+Invalid, 5194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 5027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:52,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10097 Valid, 4232 Invalid, 5194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 5027 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 06:24:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066304 states. [2025-03-08 06:25:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066304 to 662433. [2025-03-08 06:25:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662433 states, 662432 states have (on average 1.3203000458915028) internal successors, (874609), 662432 states have internal predecessors, (874609), 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-03-08 06:25:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662433 states to 662433 states and 874609 transitions. [2025-03-08 06:25:02,995 INFO L78 Accepts]: Start accepts. Automaton has 662433 states and 874609 transitions. Word has length 125 [2025-03-08 06:25:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:02,995 INFO L471 AbstractCegarLoop]: Abstraction has 662433 states and 874609 transitions. [2025-03-08 06:25:02,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 44 states have internal predecessors, (345), 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-03-08 06:25:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 662433 states and 874609 transitions. [2025-03-08 06:25:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 06:25:03,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:03,005 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 06:25:03,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:25:03,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 06:25:03,206 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:03,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash -993142656, now seen corresponding path program 1 times [2025-03-08 06:25:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:03,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803079236] [2025-03-08 06:25:03,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:03,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:25:03,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:25:03,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:03,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:04,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:04,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803079236] [2025-03-08 06:25:04,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803079236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:25:04,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528074242] [2025-03-08 06:25:04,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:04,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:25:04,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:25:04,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:25:04,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:25:04,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:25:04,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:25:04,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:04,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:04,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 06:25:04,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:25:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:05,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:25:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528074242] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:25:07,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:25:07,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 21] total 51 [2025-03-08 06:25:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955598164] [2025-03-08 06:25:07,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:25:07,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-08 06:25:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:07,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-08 06:25:07,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2282, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 06:25:07,428 INFO L87 Difference]: Start difference. First operand 662433 states and 874609 transitions. Second operand has 52 states, 52 states have (on average 6.769230769230769) internal successors, (352), 51 states have internal predecessors, (352), 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)