./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32ba4035a379b8da26cfee0fc23f2d2319a3ce3a6b7562da23c70fa1966559f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:04:00,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:04:00,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:04:00,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:04:00,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:04:00,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:04:00,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:04:00,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:04:00,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:04:00,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:04:00,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:04:00,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:04:00,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:04:00,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:04:00,255 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:04:00,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:04:00,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:04:00,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:04:00,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:04:00,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:04:00,257 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 -> 32ba4035a379b8da26cfee0fc23f2d2319a3ce3a6b7562da23c70fa1966559f1 [2025-03-03 15:04:00,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:04:00,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:04:00,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:04:00,521 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:04:00,522 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:04:00,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-03 15:04:01,726 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/144180ea0/d4476f197b3b413d86e3c581b1f72c86/FLAG4f2b1eaa7 [2025-03-03 15:04:02,115 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:04:02,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-03 15:04:02,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/144180ea0/d4476f197b3b413d86e3c581b1f72c86/FLAG4f2b1eaa7 [2025-03-03 15:04:02,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/144180ea0/d4476f197b3b413d86e3c581b1f72c86 [2025-03-03 15:04:02,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:04:02,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:04:02,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:04:02,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:04:02,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:04:02,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:04:02" (1/1) ... [2025-03-03 15:04:02,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b07512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:02, skipping insertion in model container [2025-03-03 15:04:02,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:04:02" (1/1) ... [2025-03-03 15:04:02,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:04:02,617 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_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[36110,36123] [2025-03-03 15:04:02,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:04:02,814 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:04:02,969 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_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[36110,36123] [2025-03-03 15:04:03,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:04:03,115 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:04:03,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03 WrapperNode [2025-03-03 15:04:03,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:04:03,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:04:03,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:04:03,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:04:03,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,278 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5135 [2025-03-03 15:04:03,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:04:03,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:04:03,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:04:03,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:04:03,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,353 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-03 15:04:03,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:04:03,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:04:03,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:04:03,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:04:03,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (1/1) ... [2025-03-03 15:04:03,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:04:03,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:04:03,474 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-03 15:04:03,476 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-03 15:04:03,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:04:03,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:04:03,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:04:03,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:04:03,655 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:04:03,657 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:04:06,132 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4067: havoc main_~node1____CPAchecker_TMP_3~1#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:04:06,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1426: 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-03 15:04:06,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5523: havoc main_~node3____CPAchecker_TMP_3~3#1;havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:04:06,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6585: havoc main_~node2____CPAchecker_TMP_3~4#1;havoc main_~node2____CPAchecker_TMP_2~4#1;havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-03 15:04:06,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2372: havoc main_~node5____CPAchecker_TMP_3~0#1;havoc main_~node5____CPAchecker_TMP_2~0#1;havoc main_~node5____CPAchecker_TMP_1~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:04:06,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2903: havoc main_~node2____CPAchecker_TMP_3~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:04:06,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4628: havoc main_~node3____CPAchecker_TMP_3~2#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:04:06,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6084: havoc main_~node5____CPAchecker_TMP_3~4#1;havoc main_~node5____CPAchecker_TMP_2~4#1;havoc main_~node5____CPAchecker_TMP_1~4#1;havoc main_~node5____CPAchecker_TMP_0~4#1; [2025-03-03 15:04:06,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5690: havoc main_~node2____CPAchecker_TMP_3~3#1;havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:04:06,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3711: havoc main_~node3____CPAchecker_TMP_3~1#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:04:06,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6752: havoc main_~node1____CPAchecker_TMP_3~4#1;havoc main_~node1____CPAchecker_TMP_2~4#1;havoc main_~node1____CPAchecker_TMP_1~4#1;havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-03 15:04:06,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1738: 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-03 15:04:06,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5189: havoc main_~node5____CPAchecker_TMP_3~3#1;havoc main_~node5____CPAchecker_TMP_2~3#1;havoc main_~node5____CPAchecker_TMP_1~3#1;havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-03 15:04:06,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4795: havoc main_~node2____CPAchecker_TMP_3~2#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:04:06,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2549: havoc main_~node4____CPAchecker_TMP_3~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:04:06,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6251: havoc main_~node4____CPAchecker_TMP_3~4#1;havoc main_~node4____CPAchecker_TMP_2~4#1;havoc main_~node4____CPAchecker_TMP_1~4#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:04:06,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080: havoc main_~node1____CPAchecker_TMP_3~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:04:06,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5857: havoc main_~node1____CPAchecker_TMP_3~3#1;havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-03 15:04:06,136 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3355: havoc main_~node5____CPAchecker_TMP_3~1#1;havoc main_~node5____CPAchecker_TMP_2~1#1;havoc main_~node5____CPAchecker_TMP_1~1#1;havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:04:06,136 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: 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-03 15:04:06,136 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3889: havoc main_~node2____CPAchecker_TMP_3~1#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:04:06,136 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4294: havoc main_~node5____CPAchecker_TMP_3~2#1;havoc main_~node5____CPAchecker_TMP_2~2#1;havoc main_~node5____CPAchecker_TMP_1~2#1;havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-03 15:04:06,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5356: havoc main_~node4____CPAchecker_TMP_3~3#1;havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:04:06,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: 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-03 15:04:06,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4962: havoc main_~node1____CPAchecker_TMP_3~2#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:04:06,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6418: havoc main_~node3____CPAchecker_TMP_3~4#1;havoc main_~node3____CPAchecker_TMP_2~4#1;havoc main_~node3____CPAchecker_TMP_1~4#1;havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:04:06,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2726: havoc main_~node3____CPAchecker_TMP_3~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:04:06,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L217: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r151~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r251~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r351~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r451~0#1, main_~init__r511~0#1, main_~init__r521~0#1, main_~init__r531~0#1, main_~init__r541~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r152~0#1, main_~init__tmp___2~0#1, main_~init__r212~0#1, main_~init__tmp___3~0#1, main_~init__r232~0#1, main_~init__tmp___4~0#1, main_~init__r242~0#1, main_~init__tmp___5~0#1, main_~init__r252~0#1, main_~init__tmp___6~0#1, main_~init__r312~0#1, main_~init__tmp___7~0#1, main_~init__r322~0#1, main_~init__tmp___8~0#1, main_~init__r342~0#1, main_~init__tmp___9~0#1, main_~init__r352~0#1, main_~init__tmp___10~0#1, main_~init__r412~0#1, main_~init__tmp___11~0#1, main_~init__r422~0#1, main_~init__tmp___12~0#1, main_~init__r432~0#1, main_~init__tmp___13~0#1, main_~init__r452~0#1, main_~init__tmp___14~0#1, main_~init__r512~0#1, main_~init__tmp___15~0#1, main_~init__r522~0#1, main_~init__tmp___16~0#1, main_~init__r532~0#1, main_~init__tmp___17~0#1, main_~init__r542~0#1, main_~init__tmp___18~0#1, main_~init__r123~0#1, main_~init__tmp___19~0#1, main_~init__r133~0#1, main_~init__tmp___20~0#1, main_~init__r143~0#1, main_~init__tmp___21~0#1, main_~init__r153~0#1, main_~init__tmp___22~0#1, main_~init__r213~0#1, main_~init__tmp___23~0#1, main_~init__r233~0#1, main_~init__tmp___24~0#1, main_~init__r243~0#1, main_~init__tmp___25~0#1, main_~init__r253~0#1, main_~init__tmp___26~0#1, main_~init__r313~0#1, main_~init__tmp___27~0#1, main_~init__r323~0#1, main_~init__tmp___28~0#1, main_~init__r343~0#1, main_~init__tmp___29~0#1, main_~init__r353~0#1, main_~init__tmp___30~0#1, main_~init__r413~0#1, main_~init__tmp___31~0#1, main_~init__r423~0#1, main_~init__tmp___32~0#1, main_~init__r433~0#1, main_~init__tmp___33~0#1, main_~init__r453~0#1, main_~init__tmp___34~0#1, main_~init__r513~0#1, main_~init__tmp___35~0#1, main_~init__r523~0#1, main_~init__tmp___36~0#1, main_~init__r533~0#1, main_~init__tmp___37~0#1, main_~init__r543~0#1, main_~init__tmp___38~0#1, main_~init__r124~0#1, main_~init__tmp___39~0#1, main_~init__r134~0#1, main_~init__tmp___40~0#1, main_~init__r144~0#1, main_~init__tmp___41~0#1, main_~init__r154~0#1, main_~init__tmp___42~0#1, main_~init__r214~0#1, main_~init__tmp___43~0#1, main_~init__r234~0#1, main_~init__tmp___44~0#1, main_~init__r244~0#1, main_~init__tmp___45~0#1, main_~init__r254~0#1, main_~init__tmp___46~0#1, main_~init__r314~0#1, main_~init__tmp___47~0#1, main_~init__r324~0#1, main_~init__tmp___48~0#1, main_~init__r344~0#1, main_~init__tmp___49~0#1, main_~init__r354~0#1, main_~init__tmp___50~0#1, main_~init__r414~0#1, main_~init__tmp___51~0#1, main_~init__r424~0#1, main_~init__tmp___52~0#1, main_~init__r434~0#1, main_~init__tmp___53~0#1, main_~init__r454~0#1, main_~init__tmp___54~0#1, main_~init__r514~0#1, main_~init__tmp___55~0#1, main_~init__r524~0#1, main_~init__tmp___56~0#1, main_~init__r534~0#1, main_~init__tmp___57~0#1, main_~init__r544~0#1, main_~init__tmp___58~0#1, main_~init__tmp___59~0#1; [2025-03-03 15:04:06,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~node4____CPAchecker_TMP_3~1#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:04:06,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4461: havoc main_~node4____CPAchecker_TMP_3~2#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:04:06,582 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-03-03 15:04:06,582 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:04:06,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:04:06,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:04:06,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:04:06 BoogieIcfgContainer [2025-03-03 15:04:06,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:04:06,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:04:06,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:04:06,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:04:06,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:04:02" (1/3) ... [2025-03-03 15:04:06,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40011557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:04:06, skipping insertion in model container [2025-03-03 15:04:06,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:04:03" (2/3) ... [2025-03-03 15:04:06,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40011557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:04:06, skipping insertion in model container [2025-03-03 15:04:06,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:04:06" (3/3) ... [2025-03-03 15:04:06,629 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-03 15:04:06,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:04:06,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 1414 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:04:06,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:04:06,729 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;@233bfbbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:04:06,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:04:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 1414 states, 1412 states have (on average 1.7832861189801699) internal successors, (2518), 1413 states have internal predecessors, (2518), 0 states have call successors, (0), 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-03 15:04:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-03 15:04:06,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:06,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:06,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:06,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1591040380, now seen corresponding path program 1 times [2025-03-03 15:04:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:06,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313151132] [2025-03-03 15:04:06,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:06,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:06,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-03 15:04:07,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-03 15:04:07,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:07,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:07,542 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-03 15:04:07,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313151132] [2025-03-03 15:04:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313151132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:07,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:07,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:07,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319049812] [2025-03-03 15:04:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:07,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:07,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:07,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:07,570 INFO L87 Difference]: Start difference. First operand has 1414 states, 1412 states have (on average 1.7832861189801699) internal successors, (2518), 1413 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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-03 15:04:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:07,734 INFO L93 Difference]: Finished difference Result 2858 states and 5003 transitions. [2025-03-03 15:04:07,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:07,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 336 [2025-03-03 15:04:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:07,758 INFO L225 Difference]: With dead ends: 2858 [2025-03-03 15:04:07,759 INFO L226 Difference]: Without dead ends: 1985 [2025-03-03 15:04:07,764 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-03 15:04:07,766 INFO L435 NwaCegarLoop]: 2979 mSDtfsCounter, 1180 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 5272 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:07,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 5272 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2025-03-03 15:04:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1983. [2025-03-03 15:04:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1982 states have (on average 1.6796165489404642) internal successors, (3329), 1982 states have internal predecessors, (3329), 0 states have call successors, (0), 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-03 15:04:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 3329 transitions. [2025-03-03 15:04:07,856 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 3329 transitions. Word has length 336 [2025-03-03 15:04:07,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:07,858 INFO L471 AbstractCegarLoop]: Abstraction has 1983 states and 3329 transitions. [2025-03-03 15:04:07,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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-03 15:04:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 3329 transitions. [2025-03-03 15:04:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 15:04:07,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:07,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:04:07,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:07,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash -357997788, now seen corresponding path program 1 times [2025-03-03 15:04:07,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:07,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880575332] [2025-03-03 15:04:07,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:07,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:07,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 15:04:08,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 15:04:08,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:08,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:08,273 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-03 15:04:08,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:08,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880575332] [2025-03-03 15:04:08,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880575332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:08,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:08,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398579138] [2025-03-03 15:04:08,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:08,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:08,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:08,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:08,278 INFO L87 Difference]: Start difference. First operand 1983 states and 3329 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-03 15:04:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:08,380 INFO L93 Difference]: Finished difference Result 4390 states and 7266 transitions. [2025-03-03 15:04:08,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:08,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 338 [2025-03-03 15:04:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:08,394 INFO L225 Difference]: With dead ends: 4390 [2025-03-03 15:04:08,395 INFO L226 Difference]: Without dead ends: 2977 [2025-03-03 15:04:08,398 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-03 15:04:08,399 INFO L435 NwaCegarLoop]: 2762 mSDtfsCounter, 1094 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 4893 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:08,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 4893 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2025-03-03 15:04:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2975. [2025-03-03 15:04:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 1.6624075319435103) internal successors, (4944), 2974 states have internal predecessors, (4944), 0 states have call successors, (0), 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-03 15:04:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4944 transitions. [2025-03-03 15:04:08,471 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4944 transitions. Word has length 338 [2025-03-03 15:04:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:08,471 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 4944 transitions. [2025-03-03 15:04:08,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-03 15:04:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4944 transitions. [2025-03-03 15:04:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 15:04:08,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:08,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:08,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:04:08,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:08,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:08,484 INFO L85 PathProgramCache]: Analyzing trace with hash 308604690, now seen corresponding path program 1 times [2025-03-03 15:04:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:08,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071471599] [2025-03-03 15:04:08,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:08,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 15:04:08,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 15:04:08,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:08,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:08,865 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-03 15:04:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:08,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071471599] [2025-03-03 15:04:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071471599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:08,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:08,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:08,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746138270] [2025-03-03 15:04:08,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:08,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:08,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:08,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:08,868 INFO L87 Difference]: Start difference. First operand 2975 states and 4944 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-03 15:04:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:09,023 INFO L93 Difference]: Finished difference Result 7030 states and 11558 transitions. [2025-03-03 15:04:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:09,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 340 [2025-03-03 15:04:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:09,040 INFO L225 Difference]: With dead ends: 7030 [2025-03-03 15:04:09,040 INFO L226 Difference]: Without dead ends: 4648 [2025-03-03 15:04:09,044 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-03 15:04:09,046 INFO L435 NwaCegarLoop]: 2454 mSDtfsCounter, 1070 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:09,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 4533 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2025-03-03 15:04:09,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 4646. [2025-03-03 15:04:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4646 states, 4645 states have (on average 1.6469321851453176) internal successors, (7650), 4645 states have internal predecessors, (7650), 0 states have call successors, (0), 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-03 15:04:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4646 states to 4646 states and 7650 transitions. [2025-03-03 15:04:09,137 INFO L78 Accepts]: Start accepts. Automaton has 4646 states and 7650 transitions. Word has length 340 [2025-03-03 15:04:09,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:09,137 INFO L471 AbstractCegarLoop]: Abstraction has 4646 states and 7650 transitions. [2025-03-03 15:04:09,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-03 15:04:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4646 states and 7650 transitions. [2025-03-03 15:04:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 15:04:09,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:09,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:09,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:04:09,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:09,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:09,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1157261124, now seen corresponding path program 1 times [2025-03-03 15:04:09,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:09,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283024223] [2025-03-03 15:04:09,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:09,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:09,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 15:04:09,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 15:04:09,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:09,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:04:09,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:09,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283024223] [2025-03-03 15:04:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283024223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:09,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:09,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962977371] [2025-03-03 15:04:09,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:09,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:09,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:09,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:09,412 INFO L87 Difference]: Start difference. First operand 4646 states and 7650 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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-03 15:04:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:09,546 INFO L93 Difference]: Finished difference Result 11385 states and 18587 transitions. [2025-03-03 15:04:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:09,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 342 [2025-03-03 15:04:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:09,569 INFO L225 Difference]: With dead ends: 11385 [2025-03-03 15:04:09,569 INFO L226 Difference]: Without dead ends: 7355 [2025-03-03 15:04:09,576 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-03 15:04:09,577 INFO L435 NwaCegarLoop]: 2378 mSDtfsCounter, 1045 mSDsluCounter, 2027 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 4405 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:09,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 4405 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7355 states. [2025-03-03 15:04:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7355 to 7353. [2025-03-03 15:04:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7353 states, 7352 states have (on average 1.631664853101197) internal successors, (11996), 7352 states have internal predecessors, (11996), 0 states have call successors, (0), 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-03 15:04:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7353 states to 7353 states and 11996 transitions. [2025-03-03 15:04:09,708 INFO L78 Accepts]: Start accepts. Automaton has 7353 states and 11996 transitions. Word has length 342 [2025-03-03 15:04:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:09,709 INFO L471 AbstractCegarLoop]: Abstraction has 7353 states and 11996 transitions. [2025-03-03 15:04:09,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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-03 15:04:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 7353 states and 11996 transitions. [2025-03-03 15:04:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-03 15:04:09,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:09,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:09,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:04:09,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:09,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1859557088, now seen corresponding path program 1 times [2025-03-03 15:04:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074675599] [2025-03-03 15:04:09,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:09,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 15:04:09,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 15:04:09,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:09,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:09,933 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-03 15:04:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074675599] [2025-03-03 15:04:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074675599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:09,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:09,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:04:09,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798187318] [2025-03-03 15:04:09,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:09,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:04:09,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:09,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:04:09,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:04:09,936 INFO L87 Difference]: Start difference. First operand 7353 states and 11996 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-03 15:04:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:10,095 INFO L93 Difference]: Finished difference Result 18204 states and 29464 transitions. [2025-03-03 15:04:10,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:04:10,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2025-03-03 15:04:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:10,138 INFO L225 Difference]: With dead ends: 18204 [2025-03-03 15:04:10,138 INFO L226 Difference]: Without dead ends: 11490 [2025-03-03 15:04:10,150 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-03 15:04:10,151 INFO L435 NwaCegarLoop]: 2570 mSDtfsCounter, 1019 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:10,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 4546 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2025-03-03 15:04:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 11488. [2025-03-03 15:04:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11488 states, 11487 states have (on average 1.6138243231479064) internal successors, (18538), 11487 states have internal predecessors, (18538), 0 states have call successors, (0), 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-03 15:04:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 18538 transitions. [2025-03-03 15:04:10,417 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 18538 transitions. Word has length 344 [2025-03-03 15:04:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:10,417 INFO L471 AbstractCegarLoop]: Abstraction has 11488 states and 18538 transitions. [2025-03-03 15:04:10,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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-03 15:04:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 18538 transitions. [2025-03-03 15:04:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-03 15:04:10,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:10,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:10,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:04:10,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:10,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1384837161, now seen corresponding path program 1 times [2025-03-03 15:04:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:10,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445279266] [2025-03-03 15:04:10,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:10,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-03 15:04:10,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-03 15:04:10,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:10,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:10,975 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-03 15:04:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:10,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445279266] [2025-03-03 15:04:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445279266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:10,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:04:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177580756] [2025-03-03 15:04:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:10,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:04:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:10,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:04:10,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:04:10,981 INFO L87 Difference]: Start difference. First operand 11488 states and 18538 transitions. Second operand has 7 states, 7 states have (on average 49.42857142857143) internal successors, (346), 7 states have internal predecessors, (346), 0 states have call successors, (0), 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-03 15:04:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:11,612 INFO L93 Difference]: Finished difference Result 48548 states and 81428 transitions. [2025-03-03 15:04:11,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:04:11,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.42857142857143) internal successors, (346), 7 states have internal predecessors, (346), 0 states have call successors, (0), 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 346 [2025-03-03 15:04:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:11,706 INFO L225 Difference]: With dead ends: 48548 [2025-03-03 15:04:11,706 INFO L226 Difference]: Without dead ends: 45138 [2025-03-03 15:04:11,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:04:11,734 INFO L435 NwaCegarLoop]: 2271 mSDtfsCounter, 11533 mSDsluCounter, 8690 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11533 SdHoareTripleChecker+Valid, 10961 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:11,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11533 Valid, 10961 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:04:11,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45138 states. [2025-03-03 15:04:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45138 to 16673. [2025-03-03 15:04:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16673 states, 16672 states have (on average 1.6306381957773513) internal successors, (27186), 16672 states have internal predecessors, (27186), 0 states have call successors, (0), 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-03 15:04:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 27186 transitions. [2025-03-03 15:04:12,223 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 27186 transitions. Word has length 346 [2025-03-03 15:04:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:12,226 INFO L471 AbstractCegarLoop]: Abstraction has 16673 states and 27186 transitions. [2025-03-03 15:04:12,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.42857142857143) internal successors, (346), 7 states have internal predecessors, (346), 0 states have call successors, (0), 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-03 15:04:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 27186 transitions. [2025-03-03 15:04:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 15:04:12,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:12,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:12,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:04:12,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:12,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:12,248 INFO L85 PathProgramCache]: Analyzing trace with hash 21792576, now seen corresponding path program 1 times [2025-03-03 15:04:12,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:12,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048887571] [2025-03-03 15:04:12,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:12,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:12,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 15:04:12,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 15:04:12,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:12,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:12,601 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-03 15:04:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:12,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048887571] [2025-03-03 15:04:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048887571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:12,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:12,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:04:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317465568] [2025-03-03 15:04:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:12,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:04:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:12,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:04:12,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:04:12,602 INFO L87 Difference]: Start difference. First operand 16673 states and 27186 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 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-03 15:04:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:12,868 INFO L93 Difference]: Finished difference Result 39513 states and 65749 transitions. [2025-03-03 15:04:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:04:12,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 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 347 [2025-03-03 15:04:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:12,931 INFO L225 Difference]: With dead ends: 39513 [2025-03-03 15:04:12,931 INFO L226 Difference]: Without dead ends: 32695 [2025-03-03 15:04:12,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:04:12,956 INFO L435 NwaCegarLoop]: 2283 mSDtfsCounter, 3099 mSDsluCounter, 3482 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 5765 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:12,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 5765 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32695 states. [2025-03-03 15:04:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32695 to 25218. [2025-03-03 15:04:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25218 states, 25217 states have (on average 1.6456358805567672) internal successors, (41498), 25217 states have internal predecessors, (41498), 0 states have call successors, (0), 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-03 15:04:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25218 states to 25218 states and 41498 transitions. [2025-03-03 15:04:13,411 INFO L78 Accepts]: Start accepts. Automaton has 25218 states and 41498 transitions. Word has length 347 [2025-03-03 15:04:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:13,411 INFO L471 AbstractCegarLoop]: Abstraction has 25218 states and 41498 transitions. [2025-03-03 15:04:13,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 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-03 15:04:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 25218 states and 41498 transitions. [2025-03-03 15:04:13,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 15:04:13,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:13,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:13,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:04:13,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:13,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash 545578928, now seen corresponding path program 1 times [2025-03-03 15:04:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:13,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988937053] [2025-03-03 15:04:13,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:13,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:13,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 15:04:13,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 15:04:13,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:13,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:13,974 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-03 15:04:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988937053] [2025-03-03 15:04:13,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988937053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:13,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:13,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:04:13,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257457649] [2025-03-03 15:04:13,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:13,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:04:13,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:13,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:04:13,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:04:13,977 INFO L87 Difference]: Start difference. First operand 25218 states and 41498 transitions. Second operand has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 7 states have internal predecessors, (347), 0 states have call successors, (0), 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-03 15:04:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:14,476 INFO L93 Difference]: Finished difference Result 94708 states and 158720 transitions. [2025-03-03 15:04:14,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:04:14,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 7 states have internal predecessors, (347), 0 states have call successors, (0), 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 347 [2025-03-03 15:04:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:14,670 INFO L225 Difference]: With dead ends: 94708 [2025-03-03 15:04:14,670 INFO L226 Difference]: Without dead ends: 81106 [2025-03-03 15:04:14,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:04:14,713 INFO L435 NwaCegarLoop]: 2588 mSDtfsCounter, 8060 mSDsluCounter, 7249 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8060 SdHoareTripleChecker+Valid, 9837 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:14,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8060 Valid, 9837 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:04:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81106 states. [2025-03-03 15:04:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81106 to 38862. [2025-03-03 15:04:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38862 states, 38861 states have (on average 1.658578008800597) internal successors, (64454), 38861 states have internal predecessors, (64454), 0 states have call successors, (0), 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-03 15:04:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38862 states to 38862 states and 64454 transitions. [2025-03-03 15:04:15,630 INFO L78 Accepts]: Start accepts. Automaton has 38862 states and 64454 transitions. Word has length 347 [2025-03-03 15:04:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:15,630 INFO L471 AbstractCegarLoop]: Abstraction has 38862 states and 64454 transitions. [2025-03-03 15:04:15,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 7 states have internal predecessors, (347), 0 states have call successors, (0), 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-03 15:04:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 38862 states and 64454 transitions. [2025-03-03 15:04:15,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 15:04:15,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:15,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:15,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:04:15,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:15,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash 677552090, now seen corresponding path program 1 times [2025-03-03 15:04:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:15,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080960963] [2025-03-03 15:04:15,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:15,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:15,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 15:04:15,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 15:04:15,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:15,921 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-03 15:04:15,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:15,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080960963] [2025-03-03 15:04:15,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080960963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:15,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:15,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:04:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131845265] [2025-03-03 15:04:15,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:15,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:04:15,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:15,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:04:15,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:04:15,923 INFO L87 Difference]: Start difference. First operand 38862 states and 64454 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:16,415 INFO L93 Difference]: Finished difference Result 109788 states and 183969 transitions. [2025-03-03 15:04:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:04:16,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-03-03 15:04:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:16,514 INFO L225 Difference]: With dead ends: 109788 [2025-03-03 15:04:16,514 INFO L226 Difference]: Without dead ends: 82586 [2025-03-03 15:04:16,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:04:16,533 INFO L435 NwaCegarLoop]: 2283 mSDtfsCounter, 3040 mSDsluCounter, 3312 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3040 SdHoareTripleChecker+Valid, 5595 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:16,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3040 Valid, 5595 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:16,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82586 states. [2025-03-03 15:04:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82586 to 68044. [2025-03-03 15:04:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68044 states, 68043 states have (on average 1.6647414135179226) internal successors, (113274), 68043 states have internal predecessors, (113274), 0 states have call successors, (0), 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-03 15:04:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68044 states to 68044 states and 113274 transitions. [2025-03-03 15:04:17,334 INFO L78 Accepts]: Start accepts. Automaton has 68044 states and 113274 transitions. Word has length 348 [2025-03-03 15:04:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:17,334 INFO L471 AbstractCegarLoop]: Abstraction has 68044 states and 113274 transitions. [2025-03-03 15:04:17,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 68044 states and 113274 transitions. [2025-03-03 15:04:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 15:04:17,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:17,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:17,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:04:17,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:17,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash -739680937, now seen corresponding path program 1 times [2025-03-03 15:04:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:17,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813840312] [2025-03-03 15:04:17,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:17,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 15:04:17,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 15:04:17,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:17,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:17,944 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-03 15:04:17,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:17,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813840312] [2025-03-03 15:04:17,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813840312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:17,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:17,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:04:17,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980383380] [2025-03-03 15:04:17,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:17,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:04:17,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:17,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:04:17,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:04:17,946 INFO L87 Difference]: Start difference. First operand 68044 states and 113274 transitions. Second operand has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:18,703 INFO L93 Difference]: Finished difference Result 191990 states and 321856 transitions. [2025-03-03 15:04:18,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:04:18,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-03-03 15:04:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:18,982 INFO L225 Difference]: With dead ends: 191990 [2025-03-03 15:04:18,982 INFO L226 Difference]: Without dead ends: 164852 [2025-03-03 15:04:19,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:04:19,055 INFO L435 NwaCegarLoop]: 2942 mSDtfsCounter, 6845 mSDsluCounter, 7521 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6845 SdHoareTripleChecker+Valid, 10463 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:19,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6845 Valid, 10463 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:04:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164852 states. [2025-03-03 15:04:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164852 to 109302. [2025-03-03 15:04:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109302 states, 109301 states have (on average 1.6691338597085115) internal successors, (182438), 109301 states have internal predecessors, (182438), 0 states have call successors, (0), 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-03 15:04:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109302 states to 109302 states and 182438 transitions. [2025-03-03 15:04:20,838 INFO L78 Accepts]: Start accepts. Automaton has 109302 states and 182438 transitions. Word has length 348 [2025-03-03 15:04:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:20,838 INFO L471 AbstractCegarLoop]: Abstraction has 109302 states and 182438 transitions. [2025-03-03 15:04:20,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 109302 states and 182438 transitions. [2025-03-03 15:04:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 15:04:20,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:20,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:20,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:04:20,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:20,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:20,856 INFO L85 PathProgramCache]: Analyzing trace with hash 453683639, now seen corresponding path program 1 times [2025-03-03 15:04:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:20,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003385274] [2025-03-03 15:04:20,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:20,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 15:04:20,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 15:04:20,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:20,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:21,558 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-03 15:04:21,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:21,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003385274] [2025-03-03 15:04:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003385274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:21,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:21,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:04:21,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643895968] [2025-03-03 15:04:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:04:21,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:21,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:04:21,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:04:21,563 INFO L87 Difference]: Start difference. First operand 109302 states and 182438 transitions. Second operand has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:22,634 INFO L93 Difference]: Finished difference Result 219495 states and 368000 transitions. [2025-03-03 15:04:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:04:22,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-03-03 15:04:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:22,942 INFO L225 Difference]: With dead ends: 219495 [2025-03-03 15:04:22,942 INFO L226 Difference]: Without dead ends: 192357 [2025-03-03 15:04:23,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:04:23,000 INFO L435 NwaCegarLoop]: 2997 mSDtfsCounter, 6832 mSDsluCounter, 9282 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6832 SdHoareTripleChecker+Valid, 12279 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:23,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6832 Valid, 12279 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:04:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192357 states. [2025-03-03 15:04:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192357 to 137342. [2025-03-03 15:04:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137342 states, 137341 states have (on average 1.6707465359943499) internal successors, (229462), 137341 states have internal predecessors, (229462), 0 states have call successors, (0), 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-03 15:04:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137342 states to 137342 states and 229462 transitions. [2025-03-03 15:04:25,236 INFO L78 Accepts]: Start accepts. Automaton has 137342 states and 229462 transitions. Word has length 348 [2025-03-03 15:04:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:25,236 INFO L471 AbstractCegarLoop]: Abstraction has 137342 states and 229462 transitions. [2025-03-03 15:04:25,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 137342 states and 229462 transitions. [2025-03-03 15:04:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 15:04:25,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:25,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:25,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:04:25,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:25,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -178704873, now seen corresponding path program 1 times [2025-03-03 15:04:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035328957] [2025-03-03 15:04:25,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:25,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 15:04:25,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 15:04:25,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:25,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:25,887 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-03 15:04:25,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:25,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035328957] [2025-03-03 15:04:25,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035328957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:25,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:25,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:04:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734785885] [2025-03-03 15:04:25,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:04:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:25,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:04:25,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:04:25,889 INFO L87 Difference]: Start difference. First operand 137342 states and 229462 transitions. Second operand has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:26,878 INFO L93 Difference]: Finished difference Result 220126 states and 369040 transitions. [2025-03-03 15:04:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:04:26,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-03-03 15:04:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:27,145 INFO L225 Difference]: With dead ends: 220126 [2025-03-03 15:04:27,145 INFO L226 Difference]: Without dead ends: 206524 [2025-03-03 15:04:27,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:04:27,198 INFO L435 NwaCegarLoop]: 3031 mSDtfsCounter, 7340 mSDsluCounter, 9556 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7340 SdHoareTripleChecker+Valid, 12587 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:27,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7340 Valid, 12587 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:04:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206524 states. [2025-03-03 15:04:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206524 to 151756. [2025-03-03 15:04:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151756 states, 151755 states have (on average 1.6717340450067544) internal successors, (253694), 151755 states have internal predecessors, (253694), 0 states have call successors, (0), 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-03 15:04:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151756 states to 151756 states and 253694 transitions. [2025-03-03 15:04:29,616 INFO L78 Accepts]: Start accepts. Automaton has 151756 states and 253694 transitions. Word has length 348 [2025-03-03 15:04:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:29,616 INFO L471 AbstractCegarLoop]: Abstraction has 151756 states and 253694 transitions. [2025-03-03 15:04:29,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 151756 states and 253694 transitions. [2025-03-03 15:04:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 15:04:29,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:29,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:29,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:04:29,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:29,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash -368383369, now seen corresponding path program 1 times [2025-03-03 15:04:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:29,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718414916] [2025-03-03 15:04:29,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:29,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 15:04:29,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 15:04:29,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:29,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:30,222 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-03 15:04:30,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:30,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718414916] [2025-03-03 15:04:30,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718414916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:30,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:04:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143132555] [2025-03-03 15:04:30,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:30,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:04:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:30,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:04:30,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:04:30,224 INFO L87 Difference]: Start difference. First operand 151756 states and 253694 transitions. Second operand has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:31,225 INFO L93 Difference]: Finished difference Result 234540 states and 393272 transitions. [2025-03-03 15:04:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:04:31,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-03-03 15:04:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:31,489 INFO L225 Difference]: With dead ends: 234540 [2025-03-03 15:04:31,489 INFO L226 Difference]: Without dead ends: 220938 [2025-03-03 15:04:31,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:04:31,522 INFO L435 NwaCegarLoop]: 2813 mSDtfsCounter, 7396 mSDsluCounter, 8264 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7396 SdHoareTripleChecker+Valid, 11077 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:31,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7396 Valid, 11077 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:04:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220938 states. [2025-03-03 15:04:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220938 to 166170. [2025-03-03 15:04:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166170 states, 166169 states have (on average 1.6725502350017152) internal successors, (277926), 166169 states have internal predecessors, (277926), 0 states have call successors, (0), 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-03 15:04:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166170 states to 166170 states and 277926 transitions. [2025-03-03 15:04:34,237 INFO L78 Accepts]: Start accepts. Automaton has 166170 states and 277926 transitions. Word has length 348 [2025-03-03 15:04:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:34,238 INFO L471 AbstractCegarLoop]: Abstraction has 166170 states and 277926 transitions. [2025-03-03 15:04:34,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.714285714285715) internal successors, (348), 7 states have internal predecessors, (348), 0 states have call successors, (0), 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-03 15:04:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 166170 states and 277926 transitions. [2025-03-03 15:04:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 15:04:34,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:34,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:34,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:04:34,257 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:34,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash -468828829, now seen corresponding path program 1 times [2025-03-03 15:04:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491611968] [2025-03-03 15:04:34,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:34,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 15:04:34,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 15:04:34,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:34,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:34,458 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-03 15:04:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491611968] [2025-03-03 15:04:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491611968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:34,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:34,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:04:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752391114] [2025-03-03 15:04:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:34,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:04:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:34,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:04:34,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:04:34,463 INFO L87 Difference]: Start difference. First operand 166170 states and 277926 transitions. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:35,893 INFO L93 Difference]: Finished difference Result 467983 states and 785083 transitions. [2025-03-03 15:04:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:04:35,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-03-03 15:04:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:36,427 INFO L225 Difference]: With dead ends: 467983 [2025-03-03 15:04:36,427 INFO L226 Difference]: Without dead ends: 318669 [2025-03-03 15:04:36,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:04:36,571 INFO L435 NwaCegarLoop]: 2283 mSDtfsCounter, 2981 mSDsluCounter, 3144 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2981 SdHoareTripleChecker+Valid, 5427 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:36,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2981 Valid, 5427 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318669 states. [2025-03-03 15:04:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318669 to 290633. [2025-03-03 15:04:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290633 states, 290632 states have (on average 1.6709515813812656) internal successors, (485632), 290632 states have internal predecessors, (485632), 0 states have call successors, (0), 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-03 15:04:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290633 states to 290633 states and 485632 transitions. [2025-03-03 15:04:40,886 INFO L78 Accepts]: Start accepts. Automaton has 290633 states and 485632 transitions. Word has length 349 [2025-03-03 15:04:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:04:40,886 INFO L471 AbstractCegarLoop]: Abstraction has 290633 states and 485632 transitions. [2025-03-03 15:04:40,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 290633 states and 485632 transitions. [2025-03-03 15:04:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 15:04:40,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:04:40,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:04:40,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:04:40,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:04:40,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:04:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1467089056, now seen corresponding path program 1 times [2025-03-03 15:04:40,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:04:40,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401974063] [2025-03-03 15:04:40,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:04:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:04:40,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 15:04:40,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 15:04:40,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:04:40,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:04:41,581 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-03 15:04:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:04:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401974063] [2025-03-03 15:04:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401974063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:04:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:04:41,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:04:41,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200144426] [2025-03-03 15:04:41,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:04:41,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:04:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:04:41,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:04:41,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:04:41,583 INFO L87 Difference]: Start difference. First operand 290633 states and 485632 transitions. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:04:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:04:43,390 INFO L93 Difference]: Finished difference Result 400079 states and 669819 transitions. [2025-03-03 15:04:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:04:43,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-03-03 15:04:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:04:44,000 INFO L225 Difference]: With dead ends: 400079 [2025-03-03 15:04:44,000 INFO L226 Difference]: Without dead ends: 345805 [2025-03-03 15:04:44,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:04:44,104 INFO L435 NwaCegarLoop]: 3110 mSDtfsCounter, 1728 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 5931 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:04:44,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 5931 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:04:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345805 states. [2025-03-03 15:04:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345805 to 318345. [2025-03-03 15:04:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318345 states, 318344 states have (on average 1.6714497524690273) internal successors, (532096), 318344 states have internal predecessors, (532096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)