./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-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 4eae6e6c8bbb105c3dcf0e7edf73f931915af6d6745ce5116ee35a4a9fee030a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:48:55,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:48:55,978 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:48:55,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:48:55,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:48:55,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:48:55,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:48:55,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:48:55,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:48:55,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:48:55,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:48:55,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:48:55,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:48:55,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:48:55,997 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:48:55,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:48:55,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:48:55,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:48:55,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:48:55,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:48:55,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:48:55,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:48:55,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:48:55,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:48:55,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:48:55,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:48:55,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:48:55,999 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:48:55,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:48:55,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:48:55,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:48:55,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:48:55,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:48:55,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:48:55,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:48:55,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:48:56,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:48:56,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:48:56,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:48:56,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:48:56,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:48:56,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:48:56,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:48:56,000 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 -> 4eae6e6c8bbb105c3dcf0e7edf73f931915af6d6745ce5116ee35a4a9fee030a [2025-02-05 16:48:56,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:48:56,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:48:56,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:48:56,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:48:56,274 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:48:56,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:48:58,225 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce2a4c0dc/0e18c65fe83d439c88b40da03314117a/FLAG17b2ba146 [2025-02-05 16:48:58,568 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:48:58,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:48:58,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce2a4c0dc/0e18c65fe83d439c88b40da03314117a/FLAG17b2ba146 [2025-02-05 16:48:58,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce2a4c0dc/0e18c65fe83d439c88b40da03314117a [2025-02-05 16:48:58,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:48:58,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:48:58,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:48:58,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:48:58,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:48:58,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:48:58" (1/1) ... [2025-02-05 16:48:58,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c292c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:58, skipping insertion in model container [2025-02-05 16:48:58,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:48:58" (1/1) ... [2025-02-05 16:48:58,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:48:59,209 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26539,26552] [2025-02-05 16:48:59,234 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30716,30729] [2025-02-05 16:48:59,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:48:59,318 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:48:59,476 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26539,26552] [2025-02-05 16:48:59,505 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30716,30729] [2025-02-05 16:48:59,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:48:59,608 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:48:59,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59 WrapperNode [2025-02-05 16:48:59,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:48:59,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:48:59,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:48:59,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:48:59,617 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:48:59" (1/1) ... [2025-02-05 16:48:59,644 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:48:59" (1/1) ... [2025-02-05 16:48:59,703 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2704 [2025-02-05 16:48:59,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:48:59,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:48:59,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:48:59,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:48:59,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,746 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:48:59,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:48:59,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:48:59,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:48:59,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:48:59,818 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:48:59,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:48:59,844 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:48:59,885 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:48:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:48:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:48:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:48:59,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:49:00,032 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:49:00,034 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:49:01,464 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node4__newmax~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1; [2025-02-05 16:49:01,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1902: havoc main_~node2__newmax~5#1; [2025-02-05 16:49:01,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568: 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:49:01,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2248: 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:49:01,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2052: havoc main_~check__tmp~5#1; [2025-02-05 16:49:01,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc main_~node4__newmax~5#1; [2025-02-05 16:49:01,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860: havoc main_~node1__newmax~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node4__newmax~4#1;havoc main_~node3__newmax~4#1;havoc main_~node2__newmax~4#1; [2025-02-05 16:49:01,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728: 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:49:01,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1944: havoc main_~node3__newmax~5#1; [2025-02-05 16:49:01,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1284: havoc main_~node1__newmax~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__newmax~2#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;havoc main_~node3__newmax~2#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;havoc main_~node2__newmax~2#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;havoc main_~node1__newmax~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__newmax~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__newmax~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;havoc main_~node3__newmax~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;havoc main_~node2__newmax~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;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~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__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-02-05 16:49:01,466 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408: 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:49:01,682 INFO L? ?]: Removed 196 outVars from TransFormulas that were not future-live. [2025-02-05 16:49:01,683 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:49:01,713 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:49:01,713 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:49:01,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:49:01 BoogieIcfgContainer [2025-02-05 16:49:01,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:49:01,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:49:01,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:49:01,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:49:01,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:48:58" (1/3) ... [2025-02-05 16:49:01,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d60100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:49:01, skipping insertion in model container [2025-02-05 16:49:01,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59" (2/3) ... [2025-02-05 16:49:01,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d60100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:49:01, skipping insertion in model container [2025-02-05 16:49:01,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:49:01" (3/3) ... [2025-02-05 16:49:01,729 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:49:01,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:49:01,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 671 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-05 16:49:01,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:49:01,840 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;@337f4c32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:49:01,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 16:49:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 671 states, 668 states have (on average 1.7949101796407185) internal successors, (1199), 670 states have internal predecessors, (1199), 0 states have call successors, (0), 0 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:49:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 16:49:01,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:01,861 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] [2025-02-05 16:49:01,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:01,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:01,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1562932669, now seen corresponding path program 1 times [2025-02-05 16:49:01,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:01,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006792555] [2025-02-05 16:49:01,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:01,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:02,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 16:49:02,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 16:49:02,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:02,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:03,271 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:49:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:03,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006792555] [2025-02-05 16:49:03,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006792555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:03,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:03,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:03,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999099926] [2025-02-05 16:49:03,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:03,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:03,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:03,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:03,293 INFO L87 Difference]: Start difference. First operand has 671 states, 668 states have (on average 1.7949101796407185) internal successors, (1199), 670 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:49:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:03,568 INFO L93 Difference]: Finished difference Result 3255 states and 5826 transitions. [2025-02-05 16:49:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:49:03,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2025-02-05 16:49:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:03,586 INFO L225 Difference]: With dead ends: 3255 [2025-02-05 16:49:03,586 INFO L226 Difference]: Without dead ends: 2587 [2025-02-05 16:49:03,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:49:03,592 INFO L435 NwaCegarLoop]: 1781 mSDtfsCounter, 3820 mSDsluCounter, 2889 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3820 SdHoareTripleChecker+Valid, 4670 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:03,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3820 Valid, 4670 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:49:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-02-05 16:49:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 1272. [2025-02-05 16:49:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1270 states have (on average 1.5677165354330709) internal successors, (1991), 1271 states have internal predecessors, (1991), 0 states have call successors, (0), 0 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:49:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1991 transitions. [2025-02-05 16:49:03,677 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1991 transitions. Word has length 243 [2025-02-05 16:49:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:03,678 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1991 transitions. [2025-02-05 16:49:03,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:49:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1991 transitions. [2025-02-05 16:49:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 16:49:03,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:03,681 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] [2025-02-05 16:49:03,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:49:03,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:03,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1428795553, now seen corresponding path program 1 times [2025-02-05 16:49:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:03,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870999170] [2025-02-05 16:49:03,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:03,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 16:49:03,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 16:49:03,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:03,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:03,971 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:49:03,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:03,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870999170] [2025-02-05 16:49:03,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870999170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:03,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:03,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:03,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547037986] [2025-02-05 16:49:03,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:03,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:03,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:03,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:03,976 INFO L87 Difference]: Start difference. First operand 1272 states and 1991 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:49:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:04,069 INFO L93 Difference]: Finished difference Result 3644 states and 5671 transitions. [2025-02-05 16:49:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:04,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 245 [2025-02-05 16:49:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:04,082 INFO L225 Difference]: With dead ends: 3644 [2025-02-05 16:49:04,082 INFO L226 Difference]: Without dead ends: 2497 [2025-02-05 16:49:04,085 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:49:04,087 INFO L435 NwaCegarLoop]: 2031 mSDtfsCounter, 909 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:04,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 3026 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2025-02-05 16:49:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2463. [2025-02-05 16:49:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 2461 states have (on average 1.559934985778139) internal successors, (3839), 2462 states have internal predecessors, (3839), 0 states have call successors, (0), 0 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:49:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3839 transitions. [2025-02-05 16:49:04,143 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3839 transitions. Word has length 245 [2025-02-05 16:49:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:04,143 INFO L471 AbstractCegarLoop]: Abstraction has 2463 states and 3839 transitions. [2025-02-05 16:49:04,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:49:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3839 transitions. [2025-02-05 16:49:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 16:49:04,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:04,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:04,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:49:04,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:04,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash 480377542, now seen corresponding path program 1 times [2025-02-05 16:49:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:04,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724476868] [2025-02-05 16:49:04,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:04,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:04,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 16:49:04,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 16:49:04,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:04,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:04,315 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:49:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:04,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724476868] [2025-02-05 16:49:04,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724476868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:04,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:04,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359299362] [2025-02-05 16:49:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:04,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:04,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:04,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:04,317 INFO L87 Difference]: Start difference. First operand 2463 states and 3839 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:49:04,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:04,405 INFO L93 Difference]: Finished difference Result 7322 states and 11401 transitions. [2025-02-05 16:49:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:04,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 245 [2025-02-05 16:49:04,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:04,421 INFO L225 Difference]: With dead ends: 7322 [2025-02-05 16:49:04,421 INFO L226 Difference]: Without dead ends: 4897 [2025-02-05 16:49:04,425 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:49:04,425 INFO L435 NwaCegarLoop]: 2076 mSDtfsCounter, 1035 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:04,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 3112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:04,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4897 states. [2025-02-05 16:49:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4897 to 2482. [2025-02-05 16:49:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2480 states have (on average 1.5592741935483871) internal successors, (3867), 2481 states have internal predecessors, (3867), 0 states have call successors, (0), 0 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:49:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3867 transitions. [2025-02-05 16:49:04,483 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3867 transitions. Word has length 245 [2025-02-05 16:49:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:04,483 INFO L471 AbstractCegarLoop]: Abstraction has 2482 states and 3867 transitions. [2025-02-05 16:49:04,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:49:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3867 transitions. [2025-02-05 16:49:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-02-05 16:49:04,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:04,488 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] [2025-02-05 16:49:04,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:49:04,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:04,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1443512384, now seen corresponding path program 1 times [2025-02-05 16:49:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505459293] [2025-02-05 16:49:04,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:04,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:04,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-05 16:49:04,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-05 16:49:04,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:04,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:04,639 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:49:04,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505459293] [2025-02-05 16:49:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505459293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:04,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363250221] [2025-02-05 16:49:04,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:04,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:04,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:04,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:04,640 INFO L87 Difference]: Start difference. First operand 2482 states and 3867 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:49:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:04,727 INFO L93 Difference]: Finished difference Result 4926 states and 7667 transitions. [2025-02-05 16:49:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-02-05 16:49:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:04,735 INFO L225 Difference]: With dead ends: 4926 [2025-02-05 16:49:04,735 INFO L226 Difference]: Without dead ends: 2500 [2025-02-05 16:49:04,737 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:49:04,737 INFO L435 NwaCegarLoop]: 1059 mSDtfsCounter, 5 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:04,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2103 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2025-02-05 16:49:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2500. [2025-02-05 16:49:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2498 states have (on average 1.5564451561249) internal successors, (3888), 2499 states have internal predecessors, (3888), 0 states have call successors, (0), 0 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:49:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3888 transitions. [2025-02-05 16:49:04,782 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3888 transitions. Word has length 246 [2025-02-05 16:49:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:04,783 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3888 transitions. [2025-02-05 16:49:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:49:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3888 transitions. [2025-02-05 16:49:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-05 16:49:04,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:04,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] [2025-02-05 16:49:04,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:49:04,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:04,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash 948038052, now seen corresponding path program 1 times [2025-02-05 16:49:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:04,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783348272] [2025-02-05 16:49:04,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:04,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-05 16:49:04,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-05 16:49:04,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:04,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:04,984 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:49:04,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:04,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783348272] [2025-02-05 16:49:04,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783348272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:04,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:04,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041806157] [2025-02-05 16:49:04,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:04,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:04,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:04,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:04,986 INFO L87 Difference]: Start difference. First operand 2500 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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:49:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:05,090 INFO L93 Difference]: Finished difference Result 7072 states and 10935 transitions. [2025-02-05 16:49:05,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:05,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-02-05 16:49:05,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:05,105 INFO L225 Difference]: With dead ends: 7072 [2025-02-05 16:49:05,105 INFO L226 Difference]: Without dead ends: 4813 [2025-02-05 16:49:05,108 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:49:05,109 INFO L435 NwaCegarLoop]: 2038 mSDtfsCounter, 903 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 3033 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:05,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 3033 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2025-02-05 16:49:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4781. [2025-02-05 16:49:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4781 states, 4779 states have (on average 1.5450931157145846) internal successors, (7384), 4780 states have internal predecessors, (7384), 0 states have call successors, (0), 0 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:49:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 7384 transitions. [2025-02-05 16:49:05,202 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 7384 transitions. Word has length 247 [2025-02-05 16:49:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:05,203 INFO L471 AbstractCegarLoop]: Abstraction has 4781 states and 7384 transitions. [2025-02-05 16:49:05,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 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:49:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 7384 transitions. [2025-02-05 16:49:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-05 16:49:05,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:05,210 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] [2025-02-05 16:49:05,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:49:05,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:05,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash 548531622, now seen corresponding path program 1 times [2025-02-05 16:49:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:05,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636214866] [2025-02-05 16:49:05,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:05,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:05,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-05 16:49:05,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-05 16:49:05,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:05,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:05,853 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:49:05,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636214866] [2025-02-05 16:49:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636214866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:05,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:05,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635642557] [2025-02-05 16:49:05,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:05,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:05,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:05,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:05,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:05,855 INFO L87 Difference]: Start difference. First operand 4781 states and 7384 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 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:49:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:06,101 INFO L93 Difference]: Finished difference Result 18204 states and 27992 transitions. [2025-02-05 16:49:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:06,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-02-05 16:49:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:06,145 INFO L225 Difference]: With dead ends: 18204 [2025-02-05 16:49:06,145 INFO L226 Difference]: Without dead ends: 13599 [2025-02-05 16:49:06,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:06,156 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2327 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 3846 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:06,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2327 Valid, 3846 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13599 states. [2025-02-05 16:49:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13599 to 9184. [2025-02-05 16:49:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9184 states, 9182 states have (on average 1.5311478980614246) internal successors, (14059), 9183 states have internal predecessors, (14059), 0 states have call successors, (0), 0 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:49:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9184 states to 9184 states and 14059 transitions. [2025-02-05 16:49:06,356 INFO L78 Accepts]: Start accepts. Automaton has 9184 states and 14059 transitions. Word has length 247 [2025-02-05 16:49:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:06,357 INFO L471 AbstractCegarLoop]: Abstraction has 9184 states and 14059 transitions. [2025-02-05 16:49:06,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 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:49:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9184 states and 14059 transitions. [2025-02-05 16:49:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 16:49:06,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:06,369 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] [2025-02-05 16:49:06,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:49:06,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1208473112, now seen corresponding path program 1 times [2025-02-05 16:49:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442087606] [2025-02-05 16:49:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:06,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 16:49:06,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 16:49:06,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:06,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:07,084 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:49:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442087606] [2025-02-05 16:49:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442087606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450987441] [2025-02-05 16:49:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:07,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:07,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:07,086 INFO L87 Difference]: Start difference. First operand 9184 states and 14059 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:49:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:07,228 INFO L93 Difference]: Finished difference Result 26577 states and 40501 transitions. [2025-02-05 16:49:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:07,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-02-05 16:49:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:07,263 INFO L225 Difference]: With dead ends: 26577 [2025-02-05 16:49:07,263 INFO L226 Difference]: Without dead ends: 18227 [2025-02-05 16:49:07,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:07,279 INFO L435 NwaCegarLoop]: 2065 mSDtfsCounter, 992 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 5166 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:07,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 5166 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18227 states. [2025-02-05 16:49:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18227 to 10101. [2025-02-05 16:49:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10101 states, 10099 states have (on average 1.5471828893949897) internal successors, (15625), 10100 states have internal predecessors, (15625), 0 states have call successors, (0), 0 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:49:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10101 states to 10101 states and 15625 transitions. [2025-02-05 16:49:07,558 INFO L78 Accepts]: Start accepts. Automaton has 10101 states and 15625 transitions. Word has length 249 [2025-02-05 16:49:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:07,558 INFO L471 AbstractCegarLoop]: Abstraction has 10101 states and 15625 transitions. [2025-02-05 16:49:07,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:49:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 10101 states and 15625 transitions. [2025-02-05 16:49:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 16:49:07,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:07,571 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] [2025-02-05 16:49:07,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:49:07,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:07,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:07,571 INFO L85 PathProgramCache]: Analyzing trace with hash 103263625, now seen corresponding path program 1 times [2025-02-05 16:49:07,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:07,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256810161] [2025-02-05 16:49:07,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:07,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 16:49:07,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 16:49:07,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:07,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:07,706 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:49:07,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:07,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256810161] [2025-02-05 16:49:07,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256810161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:07,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:07,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:07,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350266276] [2025-02-05 16:49:07,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:07,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:07,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:07,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:07,709 INFO L87 Difference]: Start difference. First operand 10101 states and 15625 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:49:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:07,913 INFO L93 Difference]: Finished difference Result 28405 states and 43654 transitions. [2025-02-05 16:49:07,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:07,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-02-05 16:49:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:07,951 INFO L225 Difference]: With dead ends: 28405 [2025-02-05 16:49:07,951 INFO L226 Difference]: Without dead ends: 19419 [2025-02-05 16:49:07,965 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:49:07,966 INFO L435 NwaCegarLoop]: 2024 mSDtfsCounter, 890 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:07,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 3019 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19419 states. [2025-02-05 16:49:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19419 to 19396. [2025-02-05 16:49:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19396 states, 19394 states have (on average 1.53372176961947) internal successors, (29745), 19395 states have internal predecessors, (29745), 0 states have call successors, (0), 0 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:49:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19396 states to 19396 states and 29745 transitions. [2025-02-05 16:49:08,319 INFO L78 Accepts]: Start accepts. Automaton has 19396 states and 29745 transitions. Word has length 249 [2025-02-05 16:49:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:08,321 INFO L471 AbstractCegarLoop]: Abstraction has 19396 states and 29745 transitions. [2025-02-05 16:49:08,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:49:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19396 states and 29745 transitions. [2025-02-05 16:49:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 16:49:08,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:08,350 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] [2025-02-05 16:49:08,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:49:08,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:08,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash -695128308, now seen corresponding path program 1 times [2025-02-05 16:49:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097601854] [2025-02-05 16:49:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:08,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 16:49:08,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 16:49:08,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:08,499 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:49:08,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097601854] [2025-02-05 16:49:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097601854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:08,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:08,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589930741] [2025-02-05 16:49:08,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:08,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:08,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:08,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:08,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:08,503 INFO L87 Difference]: Start difference. First operand 19396 states and 29745 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:49:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:08,654 INFO L93 Difference]: Finished difference Result 38122 states and 58684 transitions. [2025-02-05 16:49:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-02-05 16:49:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:08,695 INFO L225 Difference]: With dead ends: 38122 [2025-02-05 16:49:08,695 INFO L226 Difference]: Without dead ends: 25758 [2025-02-05 16:49:08,717 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:49:08,720 INFO L435 NwaCegarLoop]: 1395 mSDtfsCounter, 536 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:08,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2229 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25758 states. [2025-02-05 16:49:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25758 to 23052. [2025-02-05 16:49:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23052 states, 23050 states have (on average 1.5490238611713667) internal successors, (35705), 23051 states have internal predecessors, (35705), 0 states have call successors, (0), 0 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:49:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23052 states to 23052 states and 35705 transitions. [2025-02-05 16:49:09,151 INFO L78 Accepts]: Start accepts. Automaton has 23052 states and 35705 transitions. Word has length 249 [2025-02-05 16:49:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:09,151 INFO L471 AbstractCegarLoop]: Abstraction has 23052 states and 35705 transitions. [2025-02-05 16:49:09,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:49:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 23052 states and 35705 transitions. [2025-02-05 16:49:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 16:49:09,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:09,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:09,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:49:09,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:09,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1467079172, now seen corresponding path program 1 times [2025-02-05 16:49:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:09,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675819800] [2025-02-05 16:49:09,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:09,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:09,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 16:49:09,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 16:49:09,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:09,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:09,294 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:49:09,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:09,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675819800] [2025-02-05 16:49:09,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675819800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:09,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:09,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090836468] [2025-02-05 16:49:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:09,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:09,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:09,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:09,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:09,297 INFO L87 Difference]: Start difference. First operand 23052 states and 35705 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:49:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:09,458 INFO L93 Difference]: Finished difference Result 63458 states and 97297 transitions. [2025-02-05 16:49:09,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:09,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-02-05 16:49:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:09,529 INFO L225 Difference]: With dead ends: 63458 [2025-02-05 16:49:09,530 INFO L226 Difference]: Without dead ends: 43254 [2025-02-05 16:49:09,558 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:49:09,559 INFO L435 NwaCegarLoop]: 2011 mSDtfsCounter, 921 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:09,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 3003 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43254 states. [2025-02-05 16:49:10,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43254 to 43228. [2025-02-05 16:49:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43228 states, 43226 states have (on average 1.5290103178642485) internal successors, (66093), 43227 states have internal predecessors, (66093), 0 states have call successors, (0), 0 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:49:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43228 states to 43228 states and 66093 transitions. [2025-02-05 16:49:10,182 INFO L78 Accepts]: Start accepts. Automaton has 43228 states and 66093 transitions. Word has length 251 [2025-02-05 16:49:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:10,183 INFO L471 AbstractCegarLoop]: Abstraction has 43228 states and 66093 transitions. [2025-02-05 16:49:10,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:49:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 43228 states and 66093 transitions. [2025-02-05 16:49:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 16:49:10,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:10,225 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] [2025-02-05 16:49:10,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:49:10,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:10,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:10,227 INFO L85 PathProgramCache]: Analyzing trace with hash 646468705, now seen corresponding path program 1 times [2025-02-05 16:49:10,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778116597] [2025-02-05 16:49:10,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:10,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 16:49:10,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 16:49:10,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:10,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:10,327 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:49:10,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:10,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778116597] [2025-02-05 16:49:10,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778116597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:10,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905057184] [2025-02-05 16:49:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:10,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:10,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:10,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:10,329 INFO L87 Difference]: Start difference. First operand 43228 states and 66093 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:49:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:10,710 INFO L93 Difference]: Finished difference Result 121692 states and 184701 transitions. [2025-02-05 16:49:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:10,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-02-05 16:49:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:10,862 INFO L225 Difference]: With dead ends: 121692 [2025-02-05 16:49:10,862 INFO L226 Difference]: Without dead ends: 82432 [2025-02-05 16:49:10,917 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:49:10,917 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 893 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:10,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 2084 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82432 states. [2025-02-05 16:49:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82432 to 44036. [2025-02-05 16:49:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44036 states, 44034 states have (on average 1.5249352772857339) internal successors, (67149), 44035 states have internal predecessors, (67149), 0 states have call successors, (0), 0 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:49:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44036 states to 44036 states and 67149 transitions. [2025-02-05 16:49:11,795 INFO L78 Accepts]: Start accepts. Automaton has 44036 states and 67149 transitions. Word has length 251 [2025-02-05 16:49:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:11,796 INFO L471 AbstractCegarLoop]: Abstraction has 44036 states and 67149 transitions. [2025-02-05 16:49:11,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:49:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 44036 states and 67149 transitions. [2025-02-05 16:49:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 16:49:11,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:11,827 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] [2025-02-05 16:49:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:49:11,827 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -51341221, now seen corresponding path program 1 times [2025-02-05 16:49:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283383365] [2025-02-05 16:49:11,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:11,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 16:49:11,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 16:49:11,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:11,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:11,929 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:49:11,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283383365] [2025-02-05 16:49:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283383365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:11,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:11,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:11,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701463364] [2025-02-05 16:49:11,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:11,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:11,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:11,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:11,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:11,931 INFO L87 Difference]: Start difference. First operand 44036 states and 67149 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:49:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:12,100 INFO L93 Difference]: Finished difference Result 84504 states and 128351 transitions. [2025-02-05 16:49:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:12,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-02-05 16:49:12,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:12,161 INFO L225 Difference]: With dead ends: 84504 [2025-02-05 16:49:12,162 INFO L226 Difference]: Without dead ends: 45136 [2025-02-05 16:49:12,198 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:49:12,198 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 7 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:12,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2096 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45136 states. [2025-02-05 16:49:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45136 to 45136. [2025-02-05 16:49:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45136 states, 45134 states have (on average 1.5171046217928834) internal successors, (68473), 45135 states have internal predecessors, (68473), 0 states have call successors, (0), 0 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:49:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45136 states to 45136 states and 68473 transitions. [2025-02-05 16:49:13,019 INFO L78 Accepts]: Start accepts. Automaton has 45136 states and 68473 transitions. Word has length 252 [2025-02-05 16:49:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:13,019 INFO L471 AbstractCegarLoop]: Abstraction has 45136 states and 68473 transitions. [2025-02-05 16:49:13,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:49:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 45136 states and 68473 transitions. [2025-02-05 16:49:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 16:49:13,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:13,050 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] [2025-02-05 16:49:13,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:49:13,051 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:13,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1059758271, now seen corresponding path program 1 times [2025-02-05 16:49:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:13,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024052772] [2025-02-05 16:49:13,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:13,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:13,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 16:49:13,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 16:49:13,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:13,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:13,729 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:49:13,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:13,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024052772] [2025-02-05 16:49:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024052772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:13,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:13,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022614076] [2025-02-05 16:49:13,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:13,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:13,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:13,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:13,731 INFO L87 Difference]: Start difference. First operand 45136 states and 68473 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 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:49:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:14,063 INFO L93 Difference]: Finished difference Result 126216 states and 190807 transitions. [2025-02-05 16:49:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:14,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2025-02-05 16:49:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:14,165 INFO L225 Difference]: With dead ends: 126216 [2025-02-05 16:49:14,166 INFO L226 Difference]: Without dead ends: 86208 [2025-02-05 16:49:14,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:14,211 INFO L435 NwaCegarLoop]: 2069 mSDtfsCounter, 997 mSDsluCounter, 3102 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 5171 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:14,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 5171 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86208 states. [2025-02-05 16:49:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86208 to 47812. [2025-02-05 16:49:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47812 states, 47810 states have (on average 1.5125496758000418) internal successors, (72315), 47811 states have internal predecessors, (72315), 0 states have call successors, (0), 0 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:49:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47812 states to 47812 states and 72315 transitions. [2025-02-05 16:49:14,990 INFO L78 Accepts]: Start accepts. Automaton has 47812 states and 72315 transitions. Word has length 253 [2025-02-05 16:49:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:14,990 INFO L471 AbstractCegarLoop]: Abstraction has 47812 states and 72315 transitions. [2025-02-05 16:49:14,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 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:49:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 47812 states and 72315 transitions. [2025-02-05 16:49:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 16:49:15,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:15,170 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] [2025-02-05 16:49:15,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:49:15,171 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:15,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1569745357, now seen corresponding path program 1 times [2025-02-05 16:49:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295127956] [2025-02-05 16:49:15,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:15,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:15,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 16:49:15,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 16:49:15,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:15,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:15,660 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:49:15,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:15,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295127956] [2025-02-05 16:49:15,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295127956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:15,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:15,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:15,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701703728] [2025-02-05 16:49:15,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:15,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:15,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:15,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:15,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:15,663 INFO L87 Difference]: Start difference. First operand 47812 states and 72315 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:49:15,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:15,841 INFO L93 Difference]: Finished difference Result 86208 states and 130233 transitions. [2025-02-05 16:49:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:15,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-02-05 16:49:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:15,899 INFO L225 Difference]: With dead ends: 86208 [2025-02-05 16:49:15,900 INFO L226 Difference]: Without dead ends: 47300 [2025-02-05 16:49:15,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:15,940 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 81 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:15,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 3364 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47300 states. [2025-02-05 16:49:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47300 to 46964. [2025-02-05 16:49:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46964 states, 46962 states have (on average 1.5113496018057153) internal successors, (70976), 46963 states have internal predecessors, (70976), 0 states have call successors, (0), 0 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:49:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46964 states to 46964 states and 70976 transitions. [2025-02-05 16:49:16,735 INFO L78 Accepts]: Start accepts. Automaton has 46964 states and 70976 transitions. Word has length 255 [2025-02-05 16:49:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:16,735 INFO L471 AbstractCegarLoop]: Abstraction has 46964 states and 70976 transitions. [2025-02-05 16:49:16,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:49:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 46964 states and 70976 transitions. [2025-02-05 16:49:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 16:49:16,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:16,766 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] [2025-02-05 16:49:16,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:49:16,766 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:16,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash 646935334, now seen corresponding path program 1 times [2025-02-05 16:49:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:16,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209093119] [2025-02-05 16:49:16,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:16,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 16:49:16,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 16:49:16,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:16,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:17,266 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:49:17,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209093119] [2025-02-05 16:49:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209093119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699111391] [2025-02-05 16:49:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:17,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:17,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:17,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:17,269 INFO L87 Difference]: Start difference. First operand 46964 states and 70976 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:49:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:17,423 INFO L93 Difference]: Finished difference Result 80691 states and 121522 transitions. [2025-02-05 16:49:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:17,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-02-05 16:49:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:17,472 INFO L225 Difference]: With dead ends: 80691 [2025-02-05 16:49:17,473 INFO L226 Difference]: Without dead ends: 40060 [2025-02-05 16:49:17,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:17,511 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 94 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:17,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 3394 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2025-02-05 16:49:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 39515. [2025-02-05 16:49:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39515 states, 39513 states have (on average 1.5126667172829196) internal successors, (59770), 39514 states have internal predecessors, (59770), 0 states have call successors, (0), 0 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:49:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39515 states to 39515 states and 59770 transitions. [2025-02-05 16:49:17,989 INFO L78 Accepts]: Start accepts. Automaton has 39515 states and 59770 transitions. Word has length 255 [2025-02-05 16:49:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:17,990 INFO L471 AbstractCegarLoop]: Abstraction has 39515 states and 59770 transitions. [2025-02-05 16:49:17,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:49:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 39515 states and 59770 transitions. [2025-02-05 16:49:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-02-05 16:49:18,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:18,017 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] [2025-02-05 16:49:18,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:49:18,018 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:18,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1082253733, now seen corresponding path program 1 times [2025-02-05 16:49:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660542135] [2025-02-05 16:49:18,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:18,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-05 16:49:18,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-05 16:49:18,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:18,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:18,109 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:49:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:18,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660542135] [2025-02-05 16:49:18,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660542135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:18,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:18,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385429536] [2025-02-05 16:49:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:18,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:18,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:18,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:18,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:18,113 INFO L87 Difference]: Start difference. First operand 39515 states and 59770 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:49:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:18,295 INFO L93 Difference]: Finished difference Result 79287 states and 121839 transitions. [2025-02-05 16:49:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-02-05 16:49:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:18,360 INFO L225 Difference]: With dead ends: 79287 [2025-02-05 16:49:18,361 INFO L226 Difference]: Without dead ends: 54400 [2025-02-05 16:49:18,394 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:49:18,396 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 540 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:18,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2184 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54400 states. [2025-02-05 16:49:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54400 to 50581. [2025-02-05 16:49:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50581 states, 50579 states have (on average 1.537515569702841) internal successors, (77766), 50580 states have internal predecessors, (77766), 0 states have call successors, (0), 0 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:49:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50581 states to 50581 states and 77766 transitions. [2025-02-05 16:49:19,195 INFO L78 Accepts]: Start accepts. Automaton has 50581 states and 77766 transitions. Word has length 256 [2025-02-05 16:49:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:19,196 INFO L471 AbstractCegarLoop]: Abstraction has 50581 states and 77766 transitions. [2025-02-05 16:49:19,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:49:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 50581 states and 77766 transitions. [2025-02-05 16:49:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-02-05 16:49:19,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:19,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:49:19,229 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:19,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:19,230 INFO L85 PathProgramCache]: Analyzing trace with hash -327475334, now seen corresponding path program 1 times [2025-02-05 16:49:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:19,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872562538] [2025-02-05 16:49:19,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:19,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:19,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-05 16:49:19,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-05 16:49:19,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:19,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:19,348 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:49:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:19,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872562538] [2025-02-05 16:49:19,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872562538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:19,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:19,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:19,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232452141] [2025-02-05 16:49:19,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:19,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:19,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:19,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:19,350 INFO L87 Difference]: Start difference. First operand 50581 states and 77766 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:49:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:19,827 INFO L93 Difference]: Finished difference Result 112670 states and 176316 transitions. [2025-02-05 16:49:19,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:19,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-02-05 16:49:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:19,915 INFO L225 Difference]: With dead ends: 112670 [2025-02-05 16:49:19,915 INFO L226 Difference]: Without dead ends: 75718 [2025-02-05 16:49:19,963 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:49:19,963 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 531 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:19,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 2198 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75718 states. [2025-02-05 16:49:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75718 to 70496. [2025-02-05 16:49:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70496 states, 70494 states have (on average 1.5643175305699777) internal successors, (110275), 70495 states have internal predecessors, (110275), 0 states have call successors, (0), 0 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:49:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70496 states to 70496 states and 110275 transitions. [2025-02-05 16:49:20,796 INFO L78 Accepts]: Start accepts. Automaton has 70496 states and 110275 transitions. Word has length 256 [2025-02-05 16:49:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:20,797 INFO L471 AbstractCegarLoop]: Abstraction has 70496 states and 110275 transitions. [2025-02-05 16:49:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:49:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 70496 states and 110275 transitions. [2025-02-05 16:49:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 16:49:20,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:20,821 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] [2025-02-05 16:49:20,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:49:20,821 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:20,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1942757377, now seen corresponding path program 1 times [2025-02-05 16:49:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:20,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037479683] [2025-02-05 16:49:20,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:20,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:20,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 16:49:20,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 16:49:20,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:20,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:20,908 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:49:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:20,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037479683] [2025-02-05 16:49:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037479683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:20,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:20,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780906964] [2025-02-05 16:49:20,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:20,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:20,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:20,910 INFO L87 Difference]: Start difference. First operand 70496 states and 110275 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:49:21,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:21,541 INFO L93 Difference]: Finished difference Result 166896 states and 265773 transitions. [2025-02-05 16:49:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:21,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-02-05 16:49:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:21,693 INFO L225 Difference]: With dead ends: 166896 [2025-02-05 16:49:21,693 INFO L226 Difference]: Without dead ends: 112042 [2025-02-05 16:49:21,749 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:49:21,750 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 544 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:21,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 2161 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112042 states. [2025-02-05 16:49:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112042 to 106196. [2025-02-05 16:49:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106196 states, 106194 states have (on average 1.5793076821666008) internal successors, (167713), 106195 states have internal predecessors, (167713), 0 states have call successors, (0), 0 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:49:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106196 states to 106196 states and 167713 transitions. [2025-02-05 16:49:23,623 INFO L78 Accepts]: Start accepts. Automaton has 106196 states and 167713 transitions. Word has length 257 [2025-02-05 16:49:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:23,624 INFO L471 AbstractCegarLoop]: Abstraction has 106196 states and 167713 transitions. [2025-02-05 16:49:23,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:49:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 106196 states and 167713 transitions. [2025-02-05 16:49:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 16:49:23,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:23,646 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] [2025-02-05 16:49:23,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:49:23,647 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:23,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:23,647 INFO L85 PathProgramCache]: Analyzing trace with hash -271934794, now seen corresponding path program 1 times [2025-02-05 16:49:23,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:23,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921040277] [2025-02-05 16:49:23,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:23,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:23,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 16:49:23,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 16:49:23,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:23,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:24,008 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:49:24,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:24,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921040277] [2025-02-05 16:49:24,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921040277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:24,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:24,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:49:24,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454398042] [2025-02-05 16:49:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:24,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:49:24,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:24,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:49:24,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:49:24,010 INFO L87 Difference]: Start difference. First operand 106196 states and 167713 transitions. Second operand has 8 states, 8 states have (on average 32.125) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:49:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:25,780 INFO L93 Difference]: Finished difference Result 365453 states and 579204 transitions. [2025-02-05 16:49:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:49:25,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-02-05 16:49:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:26,205 INFO L225 Difference]: With dead ends: 365453 [2025-02-05 16:49:26,205 INFO L226 Difference]: Without dead ends: 273777 [2025-02-05 16:49:26,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:49:26,332 INFO L435 NwaCegarLoop]: 1057 mSDtfsCounter, 11046 mSDsluCounter, 2664 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11046 SdHoareTripleChecker+Valid, 3721 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:26,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11046 Valid, 3721 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:49:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273777 states. [2025-02-05 16:49:29,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273777 to 148358. [2025-02-05 16:49:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148358 states, 148356 states have (on average 1.5632060718811507) internal successors, (231911), 148357 states have internal predecessors, (231911), 0 states have call successors, (0), 0 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:49:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148358 states to 148358 states and 231911 transitions. [2025-02-05 16:49:29,423 INFO L78 Accepts]: Start accepts. Automaton has 148358 states and 231911 transitions. Word has length 257 [2025-02-05 16:49:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:29,423 INFO L471 AbstractCegarLoop]: Abstraction has 148358 states and 231911 transitions. [2025-02-05 16:49:29,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:49:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 148358 states and 231911 transitions. [2025-02-05 16:49:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 16:49:29,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:29,451 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] [2025-02-05 16:49:29,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:49:29,451 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1089583244, now seen corresponding path program 1 times [2025-02-05 16:49:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:29,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058574943] [2025-02-05 16:49:29,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:29,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 16:49:29,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 16:49:29,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:29,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:30,115 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:49:30,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058574943] [2025-02-05 16:49:30,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058574943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:30,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:30,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002501639] [2025-02-05 16:49:30,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:30,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:30,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:30,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:30,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:30,117 INFO L87 Difference]: Start difference. First operand 148358 states and 231911 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:49:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:31,502 INFO L93 Difference]: Finished difference Result 427648 states and 668162 transitions. [2025-02-05 16:49:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-02-05 16:49:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:31,905 INFO L225 Difference]: With dead ends: 427648 [2025-02-05 16:49:31,905 INFO L226 Difference]: Without dead ends: 280203 [2025-02-05 16:49:31,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:31,966 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 906 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 3565 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:31,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 3565 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280203 states. [2025-02-05 16:49:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280203 to 280185. [2025-02-05 16:49:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280185 states, 280183 states have (on average 1.5548409432406678) internal successors, (435640), 280184 states have internal predecessors, (435640), 0 states have call successors, (0), 0 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:49:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280185 states to 280185 states and 435640 transitions. [2025-02-05 16:49:35,878 INFO L78 Accepts]: Start accepts. Automaton has 280185 states and 435640 transitions. Word has length 257 [2025-02-05 16:49:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:35,878 INFO L471 AbstractCegarLoop]: Abstraction has 280185 states and 435640 transitions. [2025-02-05 16:49:35,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:49:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 280185 states and 435640 transitions. [2025-02-05 16:49:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 16:49:35,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:35,922 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] [2025-02-05 16:49:35,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:49:35,923 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:35,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1771398037, now seen corresponding path program 1 times [2025-02-05 16:49:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:35,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542405054] [2025-02-05 16:49:35,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:35,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:35,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 16:49:35,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 16:49:35,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:35,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:36,003 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:49:36,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:36,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542405054] [2025-02-05 16:49:36,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542405054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:36,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:36,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:36,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541025985] [2025-02-05 16:49:36,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:36,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:36,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:36,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:36,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:36,005 INFO L87 Difference]: Start difference. First operand 280185 states and 435640 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:49:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:38,938 INFO L93 Difference]: Finished difference Result 819360 states and 1273556 transitions. [2025-02-05 16:49:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-02-05 16:49:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:40,038 INFO L225 Difference]: With dead ends: 819360 [2025-02-05 16:49:40,038 INFO L226 Difference]: Without dead ends: 545986 [2025-02-05 16:49:40,259 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:49:40,260 INFO L435 NwaCegarLoop]: 1962 mSDtfsCounter, 862 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:40,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 2933 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545986 states.