./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54279535a13e8158f88d9d9b5db1799d2b3d70a14030175542187aacc84265bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:31:01,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:31:01,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:31:01,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:31:01,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:31:01,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:31:01,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:31:01,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:31:01,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:31:01,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:31:01,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:31:01,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:31:01,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:31:01,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:31:01,441 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:31:01,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:31:01,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:31:01,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:31:01,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:31:01,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:31:01,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:01,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:31:01,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:31:01,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:31:01,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:31:01,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:31:01,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:31:01,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:31:01,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:31:01,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:31:01,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:31:01,444 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54279535a13e8158f88d9d9b5db1799d2b3d70a14030175542187aacc84265bd [2025-02-05 16:31:01,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:31:01,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:31:01,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:31:01,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:31:01,761 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:31:01,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:31:03,045 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a4c8e617/2ad39d8dd43f4b4ba0db212e037d0a23/FLAG86163591f [2025-02-05 16:31:03,477 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:31:03,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:31:03,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a4c8e617/2ad39d8dd43f4b4ba0db212e037d0a23/FLAG86163591f [2025-02-05 16:31:03,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a4c8e617/2ad39d8dd43f4b4ba0db212e037d0a23 [2025-02-05 16:31:03,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:31:03,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:31:03,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:03,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:31:03,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:31:03,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:03" (1/1) ... [2025-02-05 16:31:03,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2d7d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:03, skipping insertion in model container [2025-02-05 16:31:03,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:03" (1/1) ... [2025-02-05 16:31:03,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:31:04,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[36688,36701] [2025-02-05 16:31:04,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:04,365 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:31:04,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[36688,36701] [2025-02-05 16:31:04,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:04,765 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:31:04,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04 WrapperNode [2025-02-05 16:31:04,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:04,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:04,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:31:04,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:31:04,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,987 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5197 [2025-02-05 16:31:04,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:04,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:31:04,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:31:04,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:31:04,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:05,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:05,082 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:31:05,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:05,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:05,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:05,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:05,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:05,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:05,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:31:05,213 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:31:05,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:31:05,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:31:05,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:05,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:05,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:05,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:31:05,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:31:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:31:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:31:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:31:05,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:31:05,527 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:31:05,529 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:31:09,003 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4337: 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-02-05 16:31:09,003 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5399: 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-02-05 16:31:09,003 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2096: 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-02-05 16:31:09,003 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5005: 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-02-05 16:31:09,003 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6461: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2767: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3574: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4504: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1466: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4109: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5566: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6628: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2413: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2944: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6127: 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-02-05 16:31:09,004 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5733: 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-02-05 16:31:09,005 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3752: 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-02-05 16:31:09,005 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6795: 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-02-05 16:31:09,005 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1778: 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-02-05 16:31:09,005 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5232: 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-02-05 16:31:09,005 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: 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-02-05 16:31:09,006 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4838: 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-02-05 16:31:09,006 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: 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-02-05 16:31:09,006 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6294: 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-02-05 16:31:09,007 INFO L1309 $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-02-05 16:31:09,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5900: 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-02-05 16:31:09,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3396: 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-02-05 16:31:09,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154: 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-02-05 16:31:09,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3930: 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-02-05 16:31:09,531 INFO L? ?]: Removed 355 outVars from TransFormulas that were not future-live. [2025-02-05 16:31:09,531 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:31:09,591 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:31:09,591 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:31:09,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:09 BoogieIcfgContainer [2025-02-05 16:31:09,592 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:31:09,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:31:09,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:31:09,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:31:09,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:31:03" (1/3) ... [2025-02-05 16:31:09,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426751d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:09, skipping insertion in model container [2025-02-05 16:31:09,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (2/3) ... [2025-02-05 16:31:09,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426751d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:09, skipping insertion in model container [2025-02-05 16:31:09,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:09" (3/3) ... [2025-02-05 16:31:09,606 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:31:09,620 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:31:09,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 1434 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:31:09,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:31:09,745 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;@20bdbaf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:31:09,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:31:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 1434 states, 1432 states have (on average 1.7863128491620113) internal successors, (2558), 1433 states have internal predecessors, (2558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-05 16:31:09,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:09,787 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, 1, 1, 1] [2025-02-05 16:31:09,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:09,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1595350330, now seen corresponding path program 1 times [2025-02-05 16:31:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:09,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231289698] [2025-02-05 16:31:09,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:09,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-05 16:31:10,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-05 16:31:10,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:10,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:10,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:10,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231289698] [2025-02-05 16:31:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231289698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:10,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:10,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451958064] [2025-02-05 16:31:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:10,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:10,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:10,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:10,941 INFO L87 Difference]: Start difference. First operand has 1434 states, 1432 states have (on average 1.7863128491620113) internal successors, (2558), 1433 states have internal predecessors, (2558), 0 states have call successors, (0), 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 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:11,179 INFO L93 Difference]: Finished difference Result 2878 states and 5043 transitions. [2025-02-05 16:31:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:11,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2025-02-05 16:31:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:11,214 INFO L225 Difference]: With dead ends: 2878 [2025-02-05 16:31:11,214 INFO L226 Difference]: Without dead ends: 2005 [2025-02-05 16:31:11,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:11,229 INFO L435 NwaCegarLoop]: 3288 mSDtfsCounter, 1178 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 5621 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:11,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 5621 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2025-02-05 16:31:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 2003. [2025-02-05 16:31:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2003 states, 2002 states have (on average 1.6733266733266734) internal successors, (3350), 2002 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 3350 transitions. [2025-02-05 16:31:11,374 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 3350 transitions. Word has length 352 [2025-02-05 16:31:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:11,375 INFO L471 AbstractCegarLoop]: Abstraction has 2003 states and 3350 transitions. [2025-02-05 16:31:11,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 3350 transitions. [2025-02-05 16:31:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-05 16:31:11,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:11,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:11,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:31:11,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:11,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1612069210, now seen corresponding path program 1 times [2025-02-05 16:31:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408876148] [2025-02-05 16:31:11,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:11,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 16:31:11,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 16:31:11,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:11,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408876148] [2025-02-05 16:31:11,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408876148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:11,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:11,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:11,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567539165] [2025-02-05 16:31:11,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:11,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:11,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:11,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:11,925 INFO L87 Difference]: Start difference. First operand 2003 states and 3350 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:12,084 INFO L93 Difference]: Finished difference Result 4410 states and 7289 transitions. [2025-02-05 16:31:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:12,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 354 [2025-02-05 16:31:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:12,098 INFO L225 Difference]: With dead ends: 4410 [2025-02-05 16:31:12,099 INFO L226 Difference]: Without dead ends: 2997 [2025-02-05 16:31:12,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:12,105 INFO L435 NwaCegarLoop]: 2784 mSDtfsCounter, 1095 mSDsluCounter, 2152 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 4936 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-02-05 16:31:12,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 4936 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2025-02-05 16:31:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2995. [2025-02-05 16:31:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2994 states have (on average 1.6586506346025385) internal successors, (4966), 2994 states have internal predecessors, (4966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 4966 transitions. [2025-02-05 16:31:12,184 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 4966 transitions. Word has length 354 [2025-02-05 16:31:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:12,185 INFO L471 AbstractCegarLoop]: Abstraction has 2995 states and 4966 transitions. [2025-02-05 16:31:12,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4966 transitions. [2025-02-05 16:31:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-02-05 16:31:12,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:12,242 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:12,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:31:12,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:12,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1681646648, now seen corresponding path program 1 times [2025-02-05 16:31:12,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:12,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825609654] [2025-02-05 16:31:12,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:12,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:12,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-02-05 16:31:12,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-02-05 16:31:12,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:12,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825609654] [2025-02-05 16:31:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825609654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502764459] [2025-02-05 16:31:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:12,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:12,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:12,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:12,755 INFO L87 Difference]: Start difference. First operand 2995 states and 4966 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:12,954 INFO L93 Difference]: Finished difference Result 7050 states and 11584 transitions. [2025-02-05 16:31:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:12,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-02-05 16:31:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:12,978 INFO L225 Difference]: With dead ends: 7050 [2025-02-05 16:31:12,979 INFO L226 Difference]: Without dead ends: 4668 [2025-02-05 16:31:12,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:12,988 INFO L435 NwaCegarLoop]: 2475 mSDtfsCounter, 1071 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 4575 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-02-05 16:31:12,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 4575 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2025-02-05 16:31:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4666. [2025-02-05 16:31:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4666 states, 4665 states have (on average 1.645016077170418) internal successors, (7674), 4665 states have internal predecessors, (7674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 7674 transitions. [2025-02-05 16:31:13,115 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 7674 transitions. Word has length 356 [2025-02-05 16:31:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:13,116 INFO L471 AbstractCegarLoop]: Abstraction has 4666 states and 7674 transitions. [2025-02-05 16:31:13,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 7674 transitions. [2025-02-05 16:31:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-05 16:31:13,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:13,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:13,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:31:13,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:13,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1618555782, now seen corresponding path program 1 times [2025-02-05 16:31:13,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:13,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646965823] [2025-02-05 16:31:13,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:13,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 16:31:13,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 16:31:13,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:13,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:13,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:13,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646965823] [2025-02-05 16:31:13,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646965823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:13,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:13,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878441674] [2025-02-05 16:31:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:13,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:13,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:13,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:13,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:13,477 INFO L87 Difference]: Start difference. First operand 4666 states and 7674 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:13,664 INFO L93 Difference]: Finished difference Result 11405 states and 18619 transitions. [2025-02-05 16:31:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 358 [2025-02-05 16:31:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:13,695 INFO L225 Difference]: With dead ends: 11405 [2025-02-05 16:31:13,695 INFO L226 Difference]: Without dead ends: 7375 [2025-02-05 16:31:13,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:13,704 INFO L435 NwaCegarLoop]: 2399 mSDtfsCounter, 1046 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 4447 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-02-05 16:31:13,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 4447 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7375 states. [2025-02-05 16:31:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7375 to 7373. [2025-02-05 16:31:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7373 states, 7372 states have (on average 1.6310363537710255) internal successors, (12024), 7372 states have internal predecessors, (12024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 12024 transitions. [2025-02-05 16:31:13,889 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 12024 transitions. Word has length 358 [2025-02-05 16:31:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:13,890 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 12024 transitions. [2025-02-05 16:31:13,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 12024 transitions. [2025-02-05 16:31:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-02-05 16:31:13,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:13,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:13,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:31:13,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:13,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1416066090, now seen corresponding path program 1 times [2025-02-05 16:31:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:13,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31576917] [2025-02-05 16:31:13,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:14,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-02-05 16:31:14,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-02-05 16:31:14,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:14,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:14,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:14,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31576917] [2025-02-05 16:31:14,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31576917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:14,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:14,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:14,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074552014] [2025-02-05 16:31:14,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:14,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:14,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:14,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:14,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:14,244 INFO L87 Difference]: Start difference. First operand 7373 states and 12024 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:14,434 INFO L93 Difference]: Finished difference Result 18224 states and 29508 transitions. [2025-02-05 16:31:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:14,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 360 [2025-02-05 16:31:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:14,477 INFO L225 Difference]: With dead ends: 18224 [2025-02-05 16:31:14,478 INFO L226 Difference]: Without dead ends: 11510 [2025-02-05 16:31:14,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:14,493 INFO L435 NwaCegarLoop]: 2591 mSDtfsCounter, 1020 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 4588 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-02-05 16:31:14,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 4588 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2025-02-05 16:31:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 11508. [2025-02-05 16:31:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11508 states, 11507 states have (on average 1.6141479099678457) internal successors, (18574), 11507 states have internal predecessors, (18574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11508 states to 11508 states and 18574 transitions. [2025-02-05 16:31:14,883 INFO L78 Accepts]: Start accepts. Automaton has 11508 states and 18574 transitions. Word has length 360 [2025-02-05 16:31:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:14,883 INFO L471 AbstractCegarLoop]: Abstraction has 11508 states and 18574 transitions. [2025-02-05 16:31:14,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 11508 states and 18574 transitions. [2025-02-05 16:31:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-05 16:31:14,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:14,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:14,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:31:14,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:14,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1341709043, now seen corresponding path program 1 times [2025-02-05 16:31:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967413253] [2025-02-05 16:31:14,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:14,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-05 16:31:15,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-05 16:31:15,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:15,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:15,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967413253] [2025-02-05 16:31:15,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967413253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:15,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:15,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:15,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045053306] [2025-02-05 16:31:15,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:15,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:15,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:15,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:15,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:15,193 INFO L87 Difference]: Start difference. First operand 11508 states and 18574 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:15,568 INFO L93 Difference]: Finished difference Result 18664 states and 30624 transitions. [2025-02-05 16:31:15,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:15,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2025-02-05 16:31:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:15,608 INFO L225 Difference]: With dead ends: 18664 [2025-02-05 16:31:15,608 INFO L226 Difference]: Without dead ends: 14118 [2025-02-05 16:31:15,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:15,619 INFO L435 NwaCegarLoop]: 3022 mSDtfsCounter, 1268 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 4945 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:15,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 4945 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14118 states. [2025-02-05 16:31:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14118 to 14100. [2025-02-05 16:31:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14100 states, 14099 states have (on average 1.6192637775728775) internal successors, (22830), 14099 states have internal predecessors, (22830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14100 states to 14100 states and 22830 transitions. [2025-02-05 16:31:15,973 INFO L78 Accepts]: Start accepts. Automaton has 14100 states and 22830 transitions. Word has length 362 [2025-02-05 16:31:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:15,974 INFO L471 AbstractCegarLoop]: Abstraction has 14100 states and 22830 transitions. [2025-02-05 16:31:15,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 14100 states and 22830 transitions. [2025-02-05 16:31:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-05 16:31:16,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:16,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:16,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:31:16,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:16,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash 250260743, now seen corresponding path program 1 times [2025-02-05 16:31:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:16,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840952941] [2025-02-05 16:31:16,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:16,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-05 16:31:16,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-05 16:31:16,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:16,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:16,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840952941] [2025-02-05 16:31:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840952941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:16,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:31:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815678833] [2025-02-05 16:31:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:16,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:16,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:16,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:16,764 INFO L87 Difference]: Start difference. First operand 14100 states and 22830 transitions. Second operand has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:17,598 INFO L93 Difference]: Finished difference Result 66144 states and 110456 transitions. [2025-02-05 16:31:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:31:17,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2025-02-05 16:31:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:17,770 INFO L225 Difference]: With dead ends: 66144 [2025-02-05 16:31:17,770 INFO L226 Difference]: Without dead ends: 61294 [2025-02-05 16:31:17,811 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-02-05 16:31:17,812 INFO L435 NwaCegarLoop]: 2292 mSDtfsCounter, 11542 mSDsluCounter, 8790 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11542 SdHoareTripleChecker+Valid, 11082 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-02-05 16:31:17,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11542 Valid, 11082 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61294 states. [2025-02-05 16:31:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61294 to 21286. [2025-02-05 16:31:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21286 states, 21285 states have (on average 1.6333568240544984) internal successors, (34766), 21285 states have internal predecessors, (34766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21286 states to 21286 states and 34766 transitions. [2025-02-05 16:31:18,610 INFO L78 Accepts]: Start accepts. Automaton has 21286 states and 34766 transitions. Word has length 362 [2025-02-05 16:31:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:18,611 INFO L471 AbstractCegarLoop]: Abstraction has 21286 states and 34766 transitions. [2025-02-05 16:31:18,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 21286 states and 34766 transitions. [2025-02-05 16:31:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-05 16:31:18,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:18,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:18,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:31:18,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:18,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash -829779952, now seen corresponding path program 1 times [2025-02-05 16:31:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:18,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188831516] [2025-02-05 16:31:18,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:18,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-05 16:31:18,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-05 16:31:18,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:18,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:19,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:19,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188831516] [2025-02-05 16:31:19,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188831516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:19,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:19,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:19,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751263633] [2025-02-05 16:31:19,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:19,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:31:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:19,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:31:19,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:31:19,148 INFO L87 Difference]: Start difference. First operand 21286 states and 34766 transitions. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:19,442 INFO L93 Difference]: Finished difference Result 52574 states and 87249 transitions. [2025-02-05 16:31:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:31:19,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 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 363 [2025-02-05 16:31:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:19,555 INFO L225 Difference]: With dead ends: 52574 [2025-02-05 16:31:19,556 INFO L226 Difference]: Without dead ends: 42940 [2025-02-05 16:31:19,592 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-02-05 16:31:19,593 INFO L435 NwaCegarLoop]: 2304 mSDtfsCounter, 3105 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3105 SdHoareTripleChecker+Valid, 5826 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-02-05 16:31:19,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3105 Valid, 5826 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42940 states. [2025-02-05 16:31:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42940 to 32647. [2025-02-05 16:31:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32647 states, 32646 states have (on average 1.6444893708264412) internal successors, (53686), 32646 states have internal predecessors, (53686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32647 states to 32647 states and 53686 transitions. [2025-02-05 16:31:20,257 INFO L78 Accepts]: Start accepts. Automaton has 32647 states and 53686 transitions. Word has length 363 [2025-02-05 16:31:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:20,258 INFO L471 AbstractCegarLoop]: Abstraction has 32647 states and 53686 transitions. [2025-02-05 16:31:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 32647 states and 53686 transitions. [2025-02-05 16:31:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-02-05 16:31:20,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:20,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:20,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:31:20,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:20,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:20,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2030255876, now seen corresponding path program 1 times [2025-02-05 16:31:20,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:20,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923014550] [2025-02-05 16:31:20,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:20,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:20,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-02-05 16:31:20,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-02-05 16:31:20,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:20,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:21,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923014550] [2025-02-05 16:31:21,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923014550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:21,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:21,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:31:21,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90716062] [2025-02-05 16:31:21,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:21,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:21,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:21,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:21,020 INFO L87 Difference]: Start difference. First operand 32647 states and 53686 transitions. Second operand has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:21,911 INFO L93 Difference]: Finished difference Result 130640 states and 217668 transitions. [2025-02-05 16:31:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:31:21,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 0 states have call successors, (0), 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 363 [2025-02-05 16:31:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:22,205 INFO L225 Difference]: With dead ends: 130640 [2025-02-05 16:31:22,206 INFO L226 Difference]: Without dead ends: 111406 [2025-02-05 16:31:22,259 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-02-05 16:31:22,261 INFO L435 NwaCegarLoop]: 2609 mSDtfsCounter, 8066 mSDsluCounter, 8277 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8066 SdHoareTripleChecker+Valid, 10886 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:22,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8066 Valid, 10886 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111406 states. [2025-02-05 16:31:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111406 to 51937. [2025-02-05 16:31:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51937 states, 51936 states have (on average 1.6534195933456561) internal successors, (85872), 51936 states have internal predecessors, (85872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51937 states to 51937 states and 85872 transitions. [2025-02-05 16:31:23,412 INFO L78 Accepts]: Start accepts. Automaton has 51937 states and 85872 transitions. Word has length 363 [2025-02-05 16:31:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:23,413 INFO L471 AbstractCegarLoop]: Abstraction has 51937 states and 85872 transitions. [2025-02-05 16:31:23,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51937 states and 85872 transitions. [2025-02-05 16:31:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-05 16:31:23,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:23,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:23,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:31:23,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:23,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:23,438 INFO L85 PathProgramCache]: Analyzing trace with hash 48607498, now seen corresponding path program 1 times [2025-02-05 16:31:23,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598701257] [2025-02-05 16:31:23,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:23,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-05 16:31:23,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-05 16:31:23,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:23,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598701257] [2025-02-05 16:31:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598701257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:23,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:23,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:23,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008729428] [2025-02-05 16:31:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:23,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:31:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:23,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:31:23,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:31:23,792 INFO L87 Difference]: Start difference. First operand 51937 states and 85872 transitions. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:24,441 INFO L93 Difference]: Finished difference Result 151833 states and 252879 transitions. [2025-02-05 16:31:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:31:24,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 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 364 [2025-02-05 16:31:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:24,665 INFO L225 Difference]: With dead ends: 151833 [2025-02-05 16:31:24,666 INFO L226 Difference]: Without dead ends: 113367 [2025-02-05 16:31:24,737 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-02-05 16:31:24,737 INFO L435 NwaCegarLoop]: 2304 mSDtfsCounter, 3046 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3046 SdHoareTripleChecker+Valid, 5656 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-02-05 16:31:24,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3046 Valid, 5656 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113367 states. [2025-02-05 16:31:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113367 to 92942. [2025-02-05 16:31:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92942 states, 92941 states have (on average 1.6560398532402276) internal successors, (153914), 92941 states have internal predecessors, (153914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92942 states to 92942 states and 153914 transitions. [2025-02-05 16:31:26,369 INFO L78 Accepts]: Start accepts. Automaton has 92942 states and 153914 transitions. Word has length 364 [2025-02-05 16:31:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:26,370 INFO L471 AbstractCegarLoop]: Abstraction has 92942 states and 153914 transitions. [2025-02-05 16:31:26,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 92942 states and 153914 transitions. [2025-02-05 16:31:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-05 16:31:26,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:26,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:26,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:31:26,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:26,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:26,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1368625529, now seen corresponding path program 1 times [2025-02-05 16:31:26,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:26,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13995681] [2025-02-05 16:31:26,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:26,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-05 16:31:26,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-05 16:31:26,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:26,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:27,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:27,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13995681] [2025-02-05 16:31:27,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13995681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:27,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:27,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:31:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592195591] [2025-02-05 16:31:27,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:27,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:27,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:27,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:27,403 INFO L87 Difference]: Start difference. First operand 92942 states and 153914 transitions. Second operand has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:28,730 INFO L93 Difference]: Finished difference Result 267892 states and 445876 transitions. [2025-02-05 16:31:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:31:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 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 364 [2025-02-05 16:31:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:29,249 INFO L225 Difference]: With dead ends: 267892 [2025-02-05 16:31:29,249 INFO L226 Difference]: Without dead ends: 229522 [2025-02-05 16:31:29,293 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-02-05 16:31:29,294 INFO L435 NwaCegarLoop]: 2963 mSDtfsCounter, 6853 mSDsluCounter, 7601 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6853 SdHoareTripleChecker+Valid, 10564 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.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:29,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6853 Valid, 10564 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229522 states. [2025-02-05 16:31:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229522 to 151336. [2025-02-05 16:31:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151336 states, 151335 states have (on average 1.658215217894076) internal successors, (250946), 151335 states have internal predecessors, (250946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151336 states to 151336 states and 250946 transitions. [2025-02-05 16:31:32,166 INFO L78 Accepts]: Start accepts. Automaton has 151336 states and 250946 transitions. Word has length 364 [2025-02-05 16:31:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:32,167 INFO L471 AbstractCegarLoop]: Abstraction has 151336 states and 250946 transitions. [2025-02-05 16:31:32,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 151336 states and 250946 transitions. [2025-02-05 16:31:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-05 16:31:32,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:32,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:32,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:31:32,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:32,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:32,193 INFO L85 PathProgramCache]: Analyzing trace with hash -175260953, now seen corresponding path program 1 times [2025-02-05 16:31:32,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:32,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737674883] [2025-02-05 16:31:32,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:32,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-05 16:31:32,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-05 16:31:32,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:32,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:33,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:33,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737674883] [2025-02-05 16:31:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737674883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:33,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:33,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:31:33,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623282148] [2025-02-05 16:31:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:33,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:33,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:33,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:33,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:33,101 INFO L87 Difference]: Start difference. First operand 151336 states and 250946 transitions. Second operand has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:34,358 INFO L93 Difference]: Finished difference Result 306752 states and 510516 transitions. [2025-02-05 16:31:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:31:34,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 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 364 [2025-02-05 16:31:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:34,882 INFO L225 Difference]: With dead ends: 306752 [2025-02-05 16:31:34,882 INFO L226 Difference]: Without dead ends: 268382 [2025-02-05 16:31:34,962 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-02-05 16:31:34,963 INFO L435 NwaCegarLoop]: 2996 mSDtfsCounter, 6840 mSDsluCounter, 9319 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6840 SdHoareTripleChecker+Valid, 12315 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-02-05 16:31:34,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6840 Valid, 12315 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268382 states. [2025-02-05 16:31:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268382 to 190838. [2025-02-05 16:31:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190838 states, 190837 states have (on average 1.659227508292417) internal successors, (316642), 190837 states have internal predecessors, (316642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190838 states to 190838 states and 316642 transitions. [2025-02-05 16:31:38,286 INFO L78 Accepts]: Start accepts. Automaton has 190838 states and 316642 transitions. Word has length 364 [2025-02-05 16:31:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:38,287 INFO L471 AbstractCegarLoop]: Abstraction has 190838 states and 316642 transitions. [2025-02-05 16:31:38,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 190838 states and 316642 transitions. [2025-02-05 16:31:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-02-05 16:31:38,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:38,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:38,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:31:38,312 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:38,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash -807649465, now seen corresponding path program 1 times [2025-02-05 16:31:38,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:38,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926479299] [2025-02-05 16:31:38,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:38,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:38,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-02-05 16:31:38,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-02-05 16:31:38,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:38,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:39,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:39,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926479299] [2025-02-05 16:31:39,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926479299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:39,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:39,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:31:39,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304238777] [2025-02-05 16:31:39,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:39,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:39,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:39,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:39,156 INFO L87 Difference]: Start difference. First operand 190838 states and 316642 transitions. Second operand has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:40,683 INFO L93 Difference]: Finished difference Result 307604 states and 511924 transitions. [2025-02-05 16:31:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:31:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 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 364 [2025-02-05 16:31:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:41,190 INFO L225 Difference]: With dead ends: 307604 [2025-02-05 16:31:41,190 INFO L226 Difference]: Without dead ends: 288370 [2025-02-05 16:31:41,282 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-02-05 16:31:41,282 INFO L435 NwaCegarLoop]: 2777 mSDtfsCounter, 7351 mSDsluCounter, 7644 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7351 SdHoareTripleChecker+Valid, 10421 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:41,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7351 Valid, 10421 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288370 states. [2025-02-05 16:31:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288370 to 211073. [2025-02-05 16:31:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211073 states, 211072 states have (on average 1.6600686021831412) internal successors, (350394), 211072 states have internal predecessors, (350394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211073 states to 211073 states and 350394 transitions. [2025-02-05 16:31:45,142 INFO L78 Accepts]: Start accepts. Automaton has 211073 states and 350394 transitions. Word has length 364 [2025-02-05 16:31:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:45,143 INFO L471 AbstractCegarLoop]: Abstraction has 211073 states and 350394 transitions. [2025-02-05 16:31:45,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 211073 states and 350394 transitions. [2025-02-05 16:31:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-02-05 16:31:45,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:45,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:45,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:31:45,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:45,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1508725299, now seen corresponding path program 1 times [2025-02-05 16:31:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896226338] [2025-02-05 16:31:45,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:45,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-05 16:31:45,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-05 16:31:45,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:45,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896226338] [2025-02-05 16:31:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896226338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:45,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:45,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845503457] [2025-02-05 16:31:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:45,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:31:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:45,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:31:45,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:31:45,634 INFO L87 Difference]: Start difference. First operand 211073 states and 350394 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:47,738 INFO L93 Difference]: Finished difference Result 599077 states and 996673 transitions. [2025-02-05 16:31:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:31:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 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 365 [2025-02-05 16:31:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:48,457 INFO L225 Difference]: With dead ends: 599077 [2025-02-05 16:31:48,457 INFO L226 Difference]: Without dead ends: 407059 [2025-02-05 16:31:48,652 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-02-05 16:31:48,653 INFO L435 NwaCegarLoop]: 2326 mSDtfsCounter, 2987 mSDsluCounter, 3184 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2987 SdHoareTripleChecker+Valid, 5510 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-02-05 16:31:48,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2987 Valid, 5510 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407059 states. [2025-02-05 16:31:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407059 to 367340. [2025-02-05 16:31:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367340 states, 367339 states have (on average 1.6572430370856348) internal successors, (608770), 367339 states have internal predecessors, (608770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367340 states to 367340 states and 608770 transitions. [2025-02-05 16:31:54,505 INFO L78 Accepts]: Start accepts. Automaton has 367340 states and 608770 transitions. Word has length 365 [2025-02-05 16:31:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:54,505 INFO L471 AbstractCegarLoop]: Abstraction has 367340 states and 608770 transitions. [2025-02-05 16:31:54,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 367340 states and 608770 transitions. [2025-02-05 16:31:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-02-05 16:31:54,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:54,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:54,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:31:54,528 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:54,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1405726724, now seen corresponding path program 1 times [2025-02-05 16:31:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567003222] [2025-02-05 16:31:54,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:54,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:54,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-05 16:31:54,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-05 16:31:54,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:54,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:55,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:55,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567003222] [2025-02-05 16:31:55,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567003222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:55,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955865453] [2025-02-05 16:31:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:55,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:55,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:55,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:55,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:55,607 INFO L87 Difference]: Start difference. First operand 367340 states and 608770 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:58,197 INFO L93 Difference]: Finished difference Result 722074 states and 1198132 transitions. [2025-02-05 16:31:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 365 [2025-02-05 16:31:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:58,785 INFO L225 Difference]: With dead ends: 722074 [2025-02-05 16:31:58,785 INFO L226 Difference]: Without dead ends: 356154