./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53c628562139f348a432948065ec43f1ca859b0a402aa2530432925237a49f95 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:39:26,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:39:27,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:39:27,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:39:27,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:39:27,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:39:27,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:39:27,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:39:27,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:39:27,059 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:39:27,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:39:27,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:39:27,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:39:27,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:39:27,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:39:27,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:39:27,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:39:27,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:39:27,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:39:27,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:39:27,063 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53c628562139f348a432948065ec43f1ca859b0a402aa2530432925237a49f95 [2025-03-16 19:39:27,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:39:27,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:39:27,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:39:27,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:39:27,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:39:27,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-16 19:39:28,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/074879dd2/ce5d1407620a43b6acac4b231a5ad7d5/FLAG6004a337d [2025-03-16 19:39:28,796 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:39:28,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-16 19:39:28,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/074879dd2/ce5d1407620a43b6acac4b231a5ad7d5/FLAG6004a337d [2025-03-16 19:39:29,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/074879dd2/ce5d1407620a43b6acac4b231a5ad7d5 [2025-03-16 19:39:29,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:39:29,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:39:29,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:39:29,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:39:29,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:39:29,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:29,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6736cdbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29, skipping insertion in model container [2025-03-16 19:39:29,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:29,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:39:29,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[34889,34902] [2025-03-16 19:39:29,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:39:29,670 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:39:29,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[34889,34902] [2025-03-16 19:39:29,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:39:29,922 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:39:29,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29 WrapperNode [2025-03-16 19:39:29,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:39:29,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:39:29,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:39:29,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:39:29,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:29,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,025 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3057 [2025-03-16 19:39:30,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:39:30,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:39:30,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:39:30,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:39:30,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,087 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:39:30,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:39:30,142 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:39:30,142 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:39:30,142 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:39:30,143 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ... [2025-03-16 19:39:30,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:39:30,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:39:30,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:39:30,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:39:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:39:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:39:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:39:30,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:39:30,343 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:39:30,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:39:32,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2018: havoc main_~node1__newmax~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1;havoc main_~node4__newmax~5#1;havoc main_~node3__newmax~5#1;havoc main_~node2__newmax~5#1;havoc main_~node1__newmax~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__newmax~4#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__newmax~4#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__newmax~4#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~node1__newmax~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node4__newmax~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1;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-03-16 19:39:32,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-16 19:39:32,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2102: havoc main_~node3__newmax~6#1; [2025-03-16 19:39:32,034 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:39:32,034 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2060: havoc main_~node2__newmax~6#1; [2025-03-16 19:39:32,034 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2726: havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:39:32,034 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-16 19:39:32,034 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2210: havoc main_~check__tmp~6#1; [2025-03-16 19:39:32,034 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2144: havoc main_~node4__newmax~6#1; [2025-03-16 19:39:32,291 INFO L? ?]: Removed 210 outVars from TransFormulas that were not future-live. [2025-03-16 19:39:32,292 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:39:32,316 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:39:32,317 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:39:32,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:39:32 BoogieIcfgContainer [2025-03-16 19:39:32,317 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:39:32,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:39:32,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:39:32,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:39:32,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:39:29" (1/3) ... [2025-03-16 19:39:32,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16237c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:39:32, skipping insertion in model container [2025-03-16 19:39:32,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (2/3) ... [2025-03-16 19:39:32,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16237c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:39:32, skipping insertion in model container [2025-03-16 19:39:32,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:39:32" (3/3) ... [2025-03-16 19:39:32,324 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-16 19:39:32,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:39:32,339 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 777 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:39:32,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:39:32,417 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;@739fbdfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:39:32,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:39:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 777 states, 775 states have (on average 1.7806451612903227) internal successors, (1380), 776 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-16 19:39:32,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:32,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:32,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:32,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash -93422615, now seen corresponding path program 1 times [2025-03-16 19:39:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609792045] [2025-03-16 19:39:32,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:32,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:32,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-16 19:39:33,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-16 19:39:33,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:33,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:34,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:34,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609792045] [2025-03-16 19:39:34,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609792045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:34,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:34,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:34,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528882626] [2025-03-16 19:39:34,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:34,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:39:34,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:34,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:39:34,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:34,032 INFO L87 Difference]: Start difference. First operand has 777 states, 775 states have (on average 1.7806451612903227) internal successors, (1380), 776 states have internal predecessors, (1380), 0 states have call successors, (0), 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 76.75) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:34,283 INFO L93 Difference]: Finished difference Result 2986 states and 5307 transitions. [2025-03-16 19:39:34,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:39:34,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 307 [2025-03-16 19:39:34,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:34,304 INFO L225 Difference]: With dead ends: 2986 [2025-03-16 19:39:34,304 INFO L226 Difference]: Without dead ends: 2248 [2025-03-16 19:39:34,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:34,315 INFO L435 NwaCegarLoop]: 2162 mSDtfsCounter, 3046 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3046 SdHoareTripleChecker+Valid, 4745 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:34,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3046 Valid, 4745 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:39:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2025-03-16 19:39:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 1514. [2025-03-16 19:39:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 1.5690680766688698) internal successors, (2374), 1513 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2374 transitions. [2025-03-16 19:39:34,421 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2374 transitions. Word has length 307 [2025-03-16 19:39:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:34,422 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2374 transitions. [2025-03-16 19:39:34,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2374 transitions. [2025-03-16 19:39:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-16 19:39:34,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:34,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:34,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:39:34,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:34,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 129202661, now seen corresponding path program 1 times [2025-03-16 19:39:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093067777] [2025-03-16 19:39:34,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:34,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:34,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-16 19:39:34,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-16 19:39:34,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:34,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:34,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093067777] [2025-03-16 19:39:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093067777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:34,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:34,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:34,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775707717] [2025-03-16 19:39:34,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:34,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:34,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:34,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:34,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:34,701 INFO L87 Difference]: Start difference. First operand 1514 states and 2374 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:34,814 INFO L93 Difference]: Finished difference Result 4361 states and 6801 transitions. [2025-03-16 19:39:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:34,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 309 [2025-03-16 19:39:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:34,828 INFO L225 Difference]: With dead ends: 4361 [2025-03-16 19:39:34,828 INFO L226 Difference]: Without dead ends: 2971 [2025-03-16 19:39:34,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:34,831 INFO L435 NwaCegarLoop]: 2364 mSDtfsCounter, 1090 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:34,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 3520 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2025-03-16 19:39:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2969. [2025-03-16 19:39:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2969 states, 2968 states have (on average 1.5596361185983827) internal successors, (4629), 2968 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 4629 transitions. [2025-03-16 19:39:34,915 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 4629 transitions. Word has length 309 [2025-03-16 19:39:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:34,916 INFO L471 AbstractCegarLoop]: Abstraction has 2969 states and 4629 transitions. [2025-03-16 19:39:34,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 4629 transitions. [2025-03-16 19:39:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-16 19:39:34,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:34,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:34,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:39:34,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:34,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash 91429984, now seen corresponding path program 1 times [2025-03-16 19:39:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133816172] [2025-03-16 19:39:34,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:34,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:34,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-16 19:39:34,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-16 19:39:34,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:34,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:35,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133816172] [2025-03-16 19:39:35,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133816172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:35,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:35,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:35,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178148299] [2025-03-16 19:39:35,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:35,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:35,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:35,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:35,100 INFO L87 Difference]: Start difference. First operand 2969 states and 4629 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:35,199 INFO L93 Difference]: Finished difference Result 8842 states and 13768 transitions. [2025-03-16 19:39:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 309 [2025-03-16 19:39:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:35,220 INFO L225 Difference]: With dead ends: 8842 [2025-03-16 19:39:35,220 INFO L226 Difference]: Without dead ends: 5910 [2025-03-16 19:39:35,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:35,230 INFO L435 NwaCegarLoop]: 2417 mSDtfsCounter, 1206 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 3623 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-03-16 19:39:35,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 3623 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5910 states. [2025-03-16 19:39:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5910 to 2988. [2025-03-16 19:39:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2988 states, 2987 states have (on average 1.559424171409441) internal successors, (4658), 2987 states have internal predecessors, (4658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 4658 transitions. [2025-03-16 19:39:35,328 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 4658 transitions. Word has length 309 [2025-03-16 19:39:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:35,328 INFO L471 AbstractCegarLoop]: Abstraction has 2988 states and 4658 transitions. [2025-03-16 19:39:35,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 4658 transitions. [2025-03-16 19:39:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-16 19:39:35,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:35,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:35,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:39:35,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:35,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1747568823, now seen corresponding path program 1 times [2025-03-16 19:39:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:35,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553500974] [2025-03-16 19:39:35,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:35,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-16 19:39:35,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-16 19:39:35,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:35,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553500974] [2025-03-16 19:39:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553500974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:35,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:35,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:35,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205450476] [2025-03-16 19:39:35,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:35,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:35,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:35,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:35,508 INFO L87 Difference]: Start difference. First operand 2988 states and 4658 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:35,560 INFO L93 Difference]: Finished difference Result 5939 states and 9247 transitions. [2025-03-16 19:39:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:35,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 310 [2025-03-16 19:39:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:35,571 INFO L225 Difference]: With dead ends: 5939 [2025-03-16 19:39:35,571 INFO L226 Difference]: Without dead ends: 3006 [2025-03-16 19:39:35,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:35,576 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 5 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2443 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-03-16 19:39:35,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2443 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2025-03-16 19:39:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 3006. [2025-03-16 19:39:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 3005 states have (on average 1.557071547420965) internal successors, (4679), 3005 states have internal predecessors, (4679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 4679 transitions. [2025-03-16 19:39:35,638 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 4679 transitions. Word has length 310 [2025-03-16 19:39:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:35,638 INFO L471 AbstractCegarLoop]: Abstraction has 3006 states and 4679 transitions. [2025-03-16 19:39:35,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:35,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 4679 transitions. [2025-03-16 19:39:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-16 19:39:35,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:35,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:35,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:39:35,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:35,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1313530462, now seen corresponding path program 1 times [2025-03-16 19:39:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980857112] [2025-03-16 19:39:35,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:35,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-16 19:39:35,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-16 19:39:35,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:35,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:35,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980857112] [2025-03-16 19:39:35,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980857112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:35,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:35,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145799501] [2025-03-16 19:39:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:35,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:35,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:35,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:35,926 INFO L87 Difference]: Start difference. First operand 3006 states and 4679 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:36,032 INFO L93 Difference]: Finished difference Result 8569 states and 13265 transitions. [2025-03-16 19:39:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 311 [2025-03-16 19:39:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:36,053 INFO L225 Difference]: With dead ends: 8569 [2025-03-16 19:39:36,053 INFO L226 Difference]: Without dead ends: 5803 [2025-03-16 19:39:36,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:36,059 INFO L435 NwaCegarLoop]: 2369 mSDtfsCounter, 1084 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:36,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 3525 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5803 states. [2025-03-16 19:39:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5803 to 5801. [2025-03-16 19:39:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5801 states, 5800 states have (on average 1.5448275862068965) internal successors, (8960), 5800 states have internal predecessors, (8960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5801 states to 5801 states and 8960 transitions. [2025-03-16 19:39:36,182 INFO L78 Accepts]: Start accepts. Automaton has 5801 states and 8960 transitions. Word has length 311 [2025-03-16 19:39:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:36,183 INFO L471 AbstractCegarLoop]: Abstraction has 5801 states and 8960 transitions. [2025-03-16 19:39:36,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5801 states and 8960 transitions. [2025-03-16 19:39:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-16 19:39:36,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:36,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:36,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:39:36,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:36,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -503010848, now seen corresponding path program 1 times [2025-03-16 19:39:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:36,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776889749] [2025-03-16 19:39:36,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:36,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-16 19:39:36,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-16 19:39:36,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:36,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:37,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776889749] [2025-03-16 19:39:37,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776889749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:37,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:37,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:39:37,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110995967] [2025-03-16 19:39:37,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:37,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:39:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:37,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:39:37,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:37,039 INFO L87 Difference]: Start difference. First operand 5801 states and 8960 transitions. Second operand has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:37,158 INFO L93 Difference]: Finished difference Result 16472 states and 25247 transitions. [2025-03-16 19:39:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:39:37,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 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 311 [2025-03-16 19:39:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:37,189 INFO L225 Difference]: With dead ends: 16472 [2025-03-16 19:39:37,190 INFO L226 Difference]: Without dead ends: 11206 [2025-03-16 19:39:37,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:37,200 INFO L435 NwaCegarLoop]: 2098 mSDtfsCounter, 1175 mSDsluCounter, 3304 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 5402 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-03-16 19:39:37,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 5402 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11206 states. [2025-03-16 19:39:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11206 to 6036. [2025-03-16 19:39:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6036 states, 6035 states have (on average 1.5491300745650374) internal successors, (9349), 6035 states have internal predecessors, (9349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6036 states to 6036 states and 9349 transitions. [2025-03-16 19:39:37,363 INFO L78 Accepts]: Start accepts. Automaton has 6036 states and 9349 transitions. Word has length 311 [2025-03-16 19:39:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:37,364 INFO L471 AbstractCegarLoop]: Abstraction has 6036 states and 9349 transitions. [2025-03-16 19:39:37,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6036 states and 9349 transitions. [2025-03-16 19:39:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-16 19:39:37,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:37,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:37,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:39:37,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:37,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:37,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1473984663, now seen corresponding path program 1 times [2025-03-16 19:39:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:37,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191356757] [2025-03-16 19:39:37,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:37,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:37,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-16 19:39:37,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-16 19:39:37,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:37,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191356757] [2025-03-16 19:39:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191356757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:37,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:37,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220928568] [2025-03-16 19:39:37,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:37,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:37,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:37,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:37,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:37,563 INFO L87 Difference]: Start difference. First operand 6036 states and 9349 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:37,648 INFO L93 Difference]: Finished difference Result 16548 states and 25326 transitions. [2025-03-16 19:39:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:37,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 313 [2025-03-16 19:39:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:37,674 INFO L225 Difference]: With dead ends: 16548 [2025-03-16 19:39:37,674 INFO L226 Difference]: Without dead ends: 11310 [2025-03-16 19:39:37,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:37,684 INFO L435 NwaCegarLoop]: 2285 mSDtfsCounter, 1074 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 3490 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:37,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 3490 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11310 states. [2025-03-16 19:39:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11310 to 6140. [2025-03-16 19:39:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6140 states, 6139 states have (on average 1.5461801596351197) internal successors, (9492), 6139 states have internal predecessors, (9492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 9492 transitions. [2025-03-16 19:39:37,809 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 9492 transitions. Word has length 313 [2025-03-16 19:39:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:37,809 INFO L471 AbstractCegarLoop]: Abstraction has 6140 states and 9492 transitions. [2025-03-16 19:39:37,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 9492 transitions. [2025-03-16 19:39:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-16 19:39:37,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:37,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:37,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:39:37,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:37,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:37,819 INFO L85 PathProgramCache]: Analyzing trace with hash -403718577, now seen corresponding path program 1 times [2025-03-16 19:39:37,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:37,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847880001] [2025-03-16 19:39:37,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:37,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-16 19:39:37,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-16 19:39:37,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:37,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:37,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:37,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847880001] [2025-03-16 19:39:37,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847880001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:37,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:37,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:37,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38998149] [2025-03-16 19:39:37,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:37,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:37,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:37,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:37,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:37,989 INFO L87 Difference]: Start difference. First operand 6140 states and 9492 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:38,086 INFO L93 Difference]: Finished difference Result 12828 states and 19826 transitions. [2025-03-16 19:39:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:38,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 313 [2025-03-16 19:39:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:38,102 INFO L225 Difference]: With dead ends: 12828 [2025-03-16 19:39:38,103 INFO L226 Difference]: Without dead ends: 8454 [2025-03-16 19:39:38,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:38,111 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 684 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:38,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 2676 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2025-03-16 19:39:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 7116. [2025-03-16 19:39:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7116 states, 7115 states have (on average 1.5589599437807449) internal successors, (11092), 7115 states have internal predecessors, (11092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7116 states to 7116 states and 11092 transitions. [2025-03-16 19:39:38,259 INFO L78 Accepts]: Start accepts. Automaton has 7116 states and 11092 transitions. Word has length 313 [2025-03-16 19:39:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:38,259 INFO L471 AbstractCegarLoop]: Abstraction has 7116 states and 11092 transitions. [2025-03-16 19:39:38,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 7116 states and 11092 transitions. [2025-03-16 19:39:38,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-16 19:39:38,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:38,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:38,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:39:38,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:38,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1191990838, now seen corresponding path program 1 times [2025-03-16 19:39:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:38,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409227110] [2025-03-16 19:39:38,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:38,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:38,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-16 19:39:38,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-16 19:39:38,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:38,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:38,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:38,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409227110] [2025-03-16 19:39:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409227110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:38,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:38,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:38,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870408212] [2025-03-16 19:39:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:38,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:38,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:38,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:38,419 INFO L87 Difference]: Start difference. First operand 7116 states and 11092 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:38,469 INFO L93 Difference]: Finished difference Result 13462 states and 20843 transitions. [2025-03-16 19:39:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:38,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 314 [2025-03-16 19:39:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:38,482 INFO L225 Difference]: With dead ends: 13462 [2025-03-16 19:39:38,483 INFO L226 Difference]: Without dead ends: 7241 [2025-03-16 19:39:38,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:38,492 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 5 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:38,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2436 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states. [2025-03-16 19:39:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 7241. [2025-03-16 19:39:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7241 states, 7240 states have (on average 1.5522099447513813) internal successors, (11238), 7240 states have internal predecessors, (11238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 11238 transitions. [2025-03-16 19:39:38,614 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 11238 transitions. Word has length 314 [2025-03-16 19:39:38,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:38,615 INFO L471 AbstractCegarLoop]: Abstraction has 7241 states and 11238 transitions. [2025-03-16 19:39:38,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 11238 transitions. [2025-03-16 19:39:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-16 19:39:38,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:38,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:38,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:39:38,624 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:38,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash 334147415, now seen corresponding path program 1 times [2025-03-16 19:39:38,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:38,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331101535] [2025-03-16 19:39:38,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:38,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:38,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-16 19:39:38,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-16 19:39:38,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:38,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:39,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:39,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331101535] [2025-03-16 19:39:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331101535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:39,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:39,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:39:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711985914] [2025-03-16 19:39:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:39,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:39:39,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:39,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:39:39,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:39:39,214 INFO L87 Difference]: Start difference. First operand 7241 states and 11238 transitions. Second operand has 5 states, 5 states have (on average 63.0) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:39,446 INFO L93 Difference]: Finished difference Result 34937 states and 54104 transitions. [2025-03-16 19:39:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:39:39,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 63.0) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 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 315 [2025-03-16 19:39:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:39,494 INFO L225 Difference]: With dead ends: 34937 [2025-03-16 19:39:39,494 INFO L226 Difference]: Without dead ends: 27763 [2025-03-16 19:39:39,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:39:39,513 INFO L435 NwaCegarLoop]: 2894 mSDtfsCounter, 3416 mSDsluCounter, 6357 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3416 SdHoareTripleChecker+Valid, 9251 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:39,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3416 Valid, 9251 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27763 states. [2025-03-16 19:39:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27763 to 13934. [2025-03-16 19:39:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13934 states, 13933 states have (on average 1.538792794085983) internal successors, (21440), 13933 states have internal predecessors, (21440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13934 states to 13934 states and 21440 transitions. [2025-03-16 19:39:39,789 INFO L78 Accepts]: Start accepts. Automaton has 13934 states and 21440 transitions. Word has length 315 [2025-03-16 19:39:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:39,789 INFO L471 AbstractCegarLoop]: Abstraction has 13934 states and 21440 transitions. [2025-03-16 19:39:39,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.0) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 13934 states and 21440 transitions. [2025-03-16 19:39:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-16 19:39:39,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:39,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:39,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:39:39,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:39,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:39,806 INFO L85 PathProgramCache]: Analyzing trace with hash 89664133, now seen corresponding path program 1 times [2025-03-16 19:39:39,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:39,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8328108] [2025-03-16 19:39:39,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:39,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-16 19:39:39,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-16 19:39:39,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:39,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:40,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:40,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8328108] [2025-03-16 19:39:40,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8328108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:40,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:40,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:40,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131380588] [2025-03-16 19:39:40,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:40,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:39:40,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:40,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:39:40,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:40,380 INFO L87 Difference]: Start difference. First operand 13934 states and 21440 transitions. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:40,669 INFO L93 Difference]: Finished difference Result 67644 states and 103808 transitions. [2025-03-16 19:39:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:39:40,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 317 [2025-03-16 19:39:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:40,762 INFO L225 Difference]: With dead ends: 67644 [2025-03-16 19:39:40,762 INFO L226 Difference]: Without dead ends: 53939 [2025-03-16 19:39:40,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:39:40,792 INFO L435 NwaCegarLoop]: 1920 mSDtfsCounter, 3684 mSDsluCounter, 3005 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3684 SdHoareTripleChecker+Valid, 4925 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:40,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3684 Valid, 4925 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53939 states. [2025-03-16 19:39:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53939 to 27183. [2025-03-16 19:39:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27183 states, 27182 states have (on average 1.5272238981679052) internal successors, (41513), 27182 states have internal predecessors, (41513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27183 states to 27183 states and 41513 transitions. [2025-03-16 19:39:41,371 INFO L78 Accepts]: Start accepts. Automaton has 27183 states and 41513 transitions. Word has length 317 [2025-03-16 19:39:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:41,371 INFO L471 AbstractCegarLoop]: Abstraction has 27183 states and 41513 transitions. [2025-03-16 19:39:41,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 27183 states and 41513 transitions. [2025-03-16 19:39:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-16 19:39:41,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:41,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:41,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:39:41,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:41,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:41,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1781383425, now seen corresponding path program 1 times [2025-03-16 19:39:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:41,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405570117] [2025-03-16 19:39:41,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:41,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-16 19:39:41,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-16 19:39:41,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:41,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:41,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:41,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405570117] [2025-03-16 19:39:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405570117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:41,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110104707] [2025-03-16 19:39:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:41,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:41,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:41,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:41,534 INFO L87 Difference]: Start difference. First operand 27183 states and 41513 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:41,712 INFO L93 Difference]: Finished difference Result 79253 states and 120668 transitions. [2025-03-16 19:39:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:41,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 319 [2025-03-16 19:39:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:41,789 INFO L225 Difference]: With dead ends: 79253 [2025-03-16 19:39:41,789 INFO L226 Difference]: Without dead ends: 53221 [2025-03-16 19:39:41,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:41,827 INFO L435 NwaCegarLoop]: 2319 mSDtfsCounter, 1057 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:41,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 3472 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53221 states. [2025-03-16 19:39:42,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53221 to 53219. [2025-03-16 19:39:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53219 states, 53218 states have (on average 1.517418918411064) internal successors, (80754), 53218 states have internal predecessors, (80754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53219 states to 53219 states and 80754 transitions. [2025-03-16 19:39:42,497 INFO L78 Accepts]: Start accepts. Automaton has 53219 states and 80754 transitions. Word has length 319 [2025-03-16 19:39:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:42,498 INFO L471 AbstractCegarLoop]: Abstraction has 53219 states and 80754 transitions. [2025-03-16 19:39:42,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 53219 states and 80754 transitions. [2025-03-16 19:39:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-16 19:39:42,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:42,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:42,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:39:42,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:42,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash -489044420, now seen corresponding path program 1 times [2025-03-16 19:39:42,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:42,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721078348] [2025-03-16 19:39:42,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:42,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-16 19:39:42,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-16 19:39:42,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:42,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:42,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721078348] [2025-03-16 19:39:42,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721078348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:42,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692944300] [2025-03-16 19:39:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:42,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:42,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:42,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:42,838 INFO L87 Difference]: Start difference. First operand 53219 states and 80754 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:43,117 INFO L93 Difference]: Finished difference Result 158715 states and 240700 transitions. [2025-03-16 19:39:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:43,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 319 [2025-03-16 19:39:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:43,419 INFO L225 Difference]: With dead ends: 158715 [2025-03-16 19:39:43,420 INFO L226 Difference]: Without dead ends: 106021 [2025-03-16 19:39:43,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:43,460 INFO L435 NwaCegarLoop]: 2378 mSDtfsCounter, 1170 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 3581 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-03-16 19:39:43,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 3581 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106021 states. [2025-03-16 19:39:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106021 to 53447. [2025-03-16 19:39:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53447 states, 53446 states have (on average 1.5172323466676645) internal successors, (81090), 53446 states have internal predecessors, (81090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53447 states to 53447 states and 81090 transitions. [2025-03-16 19:39:44,617 INFO L78 Accepts]: Start accepts. Automaton has 53447 states and 81090 transitions. Word has length 319 [2025-03-16 19:39:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:44,618 INFO L471 AbstractCegarLoop]: Abstraction has 53447 states and 81090 transitions. [2025-03-16 19:39:44,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 53447 states and 81090 transitions. [2025-03-16 19:39:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-16 19:39:44,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:44,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:44,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:39:44,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:44,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:44,664 INFO L85 PathProgramCache]: Analyzing trace with hash 967618225, now seen corresponding path program 1 times [2025-03-16 19:39:44,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:44,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660357937] [2025-03-16 19:39:44,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:44,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-16 19:39:44,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-16 19:39:44,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:44,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:44,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660357937] [2025-03-16 19:39:44,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660357937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:44,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:44,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:44,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361315255] [2025-03-16 19:39:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:44,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:44,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:44,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:44,892 INFO L87 Difference]: Start difference. First operand 53447 states and 81090 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:45,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:45,097 INFO L93 Difference]: Finished difference Result 106278 states and 161137 transitions. [2025-03-16 19:39:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:45,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 320 [2025-03-16 19:39:45,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:45,165 INFO L225 Difference]: With dead ends: 106278 [2025-03-16 19:39:45,165 INFO L226 Difference]: Without dead ends: 53642 [2025-03-16 19:39:45,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:45,212 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 5 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2437 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-03-16 19:39:45,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2437 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53642 states. [2025-03-16 19:39:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53642 to 53642. [2025-03-16 19:39:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53642 states, 53641 states have (on average 1.5158926940213642) internal successors, (81314), 53641 states have internal predecessors, (81314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53642 states to 53642 states and 81314 transitions. [2025-03-16 19:39:45,978 INFO L78 Accepts]: Start accepts. Automaton has 53642 states and 81314 transitions. Word has length 320 [2025-03-16 19:39:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:45,978 INFO L471 AbstractCegarLoop]: Abstraction has 53642 states and 81314 transitions. [2025-03-16 19:39:45,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 53642 states and 81314 transitions. [2025-03-16 19:39:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 19:39:46,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:46,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:46,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:39:46,015 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:46,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:46,015 INFO L85 PathProgramCache]: Analyzing trace with hash 794040702, now seen corresponding path program 1 times [2025-03-16 19:39:46,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250565468] [2025-03-16 19:39:46,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:46,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 19:39:46,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 19:39:46,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:46,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:46,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:46,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250565468] [2025-03-16 19:39:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250565468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95907617] [2025-03-16 19:39:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:46,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:46,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:46,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:46,146 INFO L87 Difference]: Start difference. First operand 53642 states and 81314 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:46,526 INFO L93 Difference]: Finished difference Result 156270 states and 236367 transitions. [2025-03-16 19:39:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:46,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 321 [2025-03-16 19:39:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:46,665 INFO L225 Difference]: With dead ends: 156270 [2025-03-16 19:39:46,666 INFO L226 Difference]: Without dead ends: 104560 [2025-03-16 19:39:46,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:46,734 INFO L435 NwaCegarLoop]: 2330 mSDtfsCounter, 1051 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:46,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 3483 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:39:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104560 states. [2025-03-16 19:39:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104560 to 104558. [2025-03-16 19:39:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104558 states, 104557 states have (on average 1.505982382815115) internal successors, (157461), 104557 states have internal predecessors, (157461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104558 states to 104558 states and 157461 transitions. [2025-03-16 19:39:48,504 INFO L78 Accepts]: Start accepts. Automaton has 104558 states and 157461 transitions. Word has length 321 [2025-03-16 19:39:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:48,504 INFO L471 AbstractCegarLoop]: Abstraction has 104558 states and 157461 transitions. [2025-03-16 19:39:48,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 104558 states and 157461 transitions. [2025-03-16 19:39:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 19:39:48,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:48,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:48,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:39:48,600 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:48,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2114609860, now seen corresponding path program 1 times [2025-03-16 19:39:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:48,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242723761] [2025-03-16 19:39:48,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:48,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 19:39:48,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 19:39:48,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:48,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:49,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:49,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242723761] [2025-03-16 19:39:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242723761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:49,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:49,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:39:49,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119926813] [2025-03-16 19:39:49,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:49,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:39:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:49,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:39:49,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:49,468 INFO L87 Difference]: Start difference. First operand 104558 states and 157461 transitions. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:49,893 INFO L93 Difference]: Finished difference Result 210007 states and 316091 transitions. [2025-03-16 19:39:49,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:39:49,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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 321 [2025-03-16 19:39:49,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:50,041 INFO L225 Difference]: With dead ends: 210007 [2025-03-16 19:39:50,042 INFO L226 Difference]: Without dead ends: 115389 [2025-03-16 19:39:50,128 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-03-16 19:39:50,129 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 90 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 3865 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-03-16 19:39:50,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 3865 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115389 states. [2025-03-16 19:39:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115389 to 112605. [2025-03-16 19:39:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112605 states, 112604 states have (on average 1.513569677808959) internal successors, (170434), 112604 states have internal predecessors, (170434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112605 states to 112605 states and 170434 transitions. [2025-03-16 19:39:51,842 INFO L78 Accepts]: Start accepts. Automaton has 112605 states and 170434 transitions. Word has length 321 [2025-03-16 19:39:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:51,842 INFO L471 AbstractCegarLoop]: Abstraction has 112605 states and 170434 transitions. [2025-03-16 19:39:51,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 112605 states and 170434 transitions. [2025-03-16 19:39:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 19:39:52,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:52,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:52,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:39:52,204 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:52,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1003330795, now seen corresponding path program 1 times [2025-03-16 19:39:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735567986] [2025-03-16 19:39:52,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:52,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 19:39:52,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 19:39:52,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:52,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:52,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:52,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735567986] [2025-03-16 19:39:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735567986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:52,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528118474] [2025-03-16 19:39:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:52,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:52,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:52,313 INFO L87 Difference]: Start difference. First operand 112605 states and 170434 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:53,281 INFO L93 Difference]: Finished difference Result 324294 states and 488952 transitions. [2025-03-16 19:39:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:53,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 321 [2025-03-16 19:39:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:53,556 INFO L225 Difference]: With dead ends: 324294 [2025-03-16 19:39:53,556 INFO L226 Difference]: Without dead ends: 220190 [2025-03-16 19:39:53,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:53,653 INFO L435 NwaCegarLoop]: 2315 mSDtfsCounter, 1060 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:53,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 3468 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:39:53,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220190 states. [2025-03-16 19:39:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220190 to 220188. [2025-03-16 19:39:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220188 states, 220187 states have (on average 1.5028770999196137) internal successors, (330914), 220187 states have internal predecessors, (330914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220188 states to 220188 states and 330914 transitions. [2025-03-16 19:39:57,235 INFO L78 Accepts]: Start accepts. Automaton has 220188 states and 330914 transitions. Word has length 321 [2025-03-16 19:39:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:57,235 INFO L471 AbstractCegarLoop]: Abstraction has 220188 states and 330914 transitions. [2025-03-16 19:39:57,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 220188 states and 330914 transitions. [2025-03-16 19:39:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-16 19:39:57,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:57,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:57,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:39:57,407 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:57,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:57,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1829143209, now seen corresponding path program 1 times [2025-03-16 19:39:57,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:57,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71594528] [2025-03-16 19:39:57,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:57,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-16 19:39:57,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-16 19:39:57,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:57,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:58,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:58,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71594528] [2025-03-16 19:39:58,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71594528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:58,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:39:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318958719] [2025-03-16 19:39:58,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:58,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:39:58,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:58,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:39:58,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:39:58,326 INFO L87 Difference]: Start difference. First operand 220188 states and 330914 transitions. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:59,711 INFO L93 Difference]: Finished difference Result 600590 states and 897029 transitions. [2025-03-16 19:39:59,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:39:59,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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 321 [2025-03-16 19:39:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:00,229 INFO L225 Difference]: With dead ends: 600590 [2025-03-16 19:40:00,230 INFO L226 Difference]: Without dead ends: 424204 [2025-03-16 19:40:00,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:40:00,804 INFO L435 NwaCegarLoop]: 2041 mSDtfsCounter, 1135 mSDsluCounter, 3244 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 5285 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-03-16 19:40:00,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 5285 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424204 states. [2025-03-16 19:40:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424204 to 250890. [2025-03-16 19:40:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250890 states, 250889 states have (on average 1.5071007497339461) internal successors, (378115), 250889 states have internal predecessors, (378115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250890 states to 250890 states and 378115 transitions. [2025-03-16 19:40:06,598 INFO L78 Accepts]: Start accepts. Automaton has 250890 states and 378115 transitions. Word has length 321 [2025-03-16 19:40:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:06,599 INFO L471 AbstractCegarLoop]: Abstraction has 250890 states and 378115 transitions. [2025-03-16 19:40:06,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 250890 states and 378115 transitions. [2025-03-16 19:40:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 19:40:06,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:06,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:06,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:40:06,782 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:06,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1146689760, now seen corresponding path program 1 times [2025-03-16 19:40:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:06,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561001203] [2025-03-16 19:40:06,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:06,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 19:40:06,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 19:40:06,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:06,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:40:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:06,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561001203] [2025-03-16 19:40:06,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561001203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28346668] [2025-03-16 19:40:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:06,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:06,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:06,887 INFO L87 Difference]: Start difference. First operand 250890 states and 378115 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:40:08,434 INFO L93 Difference]: Finished difference Result 603022 states and 899813 transitions. [2025-03-16 19:40:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:40:08,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 323 [2025-03-16 19:40:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:40:09,012 INFO L225 Difference]: With dead ends: 603022 [2025-03-16 19:40:09,012 INFO L226 Difference]: Without dead ends: 427532 [2025-03-16 19:40:09,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:09,206 INFO L435 NwaCegarLoop]: 2246 mSDtfsCounter, 1038 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 3448 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:40:09,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 3448 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:40:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427532 states. [2025-03-16 19:40:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427532 to 254218. [2025-03-16 19:40:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254218 states, 254217 states have (on average 1.505371395304012) internal successors, (382691), 254217 states have internal predecessors, (382691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254218 states to 254218 states and 382691 transitions. [2025-03-16 19:40:15,058 INFO L78 Accepts]: Start accepts. Automaton has 254218 states and 382691 transitions. Word has length 323 [2025-03-16 19:40:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:40:15,058 INFO L471 AbstractCegarLoop]: Abstraction has 254218 states and 382691 transitions. [2025-03-16 19:40:15,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:40:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 254218 states and 382691 transitions. [2025-03-16 19:40:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 19:40:15,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:40:15,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:40:15,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:40:15,230 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:40:15,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:40:15,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1727516281, now seen corresponding path program 1 times [2025-03-16 19:40:15,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:40:15,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933435077] [2025-03-16 19:40:15,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:40:15,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:40:15,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 19:40:15,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 19:40:15,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:40:15,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:40:15,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-03-16 19:40:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:40:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933435077] [2025-03-16 19:40:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933435077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:40:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:40:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:40:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121566906] [2025-03-16 19:40:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:40:15,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:40:15,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:40:15,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:40:15,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:40:15,708 INFO L87 Difference]: Start difference. First operand 254218 states and 382691 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)