./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.6.1.ufo.BOUNDED-12.pals.c.p+lhb-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 448913247e8c38d6975c8299b43203acc4129a19332f08af90d09f73955e1f22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:34:30,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:34:30,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:34:30,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:34:30,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:34:30,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:34:30,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:34:30,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:34:30,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:34:30,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:34:30,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:34:30,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:34:30,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:34:30,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:34:30,718 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:34:30,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:34:30,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:34:30,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:34:30,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:34:30,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:34:30,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:34:30,720 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 -> 448913247e8c38d6975c8299b43203acc4129a19332f08af90d09f73955e1f22 [2025-03-16 19:34:31,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:34:31,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:34:31,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:34:31,021 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:34:31,021 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:34:31,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2025-03-16 19:34:32,095 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b61ddf89/bf6e9ebabac94a5aac054bf731018d2e/FLAG4830f98bb [2025-03-16 19:34:32,394 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:34:32,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2025-03-16 19:34:32,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b61ddf89/bf6e9ebabac94a5aac054bf731018d2e/FLAG4830f98bb [2025-03-16 19:34:32,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b61ddf89/bf6e9ebabac94a5aac054bf731018d2e [2025-03-16 19:34:32,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:34:32,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:34:32,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:34:32,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:34:32,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:34:32,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:32,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4207294d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32, skipping insertion in model container [2025-03-16 19:34:32,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:32,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:34:32,742 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.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[16438,16451] [2025-03-16 19:34:32,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:34:32,849 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:34:32,903 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.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[16438,16451] [2025-03-16 19:34:32,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:34:32,943 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:34:32,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32 WrapperNode [2025-03-16 19:34:32,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:34:32,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:34:32,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:34:32,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:34:32,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:32,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:32,992 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1514 [2025-03-16 19:34:32,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:34:32,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:34:32,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:34:32,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:34:33,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,026 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-16 19:34:33,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:34:33,055 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:34:33,055 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:34:33,055 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:34:33,056 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (1/1) ... [2025-03-16 19:34:33,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:34:33,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:34:33,086 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-16 19:34:33,092 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-16 19:34:33,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:34:33,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:34:33,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:34:33,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:34:33,223 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:34:33,224 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:34:34,085 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654: havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-16 19:34:34,085 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1523: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:34,085 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L335: havoc main_~node6__m6~0#1; [2025-03-16 19:34:34,085 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:34,085 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: havoc main_~node6____CPAchecker_TMP_0~3#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1789: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L468: havoc main_~node6__m6~1#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L601: havoc main_~node6__m6~2#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: havoc main_~node6__m6~3#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node4__m4~0#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1164: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L438: havoc main_~node4__m4~1#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1297: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node4__m4~2#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L704: havoc main_~node4__m4~3#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L275: havoc main_~node2__m2~0#1; [2025-03-16 19:34:34,086 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2323: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L870: havoc main_~node6__m6~4#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node2__m2~1#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1432: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node2__m2~2#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: havoc main_~node2__m2~3#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L840: havoc main_~node4__m4~4#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1699: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2459: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1074: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966: havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L810: havoc main_~node2__m2~4#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1835: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:34:34,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2233: havoc main_~node6____CPAchecker_TMP_0~4#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2101: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1342: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2368: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: havoc main_~node5__m5~0#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1609: havoc main_~node6____CPAchecker_TMP_0~2#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L453: havoc main_~node5__m5~1#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1477: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L586: havoc main_~node5__m5~2#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: havoc main_~node5__m5~3#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L290: havoc main_~node3__m3~0#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1744: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-16 19:34:34,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L423: havoc main_~node3__m3~1#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L556: havoc main_~node3__m3~2#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L259: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L689: havoc main_~node3__m3~3#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L392: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1119: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2011: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L855: havoc main_~node5__m5~4#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L525: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278: havoc main_~node5____CPAchecker_TMP_0~4#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L825: havoc main_~node3__m3~4#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1387: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:34,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2147: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-16 19:34:34,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L794: havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:34:34,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2413: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-16 19:34:34,140 INFO L? ?]: Removed 221 outVars from TransFormulas that were not future-live. [2025-03-16 19:34:34,140 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:34:34,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:34:34,164 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:34:34,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:34:34 BoogieIcfgContainer [2025-03-16 19:34:34,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:34:34,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:34:34,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:34:34,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:34:34,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:34:32" (1/3) ... [2025-03-16 19:34:34,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893f74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:34:34, skipping insertion in model container [2025-03-16 19:34:34,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:32" (2/3) ... [2025-03-16 19:34:34,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893f74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:34:34, skipping insertion in model container [2025-03-16 19:34:34,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:34:34" (3/3) ... [2025-03-16 19:34:34,172 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2025-03-16 19:34:34,183 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:34:34,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c that has 1 procedures, 389 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:34:34,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:34:34,247 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;@740bfe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:34:34,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:34:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 387 states have (on average 1.6640826873385013) internal successors, (644), 388 states have internal predecessors, (644), 0 states have call successors, (0), 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-16 19:34:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 19:34:34,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:34,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:34,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:34,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1635967123, now seen corresponding path program 1 times [2025-03-16 19:34:34,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773132239] [2025-03-16 19:34:34,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:34,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:34,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 19:34:34,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 19:34:34,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:34,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:34,783 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-16 19:34:34,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773132239] [2025-03-16 19:34:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773132239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:34,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:34,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:34,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028336233] [2025-03-16 19:34:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:34,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:34:34,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:34,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:34:34,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:34:34,805 INFO L87 Difference]: Start difference. First operand has 389 states, 387 states have (on average 1.6640826873385013) internal successors, (644), 388 states have internal predecessors, (644), 0 states have call successors, (0), 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 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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-16 19:34:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:34,929 INFO L93 Difference]: Finished difference Result 738 states and 1208 transitions. [2025-03-16 19:34:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:34:34,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-16 19:34:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:34,941 INFO L225 Difference]: With dead ends: 738 [2025-03-16 19:34:34,941 INFO L226 Difference]: Without dead ends: 386 [2025-03-16 19:34:34,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:34:34,946 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 109 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:34,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1749 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-16 19:34:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-16 19:34:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.535064935064935) internal successors, (591), 385 states have internal predecessors, (591), 0 states have call successors, (0), 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-16 19:34:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 591 transitions. [2025-03-16 19:34:34,985 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 591 transitions. Word has length 146 [2025-03-16 19:34:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:34,985 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 591 transitions. [2025-03-16 19:34:34,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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-16 19:34:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 591 transitions. [2025-03-16 19:34:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 19:34:34,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:34,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:34,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:34:34,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:34,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:34,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2067206482, now seen corresponding path program 1 times [2025-03-16 19:34:34,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:34,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104875309] [2025-03-16 19:34:34,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:34,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:35,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 19:34:35,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 19:34:35,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:35,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:35,151 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-16 19:34:35,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:35,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104875309] [2025-03-16 19:34:35,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104875309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:35,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:35,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:35,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131067676] [2025-03-16 19:34:35,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:35,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:35,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:35,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:35,155 INFO L87 Difference]: Start difference. First operand 386 states and 591 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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-16 19:34:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:35,199 INFO L93 Difference]: Finished difference Result 960 states and 1507 transitions. [2025-03-16 19:34:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:35,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2025-03-16 19:34:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:35,202 INFO L225 Difference]: With dead ends: 960 [2025-03-16 19:34:35,202 INFO L226 Difference]: Without dead ends: 623 [2025-03-16 19:34:35,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-16 19:34:35,206 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 406 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:35,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1174 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-03-16 19:34:35,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 621. [2025-03-16 19:34:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 1.553225806451613) internal successors, (963), 620 states have internal predecessors, (963), 0 states have call successors, (0), 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-16 19:34:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 963 transitions. [2025-03-16 19:34:35,224 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 963 transitions. Word has length 185 [2025-03-16 19:34:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:35,224 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 963 transitions. [2025-03-16 19:34:35,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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-16 19:34:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 963 transitions. [2025-03-16 19:34:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 19:34:35,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:35,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:35,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:34:35,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:35,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash 217045867, now seen corresponding path program 1 times [2025-03-16 19:34:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116632148] [2025-03-16 19:34:35,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:35,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 19:34:35,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 19:34:35,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:35,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:35,351 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-16 19:34:35,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:35,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116632148] [2025-03-16 19:34:35,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116632148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:35,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:35,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037519646] [2025-03-16 19:34:35,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:35,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:35,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:35,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:35,353 INFO L87 Difference]: Start difference. First operand 621 states and 963 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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-16 19:34:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:35,400 INFO L93 Difference]: Finished difference Result 1619 states and 2552 transitions. [2025-03-16 19:34:35,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:35,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 188 [2025-03-16 19:34:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:35,406 INFO L225 Difference]: With dead ends: 1619 [2025-03-16 19:34:35,406 INFO L226 Difference]: Without dead ends: 1053 [2025-03-16 19:34:35,419 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-16 19:34:35,419 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 394 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:35,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1059 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-03-16 19:34:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1051. [2025-03-16 19:34:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.562857142857143) internal successors, (1641), 1050 states have internal predecessors, (1641), 0 states have call successors, (0), 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-16 19:34:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1641 transitions. [2025-03-16 19:34:35,453 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1641 transitions. Word has length 188 [2025-03-16 19:34:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:35,453 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1641 transitions. [2025-03-16 19:34:35,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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-16 19:34:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1641 transitions. [2025-03-16 19:34:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-16 19:34:35,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:35,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:35,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:34:35,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:35,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash -188916858, now seen corresponding path program 1 times [2025-03-16 19:34:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:35,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853781121] [2025-03-16 19:34:35,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:35,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-16 19:34:35,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-16 19:34:35,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:35,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:35,598 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-16 19:34:35,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853781121] [2025-03-16 19:34:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853781121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198490706] [2025-03-16 19:34:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:35,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:35,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:35,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:35,601 INFO L87 Difference]: Start difference. First operand 1051 states and 1641 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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-16 19:34:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:35,651 INFO L93 Difference]: Finished difference Result 2819 states and 4444 transitions. [2025-03-16 19:34:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:35,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2025-03-16 19:34:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:35,660 INFO L225 Difference]: With dead ends: 2819 [2025-03-16 19:34:35,660 INFO L226 Difference]: Without dead ends: 1829 [2025-03-16 19:34:35,663 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-16 19:34:35,664 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 380 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:35,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1197 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2025-03-16 19:34:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1827. [2025-03-16 19:34:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1826 states have (on average 1.5646221248630887) internal successors, (2857), 1826 states have internal predecessors, (2857), 0 states have call successors, (0), 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-16 19:34:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2857 transitions. [2025-03-16 19:34:35,716 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2857 transitions. Word has length 191 [2025-03-16 19:34:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:35,716 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2857 transitions. [2025-03-16 19:34:35,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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-16 19:34:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2857 transitions. [2025-03-16 19:34:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-16 19:34:35,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:35,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:35,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:34:35,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:35,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1797254215, now seen corresponding path program 1 times [2025-03-16 19:34:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:35,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881198178] [2025-03-16 19:34:35,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:35,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:35,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-16 19:34:35,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-16 19:34:35,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:35,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:35,878 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-16 19:34:35,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881198178] [2025-03-16 19:34:35,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881198178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:35,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:35,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:35,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239387482] [2025-03-16 19:34:35,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:35,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:35,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:35,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:35,880 INFO L87 Difference]: Start difference. First operand 1827 states and 2857 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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-16 19:34:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:35,941 INFO L93 Difference]: Finished difference Result 4969 states and 7808 transitions. [2025-03-16 19:34:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:35,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2025-03-16 19:34:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:35,953 INFO L225 Difference]: With dead ends: 4969 [2025-03-16 19:34:35,953 INFO L226 Difference]: Without dead ends: 3209 [2025-03-16 19:34:35,956 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-16 19:34:35,957 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 368 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:35,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1019 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2025-03-16 19:34:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 3207. [2025-03-16 19:34:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.5598877105427325) internal successors, (5001), 3206 states have internal predecessors, (5001), 0 states have call successors, (0), 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-16 19:34:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 5001 transitions. [2025-03-16 19:34:36,036 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 5001 transitions. Word has length 194 [2025-03-16 19:34:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:36,036 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 5001 transitions. [2025-03-16 19:34:36,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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-16 19:34:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 5001 transitions. [2025-03-16 19:34:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-16 19:34:36,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:36,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:36,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:34:36,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:36,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1812592740, now seen corresponding path program 1 times [2025-03-16 19:34:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:36,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625199126] [2025-03-16 19:34:36,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:36,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:36,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 19:34:36,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 19:34:36,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:36,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:36,200 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-16 19:34:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625199126] [2025-03-16 19:34:36,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625199126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:36,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:36,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:36,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544914025] [2025-03-16 19:34:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:36,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:36,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:36,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:36,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:36,202 INFO L87 Difference]: Start difference. First operand 3207 states and 5001 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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-16 19:34:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:36,264 INFO L93 Difference]: Finished difference Result 8755 states and 13672 transitions. [2025-03-16 19:34:36,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:36,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2025-03-16 19:34:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:36,282 INFO L225 Difference]: With dead ends: 8755 [2025-03-16 19:34:36,282 INFO L226 Difference]: Without dead ends: 5621 [2025-03-16 19:34:36,287 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-16 19:34:36,288 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 355 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:36,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 999 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5621 states. [2025-03-16 19:34:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5621 to 5619. [2025-03-16 19:34:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5619 states, 5618 states have (on average 1.5494838020647916) internal successors, (8705), 5618 states have internal predecessors, (8705), 0 states have call successors, (0), 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-16 19:34:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 8705 transitions. [2025-03-16 19:34:36,393 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 8705 transitions. Word has length 197 [2025-03-16 19:34:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:36,393 INFO L471 AbstractCegarLoop]: Abstraction has 5619 states and 8705 transitions. [2025-03-16 19:34:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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-16 19:34:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 8705 transitions. [2025-03-16 19:34:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 19:34:36,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:36,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:36,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:34:36,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash 496132709, now seen corresponding path program 1 times [2025-03-16 19:34:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:36,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96680403] [2025-03-16 19:34:36,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:36,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 19:34:36,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 19:34:36,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:36,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:36,522 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-16 19:34:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:36,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96680403] [2025-03-16 19:34:36,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96680403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:36,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:36,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826665195] [2025-03-16 19:34:36,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:36,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:36,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:36,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:36,523 INFO L87 Difference]: Start difference. First operand 5619 states and 8705 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-16 19:34:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:36,605 INFO L93 Difference]: Finished difference Result 15285 states and 23648 transitions. [2025-03-16 19:34:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:36,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2025-03-16 19:34:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:36,634 INFO L225 Difference]: With dead ends: 15285 [2025-03-16 19:34:36,636 INFO L226 Difference]: Without dead ends: 9745 [2025-03-16 19:34:36,645 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-16 19:34:36,646 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 342 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:36,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 979 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9745 states. [2025-03-16 19:34:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9745 to 9743. [2025-03-16 19:34:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9743 states, 9742 states have (on average 1.5332580578936563) internal successors, (14937), 9742 states have internal predecessors, (14937), 0 states have call successors, (0), 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-16 19:34:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9743 states to 9743 states and 14937 transitions. [2025-03-16 19:34:36,887 INFO L78 Accepts]: Start accepts. Automaton has 9743 states and 14937 transitions. Word has length 200 [2025-03-16 19:34:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:36,887 INFO L471 AbstractCegarLoop]: Abstraction has 9743 states and 14937 transitions. [2025-03-16 19:34:36,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-16 19:34:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9743 states and 14937 transitions. [2025-03-16 19:34:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-16 19:34:36,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:36,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:36,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:34:36,903 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:36,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1390760976, now seen corresponding path program 1 times [2025-03-16 19:34:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:36,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523190036] [2025-03-16 19:34:36,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:36,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:36,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-16 19:34:36,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-16 19:34:36,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:36,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:37,134 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-16 19:34:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:37,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523190036] [2025-03-16 19:34:37,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523190036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:37,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:37,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9560861] [2025-03-16 19:34:37,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:37,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:37,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:37,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:37,136 INFO L87 Difference]: Start difference. First operand 9743 states and 14937 transitions. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 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-16 19:34:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:38,125 INFO L93 Difference]: Finished difference Result 106344 states and 162310 transitions. [2025-03-16 19:34:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:38,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-03-16 19:34:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:38,408 INFO L225 Difference]: With dead ends: 106344 [2025-03-16 19:34:38,408 INFO L226 Difference]: Without dead ends: 96686 [2025-03-16 19:34:38,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:34:38,436 INFO L435 NwaCegarLoop]: 1867 mSDtfsCounter, 4514 mSDsluCounter, 7239 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4514 SdHoareTripleChecker+Valid, 9106 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:38,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4514 Valid, 9106 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96686 states. [2025-03-16 19:34:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96686 to 19330. [2025-03-16 19:34:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19330 states, 19329 states have (on average 1.507734492213772) internal successors, (29143), 19329 states have internal predecessors, (29143), 0 states have call successors, (0), 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-16 19:34:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 29143 transitions. [2025-03-16 19:34:39,323 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 29143 transitions. Word has length 203 [2025-03-16 19:34:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:39,323 INFO L471 AbstractCegarLoop]: Abstraction has 19330 states and 29143 transitions. [2025-03-16 19:34:39,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 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-16 19:34:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 29143 transitions. [2025-03-16 19:34:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-16 19:34:39,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:39,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:39,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:34:39,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:39,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:39,407 INFO L85 PathProgramCache]: Analyzing trace with hash -695710365, now seen corresponding path program 1 times [2025-03-16 19:34:39,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:39,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589146356] [2025-03-16 19:34:39,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:39,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:39,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 19:34:39,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 19:34:39,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:39,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:39,512 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-16 19:34:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589146356] [2025-03-16 19:34:39,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589146356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:39,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:39,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092367474] [2025-03-16 19:34:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:39,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:39,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:39,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:39,514 INFO L87 Difference]: Start difference. First operand 19330 states and 29143 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-16 19:34:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:39,632 INFO L93 Difference]: Finished difference Result 46571 states and 70146 transitions. [2025-03-16 19:34:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:39,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-03-16 19:34:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:39,674 INFO L225 Difference]: With dead ends: 46571 [2025-03-16 19:34:39,675 INFO L226 Difference]: Without dead ends: 27324 [2025-03-16 19:34:39,696 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-16 19:34:39,696 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 415 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:39,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1320 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27324 states. [2025-03-16 19:34:39,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27324 to 27322. [2025-03-16 19:34:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27322 states, 27321 states have (on average 1.4902089967424326) internal successors, (40714), 27321 states have internal predecessors, (40714), 0 states have call successors, (0), 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-16 19:34:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27322 states to 27322 states and 40714 transitions. [2025-03-16 19:34:40,054 INFO L78 Accepts]: Start accepts. Automaton has 27322 states and 40714 transitions. Word has length 207 [2025-03-16 19:34:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:40,054 INFO L471 AbstractCegarLoop]: Abstraction has 27322 states and 40714 transitions. [2025-03-16 19:34:40,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-16 19:34:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 27322 states and 40714 transitions. [2025-03-16 19:34:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-16 19:34:40,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:40,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:40,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:34:40,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:40,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:40,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1564176330, now seen corresponding path program 1 times [2025-03-16 19:34:40,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:40,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531013372] [2025-03-16 19:34:40,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:40,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:40,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 19:34:40,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 19:34:40,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:40,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:40,574 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-16 19:34:40,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:40,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531013372] [2025-03-16 19:34:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531013372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:40,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:40,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20298826] [2025-03-16 19:34:40,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:40,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:40,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:40,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:40,578 INFO L87 Difference]: Start difference. First operand 27322 states and 40714 transitions. Second operand has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 0 states have call successors, (0), 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-16 19:34:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:41,090 INFO L93 Difference]: Finished difference Result 54562 states and 81332 transitions. [2025-03-16 19:34:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:41,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-03-16 19:34:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:41,135 INFO L225 Difference]: With dead ends: 54562 [2025-03-16 19:34:41,136 INFO L226 Difference]: Without dead ends: 27324 [2025-03-16 19:34:41,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:34:41,164 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 2150 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 2772 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:41,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 2772 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27324 states. [2025-03-16 19:34:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27324 to 27322. [2025-03-16 19:34:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27322 states, 27321 states have (on average 1.4772885326305771) internal successors, (40361), 27321 states have internal predecessors, (40361), 0 states have call successors, (0), 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-16 19:34:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27322 states to 27322 states and 40361 transitions. [2025-03-16 19:34:41,565 INFO L78 Accepts]: Start accepts. Automaton has 27322 states and 40361 transitions. Word has length 207 [2025-03-16 19:34:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:41,566 INFO L471 AbstractCegarLoop]: Abstraction has 27322 states and 40361 transitions. [2025-03-16 19:34:41,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 0 states have call successors, (0), 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-16 19:34:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 27322 states and 40361 transitions. [2025-03-16 19:34:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 19:34:41,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:41,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:41,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:34:41,600 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:41,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1966225113, now seen corresponding path program 1 times [2025-03-16 19:34:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888843734] [2025-03-16 19:34:41,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:41,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 19:34:41,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 19:34:41,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:41,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:41,722 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-16 19:34:41,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:41,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888843734] [2025-03-16 19:34:41,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888843734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:41,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:41,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:41,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979736391] [2025-03-16 19:34:41,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:41,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:41,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:41,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:41,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:41,724 INFO L87 Difference]: Start difference. First operand 27322 states and 40361 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:34:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:42,174 INFO L93 Difference]: Finished difference Result 77792 states and 114801 transitions. [2025-03-16 19:34:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:42,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-03-16 19:34:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:42,242 INFO L225 Difference]: With dead ends: 77792 [2025-03-16 19:34:42,242 INFO L226 Difference]: Without dead ends: 54254 [2025-03-16 19:34:42,266 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-16 19:34:42,267 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 404 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:42,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 650 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54254 states. [2025-03-16 19:34:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54254 to 54252. [2025-03-16 19:34:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54252 states, 54251 states have (on average 1.4687839855486535) internal successors, (79683), 54251 states have internal predecessors, (79683), 0 states have call successors, (0), 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-16 19:34:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54252 states to 54252 states and 79683 transitions. [2025-03-16 19:34:42,804 INFO L78 Accepts]: Start accepts. Automaton has 54252 states and 79683 transitions. Word has length 208 [2025-03-16 19:34:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:42,804 INFO L471 AbstractCegarLoop]: Abstraction has 54252 states and 79683 transitions. [2025-03-16 19:34:42,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:34:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 54252 states and 79683 transitions. [2025-03-16 19:34:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 19:34:42,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:42,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:42,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:34:42,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:42,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash -212490937, now seen corresponding path program 1 times [2025-03-16 19:34:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:42,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586187716] [2025-03-16 19:34:42,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:42,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 19:34:43,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 19:34:43,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:43,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:43,239 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-16 19:34:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586187716] [2025-03-16 19:34:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586187716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513401447] [2025-03-16 19:34:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:43,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:43,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:43,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:43,241 INFO L87 Difference]: Start difference. First operand 54252 states and 79683 transitions. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:34:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:44,161 INFO L93 Difference]: Finished difference Result 322467 states and 471945 transitions. [2025-03-16 19:34:44,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:44,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-03-16 19:34:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:44,748 INFO L225 Difference]: With dead ends: 322467 [2025-03-16 19:34:44,748 INFO L226 Difference]: Without dead ends: 285465 [2025-03-16 19:34:44,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:44,814 INFO L435 NwaCegarLoop]: 1643 mSDtfsCounter, 3800 mSDsluCounter, 4219 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3800 SdHoareTripleChecker+Valid, 5862 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:44,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3800 Valid, 5862 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285465 states. [2025-03-16 19:34:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285465 to 103673. [2025-03-16 19:34:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103673 states, 103672 states have (on average 1.4603171541013966) internal successors, (151394), 103672 states have internal predecessors, (151394), 0 states have call successors, (0), 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-16 19:34:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103673 states to 103673 states and 151394 transitions. [2025-03-16 19:34:47,268 INFO L78 Accepts]: Start accepts. Automaton has 103673 states and 151394 transitions. Word has length 208 [2025-03-16 19:34:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:47,268 INFO L471 AbstractCegarLoop]: Abstraction has 103673 states and 151394 transitions. [2025-03-16 19:34:47,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:34:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 103673 states and 151394 transitions. [2025-03-16 19:34:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 19:34:47,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:47,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:47,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:34:47,383 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:47,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:47,383 INFO L85 PathProgramCache]: Analyzing trace with hash 530637280, now seen corresponding path program 1 times [2025-03-16 19:34:47,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:47,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246692969] [2025-03-16 19:34:47,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:47,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 19:34:47,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 19:34:47,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:47,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:47,663 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-16 19:34:47,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246692969] [2025-03-16 19:34:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246692969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:47,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:47,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858562062] [2025-03-16 19:34:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:47,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:47,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:47,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:47,665 INFO L87 Difference]: Start difference. First operand 103673 states and 151394 transitions. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:34:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:49,310 INFO L93 Difference]: Finished difference Result 365511 states and 534261 transitions. [2025-03-16 19:34:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:49,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-03-16 19:34:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:49,641 INFO L225 Difference]: With dead ends: 365511 [2025-03-16 19:34:49,641 INFO L226 Difference]: Without dead ends: 330213 [2025-03-16 19:34:49,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:49,709 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 4015 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4015 SdHoareTripleChecker+Valid, 4814 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:49,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4015 Valid, 4814 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:34:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330213 states. [2025-03-16 19:34:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330213 to 168677. [2025-03-16 19:34:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168677 states, 168676 states have (on average 1.452725936114207) internal successors, (245040), 168676 states have internal predecessors, (245040), 0 states have call successors, (0), 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-16 19:34:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168677 states to 168677 states and 245040 transitions. [2025-03-16 19:34:52,961 INFO L78 Accepts]: Start accepts. Automaton has 168677 states and 245040 transitions. Word has length 208 [2025-03-16 19:34:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:52,961 INFO L471 AbstractCegarLoop]: Abstraction has 168677 states and 245040 transitions. [2025-03-16 19:34:52,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:34:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 168677 states and 245040 transitions. [2025-03-16 19:34:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 19:34:53,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:53,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:34:53,450 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1180389396, now seen corresponding path program 1 times [2025-03-16 19:34:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191618143] [2025-03-16 19:34:53,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:53,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:53,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 19:34:53,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 19:34:53,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:53,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:53,779 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-16 19:34:53,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:53,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191618143] [2025-03-16 19:34:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191618143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:53,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:53,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200864289] [2025-03-16 19:34:53,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:53,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:53,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:53,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:53,781 INFO L87 Difference]: Start difference. First operand 168677 states and 245040 transitions. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:34:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:55,359 INFO L93 Difference]: Finished difference Result 406087 states and 592821 transitions. [2025-03-16 19:34:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-03-16 19:34:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:55,697 INFO L225 Difference]: With dead ends: 406087 [2025-03-16 19:34:55,697 INFO L226 Difference]: Without dead ends: 370261 [2025-03-16 19:34:55,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:55,742 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 3769 mSDsluCounter, 4066 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3769 SdHoareTripleChecker+Valid, 5442 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:55,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3769 Valid, 5442 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:34:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370261 states. [2025-03-16 19:34:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370261 to 212937. [2025-03-16 19:34:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212937 states, 212936 states have (on average 1.45169440583086) internal successors, (309118), 212936 states have internal predecessors, (309118), 0 states have call successors, (0), 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-16 19:34:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212937 states to 212937 states and 309118 transitions. [2025-03-16 19:34:59,338 INFO L78 Accepts]: Start accepts. Automaton has 212937 states and 309118 transitions. Word has length 208 [2025-03-16 19:34:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:59,339 INFO L471 AbstractCegarLoop]: Abstraction has 212937 states and 309118 transitions. [2025-03-16 19:34:59,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:34:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 212937 states and 309118 transitions. [2025-03-16 19:34:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 19:34:59,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:59,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:34:59,948 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:59,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:59,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1438095672, now seen corresponding path program 1 times [2025-03-16 19:34:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:59,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192576064] [2025-03-16 19:34:59,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:59,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 19:34:59,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 19:34:59,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:59,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:00,153 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-16 19:35:00,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:00,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192576064] [2025-03-16 19:35:00,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192576064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:00,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:00,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472392953] [2025-03-16 19:35:00,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:00,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:00,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:00,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:00,155 INFO L87 Difference]: Start difference. First operand 212937 states and 309118 transitions. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:35:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:01,531 INFO L93 Difference]: Finished difference Result 449671 states and 655941 transitions. [2025-03-16 19:35:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:35:01,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-03-16 19:35:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:02,286 INFO L225 Difference]: With dead ends: 449671 [2025-03-16 19:35:02,286 INFO L226 Difference]: Without dead ends: 413245 [2025-03-16 19:35:02,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:02,369 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 3488 mSDsluCounter, 4402 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 5996 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:02,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3488 Valid, 5996 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:35:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413245 states. [2025-03-16 19:35:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413245 to 257914. [2025-03-16 19:35:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257914 states, 257913 states have (on average 1.4513227328595302) internal successors, (374315), 257913 states have internal predecessors, (374315), 0 states have call successors, (0), 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-16 19:35:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257914 states to 257914 states and 374315 transitions. [2025-03-16 19:35:07,095 INFO L78 Accepts]: Start accepts. Automaton has 257914 states and 374315 transitions. Word has length 208 [2025-03-16 19:35:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:07,095 INFO L471 AbstractCegarLoop]: Abstraction has 257914 states and 374315 transitions. [2025-03-16 19:35:07,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:35:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 257914 states and 374315 transitions. [2025-03-16 19:35:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 19:35:07,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:07,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:07,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:35:07,310 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:07,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash 941378810, now seen corresponding path program 1 times [2025-03-16 19:35:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:07,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238217861] [2025-03-16 19:35:07,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:07,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 19:35:07,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 19:35:07,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:07,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:07,843 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-16 19:35:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:07,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238217861] [2025-03-16 19:35:07,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238217861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:07,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:07,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924071833] [2025-03-16 19:35:07,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:07,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:07,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:07,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:07,848 INFO L87 Difference]: Start difference. First operand 257914 states and 374315 transitions. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:35:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:09,353 INFO L93 Difference]: Finished difference Result 496741 states and 724275 transitions. [2025-03-16 19:35:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:35:09,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2025-03-16 19:35:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:09,794 INFO L225 Difference]: With dead ends: 496741 [2025-03-16 19:35:09,794 INFO L226 Difference]: Without dead ends: 459163 [2025-03-16 19:35:09,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:09,880 INFO L435 NwaCegarLoop]: 1752 mSDtfsCounter, 3660 mSDsluCounter, 6070 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3660 SdHoareTripleChecker+Valid, 7822 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:09,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3660 Valid, 7822 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:35:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459163 states. [2025-03-16 19:35:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459163 to 304091. [2025-03-16 19:35:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304091 states, 304090 states have (on average 1.4512940247952908) internal successors, (441324), 304090 states have internal predecessors, (441324), 0 states have call successors, (0), 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-16 19:35:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304091 states to 304091 states and 441324 transitions. [2025-03-16 19:35:15,014 INFO L78 Accepts]: Start accepts. Automaton has 304091 states and 441324 transitions. Word has length 208 [2025-03-16 19:35:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:15,015 INFO L471 AbstractCegarLoop]: Abstraction has 304091 states and 441324 transitions. [2025-03-16 19:35:15,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 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-16 19:35:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 304091 states and 441324 transitions. [2025-03-16 19:35:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 19:35:15,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:15,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:15,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:35:15,374 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:15,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:15,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1558208177, now seen corresponding path program 1 times [2025-03-16 19:35:15,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:15,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031303264] [2025-03-16 19:35:15,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:15,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:15,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 19:35:15,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 19:35:15,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:15,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:15,594 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-16 19:35:15,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031303264] [2025-03-16 19:35:15,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031303264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:15,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:15,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660035284] [2025-03-16 19:35:15,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:15,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:15,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:15,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:15,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:15,597 INFO L87 Difference]: Start difference. First operand 304091 states and 441324 transitions. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)