./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i -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 5e929c4003dd56b80bb766773f31b5c9376f023636b5de2c888cd8fd3433b56e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:44:37,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:44:37,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:44:37,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:44:37,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:44:37,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:44:37,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:44:37,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:44:37,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:44:37,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:44:37,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:44:37,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:44:37,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:44:37,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:44:37,907 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:44:37,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:44:37,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:44:37,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:44:37,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:44:37,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:44:37,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:44:37,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:44:37,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:44:37,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:44:37,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:44:37,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:44:37,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:44:37,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:44:37,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:44:37,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:44:37,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:44:37,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:44:37,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:44:37,910 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 -> 5e929c4003dd56b80bb766773f31b5c9376f023636b5de2c888cd8fd3433b56e [2025-03-08 16:44:38,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:44:38,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:44:38,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:44:38,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:44:38,133 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:44:38,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i [2025-03-08 16:44:39,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8ca8399/4a7ffcab825141f29da5aa55964e2352/FLAGff9ec370d [2025-03-08 16:44:39,503 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:44:39,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i [2025-03-08 16:44:39,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8ca8399/4a7ffcab825141f29da5aa55964e2352/FLAGff9ec370d [2025-03-08 16:44:39,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf8ca8399/4a7ffcab825141f29da5aa55964e2352 [2025-03-08 16:44:39,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:44:39,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:44:39,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:44:39,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:44:39,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:44:39,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:44:39" (1/1) ... [2025-03-08 16:44:39,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d41fce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:39, skipping insertion in model container [2025-03-08 16:44:39,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:44:39" (1/1) ... [2025-03-08 16:44:39,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:44:39,966 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i[916,929] [2025-03-08 16:44:40,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:44:40,011 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:44:40,018 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i[916,929] [2025-03-08 16:44:40,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:44:40,052 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:44:40,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40 WrapperNode [2025-03-08 16:44:40,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:44:40,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:44:40,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:44:40,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:44:40,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,100 INFO L138 Inliner]: procedures = 26, calls = 190, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2025-03-08 16:44:40,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:44:40,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:44:40,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:44:40,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:44:40,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,133 INFO L175 MemorySlicer]: Split 139 memory accesses to 18 slices as follows [2, 7, 15, 14, 5, 8, 10, 6, 8, 5, 6, 6, 6, 9, 10, 6, 9, 7]. 11 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 22 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1]. [2025-03-08 16:44:40,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:44:40,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:44:40,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:44:40,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:44:40,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (1/1) ... [2025-03-08 16:44:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:44:40,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:44:40,180 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-08 16:44:40,182 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-08 16:44:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:44:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:44:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:44:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:44:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 16:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 16:44:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:44:40,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:44:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 16:44:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:44:40,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:44:40,346 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:44:40,348 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:44:40,794 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem80#1;havoc property_#t~ite93#1;havoc property_#t~mem86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem101#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1;havoc property_#t~mem110#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short111#1;havoc property_#t~mem117#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~short116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite127#1;havoc property_#t~mem123#1;havoc property_#t~mem120#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite141#1;havoc property_#t~mem133#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-03-08 16:44:40,839 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-03-08 16:44:40,839 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:44:40,847 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:44:40,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:44:40,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:44:40 BoogieIcfgContainer [2025-03-08 16:44:40,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:44:40,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:44:40,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:44:40,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:44:40,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:44:39" (1/3) ... [2025-03-08 16:44:40,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46992467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:44:40, skipping insertion in model container [2025-03-08 16:44:40,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:44:40" (2/3) ... [2025-03-08 16:44:40,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46992467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:44:40, skipping insertion in model container [2025-03-08 16:44:40,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:44:40" (3/3) ... [2025-03-08 16:44:40,859 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-85.i [2025-03-08 16:44:40,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:44:40,871 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-85.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:44:40,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:44:40,927 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;@17984ef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:44:40,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:44:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:44:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 16:44:40,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:40,942 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:40,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash -378510325, now seen corresponding path program 1 times [2025-03-08 16:44:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279047531] [2025-03-08 16:44:40,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:41,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 16:44:41,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 16:44:41,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:41,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 16:44:41,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:41,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279047531] [2025-03-08 16:44:41,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279047531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:44:41,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456988751] [2025-03-08 16:44:41,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:41,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:44:41,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:44:41,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:44:41,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:44:41,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 16:44:41,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 16:44:41,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:41,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:41,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:44:41,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:44:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 16:44:41,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:44:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456988751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:41,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:44:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:44:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167755876] [2025-03-08 16:44:41,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:41,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:44:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:41,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:44:41,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:44:41,586 INFO L87 Difference]: Start difference. First operand has 130 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:44:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:41,606 INFO L93 Difference]: Finished difference Result 254 states and 396 transitions. [2025-03-08 16:44:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:44:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2025-03-08 16:44:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:41,614 INFO L225 Difference]: With dead ends: 254 [2025-03-08 16:44:41,614 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 16:44:41,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:44:41,618 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:41,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 16:44:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 16:44:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:44:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2025-03-08 16:44:41,647 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 179 [2025-03-08 16:44:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:41,647 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2025-03-08 16:44:41,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 16:44:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2025-03-08 16:44:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 16:44:41,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:41,650 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:41,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:44:41,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:44:41,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:41,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash -308756012, now seen corresponding path program 1 times [2025-03-08 16:44:41,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:41,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844528792] [2025-03-08 16:44:41,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:41,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:41,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 16:44:41,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 16:44:41,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:41,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:42,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:42,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844528792] [2025-03-08 16:44:42,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844528792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:42,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:42,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:44:42,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974778302] [2025-03-08 16:44:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:42,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:44:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:42,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:44:42,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:44:42,149 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:42,191 INFO L93 Difference]: Finished difference Result 254 states and 369 transitions. [2025-03-08 16:44:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:44:42,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2025-03-08 16:44:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:42,195 INFO L225 Difference]: With dead ends: 254 [2025-03-08 16:44:42,195 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 16:44:42,196 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-08 16:44:42,198 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:42,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 534 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 16:44:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-03-08 16:44:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:44:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2025-03-08 16:44:42,213 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 179 [2025-03-08 16:44:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:42,214 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2025-03-08 16:44:42,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2025-03-08 16:44:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 16:44:42,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:42,219 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:42,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:44:42,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:42,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash -297439885, now seen corresponding path program 1 times [2025-03-08 16:44:42,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:42,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90972268] [2025-03-08 16:44:42,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:42,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 16:44:42,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 16:44:42,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:42,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:42,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:42,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90972268] [2025-03-08 16:44:42,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90972268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:42,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:42,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:42,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630860052] [2025-03-08 16:44:42,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:42,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:42,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:42,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:42,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:42,694 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:42,876 INFO L93 Difference]: Finished difference Result 374 states and 541 transitions. [2025-03-08 16:44:42,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:42,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2025-03-08 16:44:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:42,879 INFO L225 Difference]: With dead ends: 374 [2025-03-08 16:44:42,880 INFO L226 Difference]: Without dead ends: 248 [2025-03-08 16:44:42,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:42,881 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 167 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:42,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 961 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-08 16:44:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 131. [2025-03-08 16:44:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:44:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2025-03-08 16:44:42,895 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 179 [2025-03-08 16:44:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:42,896 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2025-03-08 16:44:42,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2025-03-08 16:44:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 16:44:42,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:42,900 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:42,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:44:42,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:42,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash 513934839, now seen corresponding path program 1 times [2025-03-08 16:44:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:42,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475166523] [2025-03-08 16:44:42,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:42,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 16:44:43,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 16:44:43,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:43,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:43,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475166523] [2025-03-08 16:44:43,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475166523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:43,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:43,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:44:43,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622346867] [2025-03-08 16:44:43,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:43,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:44:43,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:43,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:44:43,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:44:43,796 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 16:44:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:44,337 INFO L93 Difference]: Finished difference Result 478 states and 685 transitions. [2025-03-08 16:44:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:44:44,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 179 [2025-03-08 16:44:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:44,340 INFO L225 Difference]: With dead ends: 478 [2025-03-08 16:44:44,342 INFO L226 Difference]: Without dead ends: 350 [2025-03-08 16:44:44,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:44:44,344 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 925 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:44,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1094 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:44:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-08 16:44:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 203. [2025-03-08 16:44:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 176 states have internal predecessors, (241), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2025-03-08 16:44:44,369 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 179 [2025-03-08 16:44:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:44,370 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2025-03-08 16:44:44,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 16:44:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2025-03-08 16:44:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:44:44,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:44,371 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:44,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:44:44,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:44,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash 588004448, now seen corresponding path program 1 times [2025-03-08 16:44:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:44,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866107278] [2025-03-08 16:44:44,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:44,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:44:44,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:44:44,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:44,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:44,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:44,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866107278] [2025-03-08 16:44:44,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866107278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:44,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:44,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:44:44,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80758627] [2025-03-08 16:44:44,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:44,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:44:44,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:44,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:44:44,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:44,891 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:45,011 INFO L93 Difference]: Finished difference Result 560 states and 801 transitions. [2025-03-08 16:44:45,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:44:45,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:44:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:45,015 INFO L225 Difference]: With dead ends: 560 [2025-03-08 16:44:45,016 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 16:44:45,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:44:45,018 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 144 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:45,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1197 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 16:44:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 215. [2025-03-08 16:44:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 187 states have (on average 1.3636363636363635) internal successors, (255), 188 states have internal predecessors, (255), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 305 transitions. [2025-03-08 16:44:45,045 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 305 transitions. Word has length 180 [2025-03-08 16:44:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:45,046 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 305 transitions. [2025-03-08 16:44:45,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 305 transitions. [2025-03-08 16:44:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:44:45,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:45,047 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:45,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:44:45,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:45,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash 77470271, now seen corresponding path program 1 times [2025-03-08 16:44:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:45,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019751847] [2025-03-08 16:44:45,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:45,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:44:45,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:44:45,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:45,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:45,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019751847] [2025-03-08 16:44:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019751847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:45,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:44:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107431741] [2025-03-08 16:44:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:45,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:44:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:45,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:44:45,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:45,351 INFO L87 Difference]: Start difference. First operand 215 states and 305 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:45,502 INFO L93 Difference]: Finished difference Result 560 states and 798 transitions. [2025-03-08 16:44:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:44:45,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:44:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:45,504 INFO L225 Difference]: With dead ends: 560 [2025-03-08 16:44:45,504 INFO L226 Difference]: Without dead ends: 348 [2025-03-08 16:44:45,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:44:45,505 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 166 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:45,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1098 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-08 16:44:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 235. [2025-03-08 16:44:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.357487922705314) internal successors, (281), 208 states have internal predecessors, (281), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 331 transitions. [2025-03-08 16:44:45,530 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 331 transitions. Word has length 180 [2025-03-08 16:44:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:45,530 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 331 transitions. [2025-03-08 16:44:45,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:45,530 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 331 transitions. [2025-03-08 16:44:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:44:45,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:45,532 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:45,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:44:45,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:45,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash -953879141, now seen corresponding path program 1 times [2025-03-08 16:44:45,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:45,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95535803] [2025-03-08 16:44:45,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:45,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:45,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:44:45,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:44:45,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:45,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:44:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95535803] [2025-03-08 16:44:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95535803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:44:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805641795] [2025-03-08 16:44:45,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:45,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:44:45,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:44:45,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:44:45,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:44:46,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:44:46,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:44:46,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:46,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:46,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 16:44:46,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:44:46,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 16:44:46,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:44:46,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-08 16:44:46,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 16:44:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:46,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:44:46,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805641795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:46,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:44:46,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-08 16:44:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663375776] [2025-03-08 16:44:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:46,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:44:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:46,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:44:46,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:44:46,408 INFO L87 Difference]: Start difference. First operand 235 states and 331 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:46,880 INFO L93 Difference]: Finished difference Result 900 states and 1272 transitions. [2025-03-08 16:44:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:44:46,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:44:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:46,883 INFO L225 Difference]: With dead ends: 900 [2025-03-08 16:44:46,883 INFO L226 Difference]: Without dead ends: 668 [2025-03-08 16:44:46,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:44:46,885 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 419 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:46,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2023 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:44:46,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-08 16:44:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 300. [2025-03-08 16:44:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 272 states have (on average 1.3897058823529411) internal successors, (378), 273 states have internal predecessors, (378), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 428 transitions. [2025-03-08 16:44:46,921 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 428 transitions. Word has length 180 [2025-03-08 16:44:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:46,921 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 428 transitions. [2025-03-08 16:44:46,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 428 transitions. [2025-03-08 16:44:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:44:46,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:46,923 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:46,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:44:47,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 16:44:47,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:47,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1464413318, now seen corresponding path program 1 times [2025-03-08 16:44:47,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:47,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569025836] [2025-03-08 16:44:47,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:47,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:44:47,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:44:47,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:47,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:47,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569025836] [2025-03-08 16:44:47,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569025836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:47,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:47,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:44:47,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372155776] [2025-03-08 16:44:47,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:47,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:44:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:47,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:44:47,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:44:47,444 INFO L87 Difference]: Start difference. First operand 300 states and 428 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:47,754 INFO L93 Difference]: Finished difference Result 963 states and 1365 transitions. [2025-03-08 16:44:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:44:47,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:44:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:47,758 INFO L225 Difference]: With dead ends: 963 [2025-03-08 16:44:47,758 INFO L226 Difference]: Without dead ends: 666 [2025-03-08 16:44:47,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:44:47,759 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 414 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:47,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1263 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:44:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-08 16:44:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 300. [2025-03-08 16:44:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 272 states have (on average 1.3823529411764706) internal successors, (376), 273 states have internal predecessors, (376), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2025-03-08 16:44:47,783 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 180 [2025-03-08 16:44:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:47,783 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2025-03-08 16:44:47,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2025-03-08 16:44:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:44:47,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:47,785 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:47,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:44:47,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:47,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash -142504417, now seen corresponding path program 1 times [2025-03-08 16:44:47,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:47,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375495135] [2025-03-08 16:44:47,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:47,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:44:47,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:44:47,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:47,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:47,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:47,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375495135] [2025-03-08 16:44:47,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375495135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:47,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:47,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530258206] [2025-03-08 16:44:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:47,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:47,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:47,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:47,992 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:48,136 INFO L93 Difference]: Finished difference Result 820 states and 1174 transitions. [2025-03-08 16:44:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:48,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:44:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:48,138 INFO L225 Difference]: With dead ends: 820 [2025-03-08 16:44:48,138 INFO L226 Difference]: Without dead ends: 523 [2025-03-08 16:44:48,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:48,140 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 169 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:48,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 665 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-08 16:44:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 289. [2025-03-08 16:44:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 261 states have (on average 1.367816091954023) internal successors, (357), 262 states have internal predecessors, (357), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2025-03-08 16:44:48,161 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 180 [2025-03-08 16:44:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:48,162 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2025-03-08 16:44:48,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2025-03-08 16:44:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:44:48,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:48,164 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:44:48,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:48,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1362703366, now seen corresponding path program 1 times [2025-03-08 16:44:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609542029] [2025-03-08 16:44:48,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:48,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:44:48,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:44:48,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:48,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:48,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:48,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609542029] [2025-03-08 16:44:48,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609542029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:48,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:48,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:44:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561169971] [2025-03-08 16:44:48,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:48,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:44:48,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:48,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:44:48,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:44:48,494 INFO L87 Difference]: Start difference. First operand 289 states and 407 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:48,841 INFO L93 Difference]: Finished difference Result 924 states and 1301 transitions. [2025-03-08 16:44:48,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:44:48,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:44:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:48,844 INFO L225 Difference]: With dead ends: 924 [2025-03-08 16:44:48,844 INFO L226 Difference]: Without dead ends: 638 [2025-03-08 16:44:48,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:44:48,846 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 407 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:48,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1127 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:44:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-08 16:44:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 297. [2025-03-08 16:44:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 269 states have (on average 1.3568773234200744) internal successors, (365), 270 states have internal predecessors, (365), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 415 transitions. [2025-03-08 16:44:48,871 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 415 transitions. Word has length 180 [2025-03-08 16:44:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:48,871 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 415 transitions. [2025-03-08 16:44:48,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 415 transitions. [2025-03-08 16:44:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 16:44:48,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:48,874 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:48,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:44:48,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:48,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1873237543, now seen corresponding path program 1 times [2025-03-08 16:44:48,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335772532] [2025-03-08 16:44:48,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:48,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:48,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 16:44:48,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 16:44:48,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:48,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:49,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:49,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335772532] [2025-03-08 16:44:49,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335772532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:49,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:49,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:44:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144285260] [2025-03-08 16:44:49,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:49,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:44:49,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:49,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:44:49,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:44:49,172 INFO L87 Difference]: Start difference. First operand 297 states and 415 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:49,311 INFO L93 Difference]: Finished difference Result 862 states and 1216 transitions. [2025-03-08 16:44:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:44:49,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-08 16:44:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:49,314 INFO L225 Difference]: With dead ends: 862 [2025-03-08 16:44:49,314 INFO L226 Difference]: Without dead ends: 568 [2025-03-08 16:44:49,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:44:49,317 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 178 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:49,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 2243 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-08 16:44:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 305. [2025-03-08 16:44:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 277 states have (on average 1.3537906137184115) internal successors, (375), 278 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 425 transitions. [2025-03-08 16:44:49,358 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 425 transitions. Word has length 180 [2025-03-08 16:44:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:49,359 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 425 transitions. [2025-03-08 16:44:49,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 425 transitions. [2025-03-08 16:44:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 16:44:49,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:49,363 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:49,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:44:49,363 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:49,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1343091623, now seen corresponding path program 1 times [2025-03-08 16:44:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:49,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888046855] [2025-03-08 16:44:49,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:49,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:44:49,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:44:49,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:49,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:49,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:49,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888046855] [2025-03-08 16:44:49,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888046855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:49,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:49,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:44:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499937301] [2025-03-08 16:44:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:49,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:44:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:49,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:44:49,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:49,726 INFO L87 Difference]: Start difference. First operand 305 states and 425 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:49,958 INFO L93 Difference]: Finished difference Result 771 states and 1076 transitions. [2025-03-08 16:44:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:44:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-08 16:44:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:49,960 INFO L225 Difference]: With dead ends: 771 [2025-03-08 16:44:49,961 INFO L226 Difference]: Without dead ends: 469 [2025-03-08 16:44:49,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:44:49,962 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 321 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:49,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 965 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:44:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-08 16:44:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 302. [2025-03-08 16:44:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 274 states have (on average 1.354014598540146) internal successors, (371), 275 states have internal predecessors, (371), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 421 transitions. [2025-03-08 16:44:49,983 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 421 transitions. Word has length 181 [2025-03-08 16:44:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:49,984 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 421 transitions. [2025-03-08 16:44:49,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 421 transitions. [2025-03-08 16:44:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 16:44:49,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:49,985 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:49,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:44:49,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:49,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1677029317, now seen corresponding path program 1 times [2025-03-08 16:44:49,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:49,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828726568] [2025-03-08 16:44:49,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:49,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:50,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:44:50,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:44:50,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:50,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:50,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:50,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828726568] [2025-03-08 16:44:50,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828726568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:50,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:44:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316059094] [2025-03-08 16:44:50,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:50,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:44:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:50,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:44:50,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:50,280 INFO L87 Difference]: Start difference. First operand 302 states and 421 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:50,506 INFO L93 Difference]: Finished difference Result 719 states and 1005 transitions. [2025-03-08 16:44:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:44:50,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-08 16:44:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:50,508 INFO L225 Difference]: With dead ends: 719 [2025-03-08 16:44:50,508 INFO L226 Difference]: Without dead ends: 420 [2025-03-08 16:44:50,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:44:50,509 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 416 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:50,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 640 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:44:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-08 16:44:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 302. [2025-03-08 16:44:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 275 states have internal predecessors, (370), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2025-03-08 16:44:50,531 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 181 [2025-03-08 16:44:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:50,532 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2025-03-08 16:44:50,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2025-03-08 16:44:50,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 16:44:50,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:50,533 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:50,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:44:50,534 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:50,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:50,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2107403802, now seen corresponding path program 1 times [2025-03-08 16:44:50,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:50,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680441146] [2025-03-08 16:44:50,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:50,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:50,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:44:50,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:44:50,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:50,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:44:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680441146] [2025-03-08 16:44:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680441146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:44:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858969862] [2025-03-08 16:44:50,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:50,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:44:50,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:44:50,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:44:50,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:44:51,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 16:44:51,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 16:44:51,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:51,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:51,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:44:51,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:44:51,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 16:44:51,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 16:44:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:51,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:44:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858969862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:44:51,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-08 16:44:51,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222554164] [2025-03-08 16:44:51,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:51,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:44:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:51,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:44:51,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:44:51,276 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:51,574 INFO L93 Difference]: Finished difference Result 917 states and 1282 transitions. [2025-03-08 16:44:51,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:44:51,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-03-08 16:44:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:51,579 INFO L225 Difference]: With dead ends: 917 [2025-03-08 16:44:51,579 INFO L226 Difference]: Without dead ends: 618 [2025-03-08 16:44:51,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:44:51,580 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 331 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:51,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 2685 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:44:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-03-08 16:44:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 306. [2025-03-08 16:44:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 278 states have (on average 1.3489208633093526) internal successors, (375), 279 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 425 transitions. [2025-03-08 16:44:51,612 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 425 transitions. Word has length 181 [2025-03-08 16:44:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:51,613 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 425 transitions. [2025-03-08 16:44:51,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 425 transitions. [2025-03-08 16:44:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 16:44:51,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:51,615 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:51,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 16:44:51,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:44:51,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:51,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:51,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1919763688, now seen corresponding path program 1 times [2025-03-08 16:44:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617946856] [2025-03-08 16:44:51,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:51,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:51,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 16:44:51,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 16:44:51,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:51,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:51,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:51,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617946856] [2025-03-08 16:44:51,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617946856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:51,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:51,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:44:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664801729] [2025-03-08 16:44:51,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:51,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:44:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:51,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:44:51,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:44:51,903 INFO L87 Difference]: Start difference. First operand 306 states and 425 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:51,930 INFO L93 Difference]: Finished difference Result 610 states and 849 transitions. [2025-03-08 16:44:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:44:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-03-08 16:44:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:51,932 INFO L225 Difference]: With dead ends: 610 [2025-03-08 16:44:51,932 INFO L226 Difference]: Without dead ends: 307 [2025-03-08 16:44:51,934 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-08 16:44:51,934 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:51,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-08 16:44:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-03-08 16:44:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 279 states have (on average 1.3476702508960574) internal successors, (376), 280 states have internal predecessors, (376), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 426 transitions. [2025-03-08 16:44:51,957 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 426 transitions. Word has length 182 [2025-03-08 16:44:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:51,957 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 426 transitions. [2025-03-08 16:44:51,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 426 transitions. [2025-03-08 16:44:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 16:44:51,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:51,960 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:51,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:44:51,960 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:51,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -286959689, now seen corresponding path program 1 times [2025-03-08 16:44:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:51,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486876345] [2025-03-08 16:44:51,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:51,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 16:44:52,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 16:44:52,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:52,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:52,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:52,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486876345] [2025-03-08 16:44:52,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486876345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:52,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:52,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303733550] [2025-03-08 16:44:52,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:52,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:52,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:52,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:52,124 INFO L87 Difference]: Start difference. First operand 307 states and 426 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:52,172 INFO L93 Difference]: Finished difference Result 611 states and 849 transitions. [2025-03-08 16:44:52,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:52,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-03-08 16:44:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:52,174 INFO L225 Difference]: With dead ends: 611 [2025-03-08 16:44:52,174 INFO L226 Difference]: Without dead ends: 307 [2025-03-08 16:44:52,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:52,175 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:52,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-08 16:44:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-03-08 16:44:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 279 states have (on average 1.3440860215053763) internal successors, (375), 280 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 425 transitions. [2025-03-08 16:44:52,195 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 425 transitions. Word has length 182 [2025-03-08 16:44:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:52,195 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 425 transitions. [2025-03-08 16:44:52,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 425 transitions. [2025-03-08 16:44:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 16:44:52,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:52,197 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:52,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:44:52,197 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:52,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2057707352, now seen corresponding path program 1 times [2025-03-08 16:44:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139777018] [2025-03-08 16:44:52,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:52,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 16:44:52,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 16:44:52,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:52,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:52,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:52,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139777018] [2025-03-08 16:44:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139777018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:52,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:52,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010689666] [2025-03-08 16:44:52,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:52,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:52,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:52,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:52,329 INFO L87 Difference]: Start difference. First operand 307 states and 425 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:52,395 INFO L93 Difference]: Finished difference Result 695 states and 958 transitions. [2025-03-08 16:44:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:52,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-03-08 16:44:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:52,398 INFO L225 Difference]: With dead ends: 695 [2025-03-08 16:44:52,398 INFO L226 Difference]: Without dead ends: 390 [2025-03-08 16:44:52,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:52,399 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 101 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:52,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 961 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-08 16:44:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 226. [2025-03-08 16:44:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 199 states have internal predecessors, (260), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 310 transitions. [2025-03-08 16:44:52,418 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 310 transitions. Word has length 182 [2025-03-08 16:44:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:52,418 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 310 transitions. [2025-03-08 16:44:52,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 310 transitions. [2025-03-08 16:44:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 16:44:52,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:52,420 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:52,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:44:52,420 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:52,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2057496074, now seen corresponding path program 1 times [2025-03-08 16:44:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:52,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967447359] [2025-03-08 16:44:52,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:52,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 16:44:52,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 16:44:52,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:52,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967447359] [2025-03-08 16:44:52,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967447359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:52,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:52,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:44:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440628112] [2025-03-08 16:44:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:52,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:44:52,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:52,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:44:52,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:44:52,728 INFO L87 Difference]: Start difference. First operand 226 states and 310 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:52,843 INFO L93 Difference]: Finished difference Result 511 states and 704 transitions. [2025-03-08 16:44:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:44:52,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 183 [2025-03-08 16:44:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:52,845 INFO L225 Difference]: With dead ends: 511 [2025-03-08 16:44:52,845 INFO L226 Difference]: Without dead ends: 288 [2025-03-08 16:44:52,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:44:52,846 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 164 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:52,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1502 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-08 16:44:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 232. [2025-03-08 16:44:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.303921568627451) internal successors, (266), 205 states have internal predecessors, (266), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-03-08 16:44:52,863 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 183 [2025-03-08 16:44:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:52,864 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-03-08 16:44:52,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-03-08 16:44:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 16:44:52,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:52,865 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:52,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:44:52,865 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:52,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2022915892, now seen corresponding path program 1 times [2025-03-08 16:44:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:52,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279838271] [2025-03-08 16:44:52,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:52,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 16:44:52,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 16:44:52,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:52,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:52,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:52,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279838271] [2025-03-08 16:44:52,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279838271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:52,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:52,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:44:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768182185] [2025-03-08 16:44:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:52,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:44:52,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:52,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:44:52,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:44:52,927 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:52,948 INFO L93 Difference]: Finished difference Result 463 states and 633 transitions. [2025-03-08 16:44:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:44:52,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2025-03-08 16:44:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:52,950 INFO L225 Difference]: With dead ends: 463 [2025-03-08 16:44:52,950 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 16:44:52,950 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-08 16:44:52,951 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:52,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 16:44:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-08 16:44:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 207 states have internal predecessors, (268), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 318 transitions. [2025-03-08 16:44:52,966 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 318 transitions. Word has length 185 [2025-03-08 16:44:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:52,966 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 318 transitions. [2025-03-08 16:44:52,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 318 transitions. [2025-03-08 16:44:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 16:44:52,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:52,967 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:52,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:44:52,968 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:52,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash -669606195, now seen corresponding path program 1 times [2025-03-08 16:44:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977904238] [2025-03-08 16:44:52,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:52,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 16:44:53,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 16:44:53,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:53,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977904238] [2025-03-08 16:44:53,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977904238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:53,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62125849] [2025-03-08 16:44:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:53,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:53,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:53,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:53,115 INFO L87 Difference]: Start difference. First operand 234 states and 318 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:53,165 INFO L93 Difference]: Finished difference Result 625 states and 847 transitions. [2025-03-08 16:44:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2025-03-08 16:44:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:53,168 INFO L225 Difference]: With dead ends: 625 [2025-03-08 16:44:53,168 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 16:44:53,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:53,168 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 74 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:53,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 765 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 16:44:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 324. [2025-03-08 16:44:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 296 states have (on average 1.3006756756756757) internal successors, (385), 297 states have internal predecessors, (385), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 435 transitions. [2025-03-08 16:44:53,188 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 435 transitions. Word has length 185 [2025-03-08 16:44:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:53,188 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 435 transitions. [2025-03-08 16:44:53,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 435 transitions. [2025-03-08 16:44:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 16:44:53,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:53,190 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:53,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:44:53,190 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:53,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:53,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1689700814, now seen corresponding path program 1 times [2025-03-08 16:44:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:53,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308375292] [2025-03-08 16:44:53,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:53,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:53,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 16:44:53,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 16:44:53,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:53,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:53,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308375292] [2025-03-08 16:44:53,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308375292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:53,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:53,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934371198] [2025-03-08 16:44:53,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:53,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:53,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:53,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:53,336 INFO L87 Difference]: Start difference. First operand 324 states and 435 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:53,403 INFO L93 Difference]: Finished difference Result 715 states and 962 transitions. [2025-03-08 16:44:53,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:53,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2025-03-08 16:44:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:53,405 INFO L225 Difference]: With dead ends: 715 [2025-03-08 16:44:53,405 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 16:44:53,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:53,406 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 75 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:53,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 843 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 16:44:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 324. [2025-03-08 16:44:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 296 states have (on average 1.2939189189189189) internal successors, (383), 297 states have internal predecessors, (383), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 433 transitions. [2025-03-08 16:44:53,423 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 433 transitions. Word has length 185 [2025-03-08 16:44:53,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:53,423 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 433 transitions. [2025-03-08 16:44:53,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 433 transitions. [2025-03-08 16:44:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 16:44:53,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:53,425 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:53,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:44:53,425 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:53,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1097714673, now seen corresponding path program 1 times [2025-03-08 16:44:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:53,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834678909] [2025-03-08 16:44:53,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:53,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 16:44:53,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 16:44:53,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:53,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:53,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:53,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834678909] [2025-03-08 16:44:53,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834678909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:53,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:53,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701292329] [2025-03-08 16:44:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:53,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:53,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:53,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:53,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:53,622 INFO L87 Difference]: Start difference. First operand 324 states and 433 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:53,678 INFO L93 Difference]: Finished difference Result 705 states and 946 transitions. [2025-03-08 16:44:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:44:53,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2025-03-08 16:44:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:53,681 INFO L225 Difference]: With dead ends: 705 [2025-03-08 16:44:53,681 INFO L226 Difference]: Without dead ends: 384 [2025-03-08 16:44:53,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:53,683 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 72 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:53,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 924 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-08 16:44:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 312. [2025-03-08 16:44:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 284 states have (on average 1.2922535211267605) internal successors, (367), 285 states have internal predecessors, (367), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 417 transitions. [2025-03-08 16:44:53,703 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 417 transitions. Word has length 185 [2025-03-08 16:44:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:53,703 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 417 transitions. [2025-03-08 16:44:53,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 417 transitions. [2025-03-08 16:44:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 16:44:53,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:53,704 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:53,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:44:53,705 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:53,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash 532581411, now seen corresponding path program 1 times [2025-03-08 16:44:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507707553] [2025-03-08 16:44:53,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:53,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:53,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 16:44:53,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 16:44:53,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:53,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507707553] [2025-03-08 16:44:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507707553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:44:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712963854] [2025-03-08 16:44:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:53,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:44:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:53,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:44:53,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:44:53,772 INFO L87 Difference]: Start difference. First operand 312 states and 417 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:53,799 INFO L93 Difference]: Finished difference Result 627 states and 839 transitions. [2025-03-08 16:44:53,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:44:53,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-08 16:44:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:53,802 INFO L225 Difference]: With dead ends: 627 [2025-03-08 16:44:53,802 INFO L226 Difference]: Without dead ends: 318 [2025-03-08 16:44:53,803 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-08 16:44:53,803 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:53,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-08 16:44:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2025-03-08 16:44:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 288 states have (on average 1.2881944444444444) internal successors, (371), 289 states have internal predecessors, (371), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 421 transitions. [2025-03-08 16:44:53,819 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 421 transitions. Word has length 187 [2025-03-08 16:44:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:53,819 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 421 transitions. [2025-03-08 16:44:53,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 421 transitions. [2025-03-08 16:44:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 16:44:53,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:53,821 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:53,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:44:53,821 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:53,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:53,822 INFO L85 PathProgramCache]: Analyzing trace with hash 661664130, now seen corresponding path program 1 times [2025-03-08 16:44:53,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:53,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424436086] [2025-03-08 16:44:53,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:53,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 16:44:53,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 16:44:53,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:53,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:54,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424436086] [2025-03-08 16:44:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424436086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:54,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:54,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:44:54,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8759310] [2025-03-08 16:44:54,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:54,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:44:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:54,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:44:54,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:44:54,223 INFO L87 Difference]: Start difference. First operand 316 states and 421 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:54,423 INFO L93 Difference]: Finished difference Result 783 states and 1039 transitions. [2025-03-08 16:44:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:44:54,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-08 16:44:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:54,426 INFO L225 Difference]: With dead ends: 783 [2025-03-08 16:44:54,426 INFO L226 Difference]: Without dead ends: 470 [2025-03-08 16:44:54,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:44:54,429 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 162 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:54,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1644 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-08 16:44:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 367. [2025-03-08 16:44:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 339 states have (on average 1.2625368731563422) internal successors, (428), 340 states have internal predecessors, (428), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 16:44:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 478 transitions. [2025-03-08 16:44:54,457 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 478 transitions. Word has length 187 [2025-03-08 16:44:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:54,458 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 478 transitions. [2025-03-08 16:44:54,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 478 transitions. [2025-03-08 16:44:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 16:44:54,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:54,461 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:54,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:44:54,462 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:54,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash 302419496, now seen corresponding path program 1 times [2025-03-08 16:44:54,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:54,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992537789] [2025-03-08 16:44:54,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:54,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:54,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 16:44:54,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 16:44:54,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:54,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:54,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992537789] [2025-03-08 16:44:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992537789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:54,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:54,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362674182] [2025-03-08 16:44:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:54,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:54,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:54,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:54,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:54,671 INFO L87 Difference]: Start difference. First operand 367 states and 478 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:54,734 INFO L93 Difference]: Finished difference Result 734 states and 954 transitions. [2025-03-08 16:44:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 188 [2025-03-08 16:44:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:54,736 INFO L225 Difference]: With dead ends: 734 [2025-03-08 16:44:54,736 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 16:44:54,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:54,737 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 149 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:54,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 638 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 16:44:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 328. [2025-03-08 16:44:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 302 states have internal predecessors, (377), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:44:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 423 transitions. [2025-03-08 16:44:54,756 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 423 transitions. Word has length 188 [2025-03-08 16:44:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:54,756 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 423 transitions. [2025-03-08 16:44:54,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 423 transitions. [2025-03-08 16:44:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 16:44:54,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:54,758 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:54,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:44:54,758 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:54,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash 112763781, now seen corresponding path program 1 times [2025-03-08 16:44:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:54,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741252580] [2025-03-08 16:44:54,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:54,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 16:44:54,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 16:44:54,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:54,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:54,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:54,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741252580] [2025-03-08 16:44:54,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741252580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:54,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:54,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:54,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090163299] [2025-03-08 16:44:54,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:54,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:54,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:54,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:54,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:54,934 INFO L87 Difference]: Start difference. First operand 328 states and 423 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:55,000 INFO L93 Difference]: Finished difference Result 688 states and 887 transitions. [2025-03-08 16:44:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 189 [2025-03-08 16:44:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:55,002 INFO L225 Difference]: With dead ends: 688 [2025-03-08 16:44:55,002 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 16:44:55,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:55,003 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 65 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:55,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 718 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 16:44:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 328. [2025-03-08 16:44:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 302 states have (on average 1.2450331125827814) internal successors, (376), 302 states have internal predecessors, (376), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:44:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 422 transitions. [2025-03-08 16:44:55,020 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 422 transitions. Word has length 189 [2025-03-08 16:44:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:55,020 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 422 transitions. [2025-03-08 16:44:55,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 422 transitions. [2025-03-08 16:44:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:44:55,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:55,021 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:55,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:44:55,023 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:55,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:55,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1523945813, now seen corresponding path program 1 times [2025-03-08 16:44:55,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:55,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501177595] [2025-03-08 16:44:55,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:55,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:55,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:44:55,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:44:55,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:55,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:55,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:55,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501177595] [2025-03-08 16:44:55,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501177595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:55,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:55,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:44:55,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570207353] [2025-03-08 16:44:55,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:55,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:44:55,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:55,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:44:55,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:44:55,562 INFO L87 Difference]: Start difference. First operand 328 states and 422 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:55,847 INFO L93 Difference]: Finished difference Result 772 states and 993 transitions. [2025-03-08 16:44:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:44:55,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 190 [2025-03-08 16:44:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:55,851 INFO L225 Difference]: With dead ends: 772 [2025-03-08 16:44:55,851 INFO L226 Difference]: Without dead ends: 447 [2025-03-08 16:44:55,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:44:55,852 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 236 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:55,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1530 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:44:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-08 16:44:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2025-03-08 16:44:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 360 states have (on average 1.2416666666666667) internal successors, (447), 361 states have internal predecessors, (447), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 16:44:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 509 transitions. [2025-03-08 16:44:55,881 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 509 transitions. Word has length 190 [2025-03-08 16:44:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:55,881 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 509 transitions. [2025-03-08 16:44:55,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 509 transitions. [2025-03-08 16:44:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:44:55,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:55,882 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:44:55,883 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:55,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash 439075595, now seen corresponding path program 1 times [2025-03-08 16:44:55,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:55,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639643101] [2025-03-08 16:44:55,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:55,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:55,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:44:55,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:44:55,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:55,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639643101] [2025-03-08 16:44:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639643101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:44:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970913773] [2025-03-08 16:44:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:56,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:44:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:56,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:44:56,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:44:56,401 INFO L87 Difference]: Start difference. First operand 396 states and 509 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:56,637 INFO L93 Difference]: Finished difference Result 862 states and 1106 transitions. [2025-03-08 16:44:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:44:56,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 190 [2025-03-08 16:44:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:56,641 INFO L225 Difference]: With dead ends: 862 [2025-03-08 16:44:56,641 INFO L226 Difference]: Without dead ends: 469 [2025-03-08 16:44:56,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:44:56,643 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 274 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:56,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1127 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-08 16:44:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 364. [2025-03-08 16:44:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 337 states have (on average 1.2373887240356083) internal successors, (417), 337 states have internal predecessors, (417), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:44:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 463 transitions. [2025-03-08 16:44:56,663 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 463 transitions. Word has length 190 [2025-03-08 16:44:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:56,663 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 463 transitions. [2025-03-08 16:44:56,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 463 transitions. [2025-03-08 16:44:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:44:56,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:56,664 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:56,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:44:56,665 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:56,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:56,666 INFO L85 PathProgramCache]: Analyzing trace with hash 568158314, now seen corresponding path program 1 times [2025-03-08 16:44:56,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:56,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339138366] [2025-03-08 16:44:56,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:56,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:44:56,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:44:56,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:56,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:56,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:56,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339138366] [2025-03-08 16:44:56,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339138366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:56,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:56,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:44:56,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864863971] [2025-03-08 16:44:56,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:56,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:44:56,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:56,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:44:56,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:44:56,938 INFO L87 Difference]: Start difference. First operand 364 states and 463 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:57,047 INFO L93 Difference]: Finished difference Result 784 states and 998 transitions. [2025-03-08 16:44:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:44:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 190 [2025-03-08 16:44:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:57,049 INFO L225 Difference]: With dead ends: 784 [2025-03-08 16:44:57,049 INFO L226 Difference]: Without dead ends: 423 [2025-03-08 16:44:57,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:44:57,051 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 163 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:57,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1306 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-08 16:44:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2025-03-08 16:44:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 382 states have (on average 1.2356020942408377) internal successors, (472), 383 states have internal predecessors, (472), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 16:44:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 530 transitions. [2025-03-08 16:44:57,076 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 530 transitions. Word has length 190 [2025-03-08 16:44:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:57,076 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 530 transitions. [2025-03-08 16:44:57,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 530 transitions. [2025-03-08 16:44:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:44:57,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:57,077 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:57,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:44:57,078 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:57,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2075710123, now seen corresponding path program 1 times [2025-03-08 16:44:57,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:57,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668057665] [2025-03-08 16:44:57,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:57,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:44:57,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:44:57,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:57,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:57,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668057665] [2025-03-08 16:44:57,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668057665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:57,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:57,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:57,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051593129] [2025-03-08 16:44:57,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:57,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:57,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:57,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:57,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:57,244 INFO L87 Difference]: Start difference. First operand 417 states and 530 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:57,332 INFO L93 Difference]: Finished difference Result 1104 states and 1398 transitions. [2025-03-08 16:44:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:57,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 190 [2025-03-08 16:44:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:57,335 INFO L225 Difference]: With dead ends: 1104 [2025-03-08 16:44:57,336 INFO L226 Difference]: Without dead ends: 690 [2025-03-08 16:44:57,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:57,337 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 151 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:57,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 587 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-08 16:44:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 672. [2025-03-08 16:44:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 625 states have (on average 1.24) internal successors, (775), 628 states have internal predecessors, (775), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 16:44:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 849 transitions. [2025-03-08 16:44:57,390 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 849 transitions. Word has length 190 [2025-03-08 16:44:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:57,390 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 849 transitions. [2025-03-08 16:44:57,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 849 transitions. [2025-03-08 16:44:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:44:57,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:57,392 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:57,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:44:57,393 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:57,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1848337900, now seen corresponding path program 1 times [2025-03-08 16:44:57,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:57,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896325185] [2025-03-08 16:44:57,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:57,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:44:57,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:44:57,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:57,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:57,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:57,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896325185] [2025-03-08 16:44:57,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896325185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:57,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:57,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:44:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54869845] [2025-03-08 16:44:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:57,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:44:57,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:57,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:44:57,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:44:57,713 INFO L87 Difference]: Start difference. First operand 672 states and 849 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:57,869 INFO L93 Difference]: Finished difference Result 1354 states and 1708 transitions. [2025-03-08 16:44:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:44:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 190 [2025-03-08 16:44:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:57,874 INFO L225 Difference]: With dead ends: 1354 [2025-03-08 16:44:57,874 INFO L226 Difference]: Without dead ends: 685 [2025-03-08 16:44:57,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:44:57,876 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 273 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:57,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1501 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-08 16:44:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 675. [2025-03-08 16:44:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 625 states have (on average 1.232) internal successors, (770), 628 states have internal predecessors, (770), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 16:44:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 848 transitions. [2025-03-08 16:44:57,913 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 848 transitions. Word has length 190 [2025-03-08 16:44:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:57,914 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 848 transitions. [2025-03-08 16:44:57,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 848 transitions. [2025-03-08 16:44:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:44:57,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:57,915 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:57,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 16:44:57,915 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:57,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2095183926, now seen corresponding path program 1 times [2025-03-08 16:44:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:57,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587308385] [2025-03-08 16:44:57,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:57,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:44:57,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:44:57,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:57,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:58,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587308385] [2025-03-08 16:44:58,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587308385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:58,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:58,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:58,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761462410] [2025-03-08 16:44:58,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:58,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:58,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:58,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:58,016 INFO L87 Difference]: Start difference. First operand 675 states and 848 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:58,070 INFO L93 Difference]: Finished difference Result 1196 states and 1505 transitions. [2025-03-08 16:44:58,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:58,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 190 [2025-03-08 16:44:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:58,072 INFO L225 Difference]: With dead ends: 1196 [2025-03-08 16:44:58,072 INFO L226 Difference]: Without dead ends: 524 [2025-03-08 16:44:58,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:58,075 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:58,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 669 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-08 16:44:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 476. [2025-03-08 16:44:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 440 states have (on average 1.2272727272727273) internal successors, (540), 441 states have internal predecessors, (540), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 16:44:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 598 transitions. [2025-03-08 16:44:58,109 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 598 transitions. Word has length 190 [2025-03-08 16:44:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:58,109 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 598 transitions. [2025-03-08 16:44:58,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 598 transitions. [2025-03-08 16:44:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 16:44:58,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:58,111 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:58,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 16:44:58,111 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:58,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:58,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1972411147, now seen corresponding path program 1 times [2025-03-08 16:44:58,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:58,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039327008] [2025-03-08 16:44:58,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:58,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 16:44:58,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 16:44:58,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:58,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:58,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:58,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039327008] [2025-03-08 16:44:58,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039327008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:58,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:58,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:44:58,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148611287] [2025-03-08 16:44:58,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:58,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:58,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:58,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:58,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:44:58,276 INFO L87 Difference]: Start difference. First operand 476 states and 598 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:58,360 INFO L93 Difference]: Finished difference Result 988 states and 1240 transitions. [2025-03-08 16:44:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:58,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 190 [2025-03-08 16:44:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:58,362 INFO L225 Difference]: With dead ends: 988 [2025-03-08 16:44:58,362 INFO L226 Difference]: Without dead ends: 515 [2025-03-08 16:44:58,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:44:58,364 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 137 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:58,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 671 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-08 16:44:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2025-03-08 16:44:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 470 states have (on average 1.225531914893617) internal successors, (576), 472 states have internal predecessors, (576), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 16:44:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 642 transitions. [2025-03-08 16:44:58,393 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 642 transitions. Word has length 190 [2025-03-08 16:44:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:58,394 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 642 transitions. [2025-03-08 16:44:58,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 642 transitions. [2025-03-08 16:44:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:44:58,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:58,395 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:58,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 16:44:58,395 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:58,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:58,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1686158701, now seen corresponding path program 1 times [2025-03-08 16:44:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:58,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725398669] [2025-03-08 16:44:58,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:58,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:58,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:44:58,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:44:58,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:58,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:58,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:58,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725398669] [2025-03-08 16:44:58,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725398669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:58,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:58,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:44:58,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638929632] [2025-03-08 16:44:58,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:58,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:44:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:58,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:44:58,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:44:58,721 INFO L87 Difference]: Start difference. First operand 512 states and 642 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 16:44:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:59,132 INFO L93 Difference]: Finished difference Result 1367 states and 1731 transitions. [2025-03-08 16:44:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:44:59,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 191 [2025-03-08 16:44:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:59,136 INFO L225 Difference]: With dead ends: 1367 [2025-03-08 16:44:59,136 INFO L226 Difference]: Without dead ends: 858 [2025-03-08 16:44:59,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:44:59,137 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 530 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:59,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1360 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:44:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-08 16:44:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 705. [2025-03-08 16:44:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 643 states have (on average 1.2006220839813375) internal successors, (772), 647 states have internal predecessors, (772), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 16:44:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 866 transitions. [2025-03-08 16:44:59,185 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 866 transitions. Word has length 191 [2025-03-08 16:44:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:59,185 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 866 transitions. [2025-03-08 16:44:59,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 16:44:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 866 transitions. [2025-03-08 16:44:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:44:59,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:59,186 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:59,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 16:44:59,187 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:59,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash 807360159, now seen corresponding path program 1 times [2025-03-08 16:44:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:59,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413667] [2025-03-08 16:44:59,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:59,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:44:59,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:44:59,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:59,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:59,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:59,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413667] [2025-03-08 16:44:59,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:59,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:59,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:44:59,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759087857] [2025-03-08 16:44:59,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:59,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:44:59,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:59,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:44:59,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:44:59,404 INFO L87 Difference]: Start difference. First operand 705 states and 866 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:59,532 INFO L93 Difference]: Finished difference Result 2060 states and 2522 transitions. [2025-03-08 16:44:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:44:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 191 [2025-03-08 16:44:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:59,536 INFO L225 Difference]: With dead ends: 2060 [2025-03-08 16:44:59,536 INFO L226 Difference]: Without dead ends: 1358 [2025-03-08 16:44:59,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:44:59,538 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 95 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:59,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 975 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:44:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-03-08 16:44:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1350. [2025-03-08 16:44:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1238 states have (on average 1.1922455573505655) internal successors, (1476), 1247 states have internal predecessors, (1476), 83 states have call successors, (83), 28 states have call predecessors, (83), 28 states have return successors, (83), 74 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 16:44:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1642 transitions. [2025-03-08 16:44:59,620 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1642 transitions. Word has length 191 [2025-03-08 16:44:59,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:59,620 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1642 transitions. [2025-03-08 16:44:59,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:44:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1642 transitions. [2025-03-08 16:44:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:44:59,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:59,622 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 16:44:59,623 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 610846654, now seen corresponding path program 1 times [2025-03-08 16:44:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:44:59,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629739289] [2025-03-08 16:44:59,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:59,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:44:59,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:44:59,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:44:59,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:59,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:44:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:44:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629739289] [2025-03-08 16:44:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629739289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:59,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:59,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:44:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273393512] [2025-03-08 16:44:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:59,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:44:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:44:59,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:44:59,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:44:59,979 INFO L87 Difference]: Start difference. First operand 1350 states and 1642 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:00,295 INFO L93 Difference]: Finished difference Result 3479 states and 4229 transitions. [2025-03-08 16:45:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:45:00,296 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 191 [2025-03-08 16:45:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:00,303 INFO L225 Difference]: With dead ends: 3479 [2025-03-08 16:45:00,304 INFO L226 Difference]: Without dead ends: 2132 [2025-03-08 16:45:00,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:45:00,306 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 152 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:00,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1754 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2025-03-08 16:45:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 1779. [2025-03-08 16:45:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1655 states have (on average 1.1649546827794561) internal successors, (1928), 1665 states have internal predecessors, (1928), 91 states have call successors, (91), 32 states have call predecessors, (91), 32 states have return successors, (91), 81 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 16:45:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2110 transitions. [2025-03-08 16:45:00,459 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2110 transitions. Word has length 191 [2025-03-08 16:45:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:00,459 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2110 transitions. [2025-03-08 16:45:00,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2110 transitions. [2025-03-08 16:45:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:45:00,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:00,462 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:00,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 16:45:00,462 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:00,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash -825443840, now seen corresponding path program 1 times [2025-03-08 16:45:00,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:00,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211512127] [2025-03-08 16:45:00,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:00,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:00,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:45:00,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:45:00,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:00,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:00,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211512127] [2025-03-08 16:45:00,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211512127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:00,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:00,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:45:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930330605] [2025-03-08 16:45:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:00,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:45:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:00,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:45:00,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:45:00,921 INFO L87 Difference]: Start difference. First operand 1779 states and 2110 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:01,297 INFO L93 Difference]: Finished difference Result 4141 states and 4919 transitions. [2025-03-08 16:45:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:45:01,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 191 [2025-03-08 16:45:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:01,304 INFO L225 Difference]: With dead ends: 4141 [2025-03-08 16:45:01,305 INFO L226 Difference]: Without dead ends: 2398 [2025-03-08 16:45:01,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:45:01,307 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 167 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:01,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1692 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:45:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2025-03-08 16:45:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2382. [2025-03-08 16:45:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2206 states have (on average 1.1627379873073436) internal successors, (2565), 2221 states have internal predecessors, (2565), 129 states have call successors, (129), 46 states have call predecessors, (129), 46 states have return successors, (129), 114 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-08 16:45:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 2823 transitions. [2025-03-08 16:45:01,470 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 2823 transitions. Word has length 191 [2025-03-08 16:45:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:01,470 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 2823 transitions. [2025-03-08 16:45:01,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 2823 transitions. [2025-03-08 16:45:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 16:45:01,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:01,474 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:01,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 16:45:01,474 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:01,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2026027138, now seen corresponding path program 1 times [2025-03-08 16:45:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:01,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704687586] [2025-03-08 16:45:01,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:01,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 16:45:01,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 16:45:01,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:01,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:01,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:01,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704687586] [2025-03-08 16:45:01,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704687586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:01,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:01,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:45:01,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210626379] [2025-03-08 16:45:01,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:01,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:45:01,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:01,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:45:01,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:45:01,631 INFO L87 Difference]: Start difference. First operand 2382 states and 2823 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:01,882 INFO L93 Difference]: Finished difference Result 5936 states and 7031 transitions. [2025-03-08 16:45:01,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:45:01,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 191 [2025-03-08 16:45:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:01,894 INFO L225 Difference]: With dead ends: 5936 [2025-03-08 16:45:01,894 INFO L226 Difference]: Without dead ends: 3590 [2025-03-08 16:45:01,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:45:01,899 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 158 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:01,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 645 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:45:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2025-03-08 16:45:02,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3580. [2025-03-08 16:45:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3305 states have (on average 1.1576399394856278) internal successors, (3826), 3330 states have internal predecessors, (3826), 199 states have call successors, (199), 75 states have call predecessors, (199), 75 states have return successors, (199), 174 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-08 16:45:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 4224 transitions. [2025-03-08 16:45:02,132 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 4224 transitions. Word has length 191 [2025-03-08 16:45:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:02,132 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 4224 transitions. [2025-03-08 16:45:02,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 4224 transitions. [2025-03-08 16:45:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 16:45:02,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:02,136 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:02,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 16:45:02,137 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:02,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1812358288, now seen corresponding path program 1 times [2025-03-08 16:45:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:02,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586552070] [2025-03-08 16:45:02,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:02,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 16:45:02,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 16:45:02,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:02,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:02,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586552070] [2025-03-08 16:45:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586552070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:02,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:02,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:45:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293723685] [2025-03-08 16:45:02,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:02,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:45:02,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:02,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:45:02,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:45:02,920 INFO L87 Difference]: Start difference. First operand 3580 states and 4224 transitions. Second operand has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 16:45:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:04,068 INFO L93 Difference]: Finished difference Result 10242 states and 12048 transitions. [2025-03-08 16:45:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:45:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 192 [2025-03-08 16:45:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:04,087 INFO L225 Difference]: With dead ends: 10242 [2025-03-08 16:45:04,087 INFO L226 Difference]: Without dead ends: 6706 [2025-03-08 16:45:04,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:45:04,092 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 697 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:04,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 2315 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:45:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2025-03-08 16:45:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 3724. [2025-03-08 16:45:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3449 states have (on average 1.1580168164685416) internal successors, (3994), 3474 states have internal predecessors, (3994), 199 states have call successors, (199), 75 states have call predecessors, (199), 75 states have return successors, (199), 174 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-08 16:45:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 4392 transitions. [2025-03-08 16:45:04,367 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 4392 transitions. Word has length 192 [2025-03-08 16:45:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:04,368 INFO L471 AbstractCegarLoop]: Abstraction has 3724 states and 4392 transitions. [2025-03-08 16:45:04,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 16:45:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4392 transitions. [2025-03-08 16:45:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 16:45:04,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:04,372 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:04,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 16:45:04,372 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:04,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:04,373 INFO L85 PathProgramCache]: Analyzing trace with hash 472505167, now seen corresponding path program 1 times [2025-03-08 16:45:04,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:04,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249933977] [2025-03-08 16:45:04,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:04,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:04,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 16:45:04,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 16:45:04,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:04,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:04,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249933977] [2025-03-08 16:45:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249933977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:04,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:04,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:45:04,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251226746] [2025-03-08 16:45:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:04,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:45:04,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:04,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:45:04,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:45:04,568 INFO L87 Difference]: Start difference. First operand 3724 states and 4392 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:04,941 INFO L93 Difference]: Finished difference Result 8220 states and 9798 transitions. [2025-03-08 16:45:04,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:45:04,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 192 [2025-03-08 16:45:04,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:04,954 INFO L225 Difference]: With dead ends: 8220 [2025-03-08 16:45:04,954 INFO L226 Difference]: Without dead ends: 4540 [2025-03-08 16:45:04,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:45:04,958 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 246 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:04,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1486 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2025-03-08 16:45:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 4143. [2025-03-08 16:45:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 3808 states have (on average 1.1488970588235294) internal successors, (4375), 3838 states have internal predecessors, (4375), 239 states have call successors, (239), 95 states have call predecessors, (239), 95 states have return successors, (239), 209 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-08 16:45:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 4853 transitions. [2025-03-08 16:45:05,395 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 4853 transitions. Word has length 192 [2025-03-08 16:45:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:05,395 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 4853 transitions. [2025-03-08 16:45:05,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 4853 transitions. [2025-03-08 16:45:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 16:45:05,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:05,400 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:05,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 16:45:05,400 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:05,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:05,400 INFO L85 PathProgramCache]: Analyzing trace with hash 35510168, now seen corresponding path program 1 times [2025-03-08 16:45:05,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277766434] [2025-03-08 16:45:05,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:05,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:05,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:45:05,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:45:05,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:05,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:05,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:05,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277766434] [2025-03-08 16:45:05,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277766434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:45:05,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261901734] [2025-03-08 16:45:05,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:05,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:05,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:45:05,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:45:05,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:45:06,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:45:06,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:45:06,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:06,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:06,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 16:45:06,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:45:06,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:45:06,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-08 16:45:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 10 proven. 558 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-08 16:45:06,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:45:06,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-08 16:45:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:06,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261901734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:45:06,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:45:06,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 15 [2025-03-08 16:45:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982584296] [2025-03-08 16:45:06,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:45:06,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:45:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:06,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:45:06,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:45:06,730 INFO L87 Difference]: Start difference. First operand 4143 states and 4853 transitions. Second operand has 15 states, 11 states have (on average 8.727272727272727) internal successors, (96), 14 states have internal predecessors, (96), 6 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 3 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-08 16:45:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:07,600 INFO L93 Difference]: Finished difference Result 7708 states and 9007 transitions. [2025-03-08 16:45:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:45:07,601 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 8.727272727272727) internal successors, (96), 14 states have internal predecessors, (96), 6 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 3 states have call predecessors, (48), 6 states have call successors, (48) Word has length 193 [2025-03-08 16:45:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:07,612 INFO L225 Difference]: With dead ends: 7708 [2025-03-08 16:45:07,613 INFO L226 Difference]: Without dead ends: 3609 [2025-03-08 16:45:07,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:45:07,619 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 237 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:07,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1196 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:45:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2025-03-08 16:45:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3454. [2025-03-08 16:45:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 3176 states have (on average 1.147984886649874) internal successors, (3646), 3200 states have internal predecessors, (3646), 197 states have call successors, (197), 80 states have call predecessors, (197), 80 states have return successors, (197), 173 states have call predecessors, (197), 197 states have call successors, (197) [2025-03-08 16:45:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4040 transitions. [2025-03-08 16:45:07,900 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4040 transitions. Word has length 193 [2025-03-08 16:45:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:07,901 INFO L471 AbstractCegarLoop]: Abstraction has 3454 states and 4040 transitions. [2025-03-08 16:45:07,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 8.727272727272727) internal successors, (96), 14 states have internal predecessors, (96), 6 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 3 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-08 16:45:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4040 transitions. [2025-03-08 16:45:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 16:45:07,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:07,904 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:07,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:45:08,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:08,105 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:08,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1177764226, now seen corresponding path program 1 times [2025-03-08 16:45:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:08,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370745141] [2025-03-08 16:45:08,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:08,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:08,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:45:08,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:45:08,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:08,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:08,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370745141] [2025-03-08 16:45:08,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370745141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:08,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:08,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:45:08,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40779136] [2025-03-08 16:45:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:08,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:45:08,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:08,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:45:08,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:45:08,616 INFO L87 Difference]: Start difference. First operand 3454 states and 4040 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:09,162 INFO L93 Difference]: Finished difference Result 7139 states and 8372 transitions. [2025-03-08 16:45:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:45:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 193 [2025-03-08 16:45:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:09,171 INFO L225 Difference]: With dead ends: 7139 [2025-03-08 16:45:09,171 INFO L226 Difference]: Without dead ends: 3737 [2025-03-08 16:45:09,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:45:09,174 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 167 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:09,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1643 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2025-03-08 16:45:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3212. [2025-03-08 16:45:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2993 states have (on average 1.1450050116939525) internal successors, (3427), 3011 states have internal predecessors, (3427), 155 states have call successors, (155), 63 states have call predecessors, (155), 63 states have return successors, (155), 137 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-08 16:45:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 3737 transitions. [2025-03-08 16:45:09,389 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 3737 transitions. Word has length 193 [2025-03-08 16:45:09,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:09,389 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 3737 transitions. [2025-03-08 16:45:09,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 3737 transitions. [2025-03-08 16:45:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 16:45:09,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:09,392 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:09,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 16:45:09,392 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:09,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash 981250721, now seen corresponding path program 1 times [2025-03-08 16:45:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30289230] [2025-03-08 16:45:09,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:09,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:45:09,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:45:09,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:09,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:09,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30289230] [2025-03-08 16:45:09,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30289230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:09,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:09,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:45:09,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614699458] [2025-03-08 16:45:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:09,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:45:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:09,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:45:09,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:45:09,585 INFO L87 Difference]: Start difference. First operand 3212 states and 3737 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:09,842 INFO L93 Difference]: Finished difference Result 6378 states and 7420 transitions. [2025-03-08 16:45:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:45:09,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 193 [2025-03-08 16:45:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:09,848 INFO L225 Difference]: With dead ends: 6378 [2025-03-08 16:45:09,848 INFO L226 Difference]: Without dead ends: 3218 [2025-03-08 16:45:09,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:45:09,853 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 159 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:09,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 922 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:45:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2025-03-08 16:45:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3204. [2025-03-08 16:45:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 2984 states have (on average 1.1414209115281502) internal successors, (3406), 3002 states have internal predecessors, (3406), 155 states have call successors, (155), 64 states have call predecessors, (155), 64 states have return successors, (155), 137 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-08 16:45:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 3716 transitions. [2025-03-08 16:45:10,080 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 3716 transitions. Word has length 193 [2025-03-08 16:45:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:10,082 INFO L471 AbstractCegarLoop]: Abstraction has 3204 states and 3716 transitions. [2025-03-08 16:45:10,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 3716 transitions. [2025-03-08 16:45:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 16:45:10,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:10,086 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:10,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 16:45:10,086 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:10,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:10,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1110333440, now seen corresponding path program 1 times [2025-03-08 16:45:10,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:10,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442799280] [2025-03-08 16:45:10,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:10,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:45:10,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:45:10,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:10,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442799280] [2025-03-08 16:45:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442799280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:10,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:45:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295293156] [2025-03-08 16:45:10,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:10,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:45:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:10,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:45:10,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:45:10,249 INFO L87 Difference]: Start difference. First operand 3204 states and 3716 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:10,535 INFO L93 Difference]: Finished difference Result 6321 states and 7331 transitions. [2025-03-08 16:45:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:45:10,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 193 [2025-03-08 16:45:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:10,542 INFO L225 Difference]: With dead ends: 6321 [2025-03-08 16:45:10,542 INFO L226 Difference]: Without dead ends: 3169 [2025-03-08 16:45:10,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:45:10,546 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 145 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:10,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 561 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2025-03-08 16:45:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 2493. [2025-03-08 16:45:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2332 states have (on average 1.1376500857632934) internal successors, (2653), 2344 states have internal predecessors, (2653), 113 states have call successors, (113), 47 states have call predecessors, (113), 47 states have return successors, (113), 101 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-08 16:45:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2879 transitions. [2025-03-08 16:45:10,796 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2879 transitions. Word has length 193 [2025-03-08 16:45:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:10,796 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 2879 transitions. [2025-03-08 16:45:10,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2879 transitions. [2025-03-08 16:45:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 16:45:10,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:10,799 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:10,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 16:45:10,799 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:10,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1555152550, now seen corresponding path program 1 times [2025-03-08 16:45:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741852658] [2025-03-08 16:45:10,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:10,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:45:10,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:45:10,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:10,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:11,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741852658] [2025-03-08 16:45:11,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741852658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:45:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353188259] [2025-03-08 16:45:11,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:11,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:11,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:45:11,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:45:11,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:45:11,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 16:45:11,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 16:45:11,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:11,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:11,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 16:45:11,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:45:11,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:45:11,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 16:45:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 8 proven. 528 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2025-03-08 16:45:11,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:45:11,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-08 16:45:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:12,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353188259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:45:12,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:45:12,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 25 [2025-03-08 16:45:12,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504956397] [2025-03-08 16:45:12,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:45:12,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 16:45:12,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:12,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 16:45:12,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:45:12,013 INFO L87 Difference]: Start difference. First operand 2493 states and 2879 transitions. Second operand has 25 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 25 states have internal predecessors, (148), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 5 states have call predecessors, (69), 8 states have call successors, (69) [2025-03-08 16:45:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:14,215 INFO L93 Difference]: Finished difference Result 5313 states and 6120 transitions. [2025-03-08 16:45:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-08 16:45:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 25 states have internal predecessors, (148), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 5 states have call predecessors, (69), 8 states have call successors, (69) Word has length 193 [2025-03-08 16:45:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:14,221 INFO L225 Difference]: With dead ends: 5313 [2025-03-08 16:45:14,221 INFO L226 Difference]: Without dead ends: 2872 [2025-03-08 16:45:14,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1120, Invalid=5360, Unknown=0, NotChecked=0, Total=6480 [2025-03-08 16:45:14,226 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1640 mSDsluCounter, 2463 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:14,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 2717 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:45:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2025-03-08 16:45:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 1544. [2025-03-08 16:45:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1375 states have (on average 1.1396363636363636) internal successors, (1567), 1383 states have internal predecessors, (1567), 116 states have call successors, (116), 52 states have call predecessors, (116), 52 states have return successors, (116), 108 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-08 16:45:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1799 transitions. [2025-03-08 16:45:14,396 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1799 transitions. Word has length 193 [2025-03-08 16:45:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:14,396 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1799 transitions. [2025-03-08 16:45:14,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 25 states have internal predecessors, (148), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 5 states have call predecessors, (69), 8 states have call successors, (69) [2025-03-08 16:45:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1799 transitions. [2025-03-08 16:45:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 16:45:14,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:14,399 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:14,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:45:14,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-03-08 16:45:14,599 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:14,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash -552825343, now seen corresponding path program 1 times [2025-03-08 16:45:14,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:14,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999188539] [2025-03-08 16:45:14,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:14,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:45:14,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:45:14,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:14,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:15,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999188539] [2025-03-08 16:45:15,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999188539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:45:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816479301] [2025-03-08 16:45:15,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:15,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:15,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:45:15,019 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:45:15,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:45:15,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:45:15,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:45:15,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:15,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:15,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 16:45:15,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:45:15,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:45:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 480 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-08 16:45:15,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:45:15,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-08 16:45:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:15,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816479301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:45:15,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:45:15,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2025-03-08 16:45:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193639789] [2025-03-08 16:45:15,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:45:15,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 16:45:15,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:15,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 16:45:15,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:45:15,846 INFO L87 Difference]: Start difference. First operand 1544 states and 1799 transitions. Second operand has 21 states, 17 states have (on average 6.352941176470588) internal successors, (108), 19 states have internal predecessors, (108), 6 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 4 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-08 16:45:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:16,469 INFO L93 Difference]: Finished difference Result 2888 states and 3361 transitions. [2025-03-08 16:45:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:45:16,470 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 6.352941176470588) internal successors, (108), 19 states have internal predecessors, (108), 6 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 4 states have call predecessors, (48), 6 states have call successors, (48) Word has length 196 [2025-03-08 16:45:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:16,474 INFO L225 Difference]: With dead ends: 2888 [2025-03-08 16:45:16,474 INFO L226 Difference]: Without dead ends: 1404 [2025-03-08 16:45:16,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 379 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:45:16,476 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 145 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:16,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1667 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:45:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-03-08 16:45:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1336. [2025-03-08 16:45:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1189 states have (on average 1.1379310344827587) internal successors, (1353), 1196 states have internal predecessors, (1353), 102 states have call successors, (102), 44 states have call predecessors, (102), 44 states have return successors, (102), 95 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 16:45:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1557 transitions. [2025-03-08 16:45:16,618 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1557 transitions. Word has length 196 [2025-03-08 16:45:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:16,619 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1557 transitions. [2025-03-08 16:45:16,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 6.352941176470588) internal successors, (108), 19 states have internal predecessors, (108), 6 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 4 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-08 16:45:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1557 transitions. [2025-03-08 16:45:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 16:45:16,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:16,620 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:16,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 16:45:16,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:16,820 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:16,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:16,821 INFO L85 PathProgramCache]: Analyzing trace with hash -394982815, now seen corresponding path program 1 times [2025-03-08 16:45:16,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:16,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658143963] [2025-03-08 16:45:16,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:16,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:16,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:45:16,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:45:16,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:16,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658143963] [2025-03-08 16:45:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658143963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:45:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276934788] [2025-03-08 16:45:17,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:17,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:17,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:45:17,195 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:45:17,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 16:45:17,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:45:17,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:45:17,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:17,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:17,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 16:45:17,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:45:17,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:45:17,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 16:45:17,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 16:45:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 13 proven. 543 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-03-08 16:45:17,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:45:18,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-08 16:45:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276934788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:45:18,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:45:18,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 18] total 30 [2025-03-08 16:45:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129263436] [2025-03-08 16:45:18,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:45:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 16:45:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:18,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 16:45:18,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:45:18,186 INFO L87 Difference]: Start difference. First operand 1336 states and 1557 transitions. Second operand has 30 states, 27 states have (on average 5.481481481481482) internal successors, (148), 30 states have internal predecessors, (148), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-08 16:45:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:19,686 INFO L93 Difference]: Finished difference Result 2881 states and 3349 transitions. [2025-03-08 16:45:19,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 16:45:19,686 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.481481481481482) internal successors, (148), 30 states have internal predecessors, (148), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) Word has length 196 [2025-03-08 16:45:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:19,690 INFO L225 Difference]: With dead ends: 2881 [2025-03-08 16:45:19,690 INFO L226 Difference]: Without dead ends: 1631 [2025-03-08 16:45:19,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=920, Invalid=4336, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 16:45:19,693 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 2335 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 815 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2335 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 815 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:19,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2335 Valid, 2246 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [815 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:45:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-08 16:45:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1417. [2025-03-08 16:45:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1246 states have (on average 1.1324237560192616) internal successors, (1411), 1254 states have internal predecessors, (1411), 117 states have call successors, (117), 53 states have call predecessors, (117), 53 states have return successors, (117), 109 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 16:45:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1645 transitions. [2025-03-08 16:45:19,882 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1645 transitions. Word has length 196 [2025-03-08 16:45:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:19,883 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 1645 transitions. [2025-03-08 16:45:19,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.481481481481482) internal successors, (148), 30 states have internal predecessors, (148), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-08 16:45:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1645 transitions. [2025-03-08 16:45:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 16:45:19,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:19,884 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:19,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 16:45:20,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:20,085 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:20,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash 981309121, now seen corresponding path program 1 times [2025-03-08 16:45:20,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:20,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485973497] [2025-03-08 16:45:20,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:20,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:45:20,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:45:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:20,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485973497] [2025-03-08 16:45:20,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485973497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:45:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123686357] [2025-03-08 16:45:20,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:20,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:20,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:45:20,343 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:45:20,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 16:45:20,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:45:20,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:45:20,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:20,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:20,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:45:20,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:45:20,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:45:20,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 251 [2025-03-08 16:45:20,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 195 [2025-03-08 16:45:20,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 171 [2025-03-08 16:45:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:20,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:45:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123686357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:45:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 16:45:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961849166] [2025-03-08 16:45:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:45:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:20,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:45:20,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:45:20,951 INFO L87 Difference]: Start difference. First operand 1417 states and 1645 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:21,269 INFO L93 Difference]: Finished difference Result 2808 states and 3260 transitions. [2025-03-08 16:45:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:45:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-08 16:45:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:21,274 INFO L225 Difference]: With dead ends: 2808 [2025-03-08 16:45:21,274 INFO L226 Difference]: Without dead ends: 1457 [2025-03-08 16:45:21,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:45:21,276 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 92 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:21,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1013 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:45:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-03-08 16:45:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1334. [2025-03-08 16:45:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1188 states have (on average 1.132996632996633) internal successors, (1346), 1195 states have internal predecessors, (1346), 98 states have call successors, (98), 47 states have call predecessors, (98), 47 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 16:45:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1542 transitions. [2025-03-08 16:45:21,498 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1542 transitions. Word has length 196 [2025-03-08 16:45:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:21,498 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1542 transitions. [2025-03-08 16:45:21,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1542 transitions. [2025-03-08 16:45:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 16:45:21,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:21,500 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:21,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 16:45:21,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-08 16:45:21,701 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:21,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1582608604, now seen corresponding path program 1 times [2025-03-08 16:45:21,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:21,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637895551] [2025-03-08 16:45:21,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:21,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:21,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 16:45:21,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 16:45:21,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:21,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637895551] [2025-03-08 16:45:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637895551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:45:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666722487] [2025-03-08 16:45:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:45:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:21,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:45:21,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:45:21,764 INFO L87 Difference]: Start difference. First operand 1334 states and 1542 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:21,915 INFO L93 Difference]: Finished difference Result 2345 states and 2717 transitions. [2025-03-08 16:45:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:45:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 196 [2025-03-08 16:45:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:21,918 INFO L225 Difference]: With dead ends: 2345 [2025-03-08 16:45:21,918 INFO L226 Difference]: Without dead ends: 1077 [2025-03-08 16:45:21,919 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-08 16:45:21,920 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:21,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 495 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:45:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-08 16:45:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2025-03-08 16:45:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 931 states have (on average 1.1235230934479055) internal successors, (1046), 938 states have internal predecessors, (1046), 98 states have call successors, (98), 47 states have call predecessors, (98), 47 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 16:45:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1242 transitions. [2025-03-08 16:45:22,086 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1242 transitions. Word has length 196 [2025-03-08 16:45:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:22,087 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1242 transitions. [2025-03-08 16:45:22,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1242 transitions. [2025-03-08 16:45:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 16:45:22,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:22,089 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:22,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 16:45:22,089 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:22,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1263801345, now seen corresponding path program 1 times [2025-03-08 16:45:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:22,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596949316] [2025-03-08 16:45:22,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:22,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:22,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 16:45:22,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 16:45:22,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:22,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:22,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:22,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596949316] [2025-03-08 16:45:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596949316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:22,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:22,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:45:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77038339] [2025-03-08 16:45:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:45:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:22,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:45:22,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:45:22,327 INFO L87 Difference]: Start difference. First operand 1077 states and 1242 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:22,560 INFO L93 Difference]: Finished difference Result 2179 states and 2518 transitions. [2025-03-08 16:45:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:45:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 198 [2025-03-08 16:45:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:22,563 INFO L225 Difference]: With dead ends: 2179 [2025-03-08 16:45:22,564 INFO L226 Difference]: Without dead ends: 1168 [2025-03-08 16:45:22,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:45:22,565 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 132 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:22,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 780 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-03-08 16:45:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1095. [2025-03-08 16:45:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 941 states have (on average 1.1190223166843782) internal successors, (1053), 948 states have internal predecessors, (1053), 105 states have call successors, (105), 48 states have call predecessors, (105), 48 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 16:45:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1263 transitions. [2025-03-08 16:45:22,731 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1263 transitions. Word has length 198 [2025-03-08 16:45:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:22,731 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1263 transitions. [2025-03-08 16:45:22,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1263 transitions. [2025-03-08 16:45:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 16:45:22,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:22,732 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:22,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 16:45:22,732 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:22,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:22,732 INFO L85 PathProgramCache]: Analyzing trace with hash 255466051, now seen corresponding path program 1 times [2025-03-08 16:45:22,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:22,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140268911] [2025-03-08 16:45:22,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:22,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 16:45:22,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 16:45:22,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:22,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:22,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:22,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140268911] [2025-03-08 16:45:22,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140268911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:22,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:22,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:45:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047926431] [2025-03-08 16:45:22,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:22,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:45:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:22,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:45:22,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:45:22,921 INFO L87 Difference]: Start difference. First operand 1095 states and 1263 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:23,163 INFO L93 Difference]: Finished difference Result 2177 states and 2508 transitions. [2025-03-08 16:45:23,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:45:23,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 198 [2025-03-08 16:45:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:23,167 INFO L225 Difference]: With dead ends: 2177 [2025-03-08 16:45:23,167 INFO L226 Difference]: Without dead ends: 1148 [2025-03-08 16:45:23,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:45:23,170 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 125 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:23,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1025 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-08 16:45:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1075. [2025-03-08 16:45:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 921 states have (on average 1.1085776330076005) internal successors, (1021), 928 states have internal predecessors, (1021), 105 states have call successors, (105), 48 states have call predecessors, (105), 48 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 16:45:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1231 transitions. [2025-03-08 16:45:23,337 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1231 transitions. Word has length 198 [2025-03-08 16:45:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:23,337 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1231 transitions. [2025-03-08 16:45:23,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1231 transitions. [2025-03-08 16:45:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 16:45:23,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:23,338 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:23,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 16:45:23,339 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1728344955, now seen corresponding path program 1 times [2025-03-08 16:45:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929709242] [2025-03-08 16:45:23,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:23,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 16:45:23,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 16:45:23,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:23,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:23,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:23,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929709242] [2025-03-08 16:45:23,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929709242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:23,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:23,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:45:23,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406034287] [2025-03-08 16:45:23,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:23,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:45:23,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:23,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:45:23,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:45:23,696 INFO L87 Difference]: Start difference. First operand 1075 states and 1231 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:24,011 INFO L93 Difference]: Finished difference Result 1397 states and 1594 transitions. [2025-03-08 16:45:24,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:45:24,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 198 [2025-03-08 16:45:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:24,014 INFO L225 Difference]: With dead ends: 1397 [2025-03-08 16:45:24,014 INFO L226 Difference]: Without dead ends: 1395 [2025-03-08 16:45:24,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:45:24,015 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 118 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:24,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1251 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-08 16:45:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1283. [2025-03-08 16:45:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1129 states have (on average 1.1045172719220548) internal successors, (1247), 1136 states have internal predecessors, (1247), 105 states have call successors, (105), 48 states have call predecessors, (105), 48 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 16:45:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1457 transitions. [2025-03-08 16:45:24,278 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1457 transitions. Word has length 198 [2025-03-08 16:45:24,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:24,278 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1457 transitions. [2025-03-08 16:45:24,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1457 transitions. [2025-03-08 16:45:24,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 16:45:24,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:24,280 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:24,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 16:45:24,280 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:24,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1222109183, now seen corresponding path program 1 times [2025-03-08 16:45:24,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:24,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930172754] [2025-03-08 16:45:24,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:24,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:24,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 16:45:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 16:45:24,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:24,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:24,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:24,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930172754] [2025-03-08 16:45:24,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930172754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:24,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:24,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:45:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853386606] [2025-03-08 16:45:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:24,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:45:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:24,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:45:24,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:45:24,935 INFO L87 Difference]: Start difference. First operand 1283 states and 1457 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:25,483 INFO L93 Difference]: Finished difference Result 3040 states and 3455 transitions. [2025-03-08 16:45:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:45:25,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 200 [2025-03-08 16:45:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:25,488 INFO L225 Difference]: With dead ends: 3040 [2025-03-08 16:45:25,488 INFO L226 Difference]: Without dead ends: 1823 [2025-03-08 16:45:25,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:45:25,490 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 94 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:25,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 2119 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:45:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2025-03-08 16:45:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1820. [2025-03-08 16:45:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1620 states have (on average 1.10679012345679) internal successors, (1793), 1630 states have internal predecessors, (1793), 135 states have call successors, (135), 64 states have call predecessors, (135), 64 states have return successors, (135), 125 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 16:45:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2063 transitions. [2025-03-08 16:45:25,708 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2063 transitions. Word has length 200 [2025-03-08 16:45:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:25,708 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2063 transitions. [2025-03-08 16:45:25,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2063 transitions. [2025-03-08 16:45:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 16:45:25,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:25,710 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:25,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 16:45:25,710 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:25,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:25,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1265403650, now seen corresponding path program 1 times [2025-03-08 16:45:25,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:25,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319884079] [2025-03-08 16:45:25,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:25,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 16:45:25,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 16:45:25,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:25,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:25,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:25,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319884079] [2025-03-08 16:45:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319884079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:25,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:25,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:45:25,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319583097] [2025-03-08 16:45:25,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:25,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:45:25,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:25,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:45:25,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:45:25,807 INFO L87 Difference]: Start difference. First operand 1820 states and 2063 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:26,097 INFO L93 Difference]: Finished difference Result 3559 states and 4031 transitions. [2025-03-08 16:45:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:45:26,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 200 [2025-03-08 16:45:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:26,101 INFO L225 Difference]: With dead ends: 3559 [2025-03-08 16:45:26,101 INFO L226 Difference]: Without dead ends: 1805 [2025-03-08 16:45:26,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:45:26,103 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 88 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:26,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 782 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-03-08 16:45:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1796. [2025-03-08 16:45:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1596 states have (on average 1.1008771929824561) internal successors, (1757), 1606 states have internal predecessors, (1757), 135 states have call successors, (135), 64 states have call predecessors, (135), 64 states have return successors, (135), 125 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 16:45:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2027 transitions. [2025-03-08 16:45:26,322 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2027 transitions. Word has length 200 [2025-03-08 16:45:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:26,322 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2027 transitions. [2025-03-08 16:45:26,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2027 transitions. [2025-03-08 16:45:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 16:45:26,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:26,324 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:26,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 16:45:26,324 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:26,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1098035936, now seen corresponding path program 1 times [2025-03-08 16:45:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:26,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080625296] [2025-03-08 16:45:26,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:26,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:26,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 16:45:26,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 16:45:26,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:26,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080625296] [2025-03-08 16:45:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080625296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:26,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:45:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491871834] [2025-03-08 16:45:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:26,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:45:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:26,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:45:26,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:45:26,411 INFO L87 Difference]: Start difference. First operand 1796 states and 2027 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:26,678 INFO L93 Difference]: Finished difference Result 3533 states and 3986 transitions. [2025-03-08 16:45:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:45:26,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 200 [2025-03-08 16:45:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:26,682 INFO L225 Difference]: With dead ends: 3533 [2025-03-08 16:45:26,682 INFO L226 Difference]: Without dead ends: 1803 [2025-03-08 16:45:26,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:45:26,684 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 87 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:26,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 945 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-03-08 16:45:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1604. [2025-03-08 16:45:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1461 states have (on average 1.0978781656399725) internal successors, (1604), 1468 states have internal predecessors, (1604), 96 states have call successors, (96), 46 states have call predecessors, (96), 46 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:45:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 1796 transitions. [2025-03-08 16:45:26,853 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 1796 transitions. Word has length 200 [2025-03-08 16:45:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:26,853 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 1796 transitions. [2025-03-08 16:45:26,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1796 transitions. [2025-03-08 16:45:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 16:45:26,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:26,855 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:26,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 16:45:26,855 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:26,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:26,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1389476897, now seen corresponding path program 1 times [2025-03-08 16:45:26,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:26,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349553519] [2025-03-08 16:45:26,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:26,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:26,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 16:45:26,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 16:45:26,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:26,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:27,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:27,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349553519] [2025-03-08 16:45:27,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349553519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:27,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:27,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:45:27,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894355864] [2025-03-08 16:45:27,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:27,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:45:27,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:27,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:45:27,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:45:27,209 INFO L87 Difference]: Start difference. First operand 1604 states and 1796 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:27,543 INFO L93 Difference]: Finished difference Result 3429 states and 3854 transitions. [2025-03-08 16:45:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:45:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 200 [2025-03-08 16:45:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:27,546 INFO L225 Difference]: With dead ends: 3429 [2025-03-08 16:45:27,546 INFO L226 Difference]: Without dead ends: 1891 [2025-03-08 16:45:27,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:45:27,548 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 131 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:27,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 2333 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:45:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2025-03-08 16:45:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1580. [2025-03-08 16:45:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1437 states have (on average 1.0953375086986779) internal successors, (1574), 1444 states have internal predecessors, (1574), 96 states have call successors, (96), 46 states have call predecessors, (96), 46 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 16:45:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 1766 transitions. [2025-03-08 16:45:27,710 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 1766 transitions. Word has length 200 [2025-03-08 16:45:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:27,710 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 1766 transitions. [2025-03-08 16:45:27,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1766 transitions. [2025-03-08 16:45:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 16:45:27,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:27,711 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:27,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 16:45:27,712 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:27,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash -615286112, now seen corresponding path program 1 times [2025-03-08 16:45:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:27,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341771903] [2025-03-08 16:45:27,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:27,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 16:45:27,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 16:45:27,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:27,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:27,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:27,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341771903] [2025-03-08 16:45:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341771903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:45:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802863349] [2025-03-08 16:45:27,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:27,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:27,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:45:27,977 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:45:27,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 16:45:28,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 16:45:28,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 16:45:28,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:28,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:28,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 16:45:28,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:45:28,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:45:28,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 16:45:28,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 16:45:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 13 proven. 543 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-03-08 16:45:28,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:45:28,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-08 16:45:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802863349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:45:28,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:45:28,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 20 [2025-03-08 16:45:28,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137869774] [2025-03-08 16:45:28,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:45:28,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:45:28,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:28,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:45:28,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:45:28,783 INFO L87 Difference]: Start difference. First operand 1580 states and 1766 transitions. Second operand has 20 states, 17 states have (on average 9.0) internal successors, (153), 19 states have internal predecessors, (153), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 6 states have call predecessors, (69), 8 states have call successors, (69) [2025-03-08 16:45:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:30,342 INFO L93 Difference]: Finished difference Result 2909 states and 3267 transitions. [2025-03-08 16:45:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 16:45:30,342 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 19 states have internal predecessors, (153), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 6 states have call predecessors, (69), 8 states have call successors, (69) Word has length 200 [2025-03-08 16:45:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:30,345 INFO L225 Difference]: With dead ends: 2909 [2025-03-08 16:45:30,346 INFO L226 Difference]: Without dead ends: 1395 [2025-03-08 16:45:30,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=839, Invalid=3193, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 16:45:30,347 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 776 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:30,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 2041 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:45:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-08 16:45:30,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 785. [2025-03-08 16:45:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 705 states have (on average 1.0893617021276596) internal successors, (768), 708 states have internal predecessors, (768), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:45:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 872 transitions. [2025-03-08 16:45:30,448 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 872 transitions. Word has length 200 [2025-03-08 16:45:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:30,448 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 872 transitions. [2025-03-08 16:45:30,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 19 states have internal predecessors, (153), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 6 states have call predecessors, (69), 8 states have call successors, (69) [2025-03-08 16:45:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 872 transitions. [2025-03-08 16:45:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 16:45:30,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:30,449 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:30,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 16:45:30,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-03-08 16:45:30,649 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash -229831331, now seen corresponding path program 1 times [2025-03-08 16:45:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008958924] [2025-03-08 16:45:30,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:30,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 16:45:30,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 16:45:30,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:30,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:31,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:31,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008958924] [2025-03-08 16:45:31,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008958924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:31,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:45:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70595207] [2025-03-08 16:45:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:31,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:45:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:31,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:45:31,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:45:31,314 INFO L87 Difference]: Start difference. First operand 785 states and 872 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:31,743 INFO L93 Difference]: Finished difference Result 866 states and 959 transitions. [2025-03-08 16:45:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:45:31,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 204 [2025-03-08 16:45:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:31,746 INFO L225 Difference]: With dead ends: 866 [2025-03-08 16:45:31,746 INFO L226 Difference]: Without dead ends: 864 [2025-03-08 16:45:31,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:45:31,746 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 160 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:31,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1522 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:45:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-08 16:45:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 814. [2025-03-08 16:45:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 734 states have (on average 1.0885558583106267) internal successors, (799), 737 states have internal predecessors, (799), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:45:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 903 transitions. [2025-03-08 16:45:31,845 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 903 transitions. Word has length 204 [2025-03-08 16:45:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:31,845 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 903 transitions. [2025-03-08 16:45:31,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 903 transitions. [2025-03-08 16:45:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 16:45:31,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:31,846 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:31,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 16:45:31,846 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:31,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash 657672350, now seen corresponding path program 1 times [2025-03-08 16:45:31,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:31,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385431970] [2025-03-08 16:45:31,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:31,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 16:45:31,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 16:45:31,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:31,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 16:45:32,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:32,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385431970] [2025-03-08 16:45:32,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385431970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:45:32,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:45:32,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:45:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356863956] [2025-03-08 16:45:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:45:32,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:45:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:32,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:45:32,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:45:32,026 INFO L87 Difference]: Start difference. First operand 814 states and 903 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:32,155 INFO L93 Difference]: Finished difference Result 1560 states and 1731 transitions. [2025-03-08 16:45:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:45:32,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 204 [2025-03-08 16:45:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:32,158 INFO L225 Difference]: With dead ends: 1560 [2025-03-08 16:45:32,158 INFO L226 Difference]: Without dead ends: 816 [2025-03-08 16:45:32,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:45:32,159 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 40 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:32,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 591 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:45:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-08 16:45:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 814. [2025-03-08 16:45:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 734 states have (on average 1.0844686648501363) internal successors, (796), 737 states have internal predecessors, (796), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:45:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 900 transitions. [2025-03-08 16:45:32,339 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 900 transitions. Word has length 204 [2025-03-08 16:45:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:32,340 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 900 transitions. [2025-03-08 16:45:32,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 16:45:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 900 transitions. [2025-03-08 16:45:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 16:45:32,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:32,341 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:32,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-08 16:45:32,342 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:32,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash 281250141, now seen corresponding path program 1 times [2025-03-08 16:45:32,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058082908] [2025-03-08 16:45:32,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:32,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 16:45:32,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 16:45:32,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:32,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:32,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058082908] [2025-03-08 16:45:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058082908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:45:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478579045] [2025-03-08 16:45:32,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:32,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:32,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:45:32,767 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:45:32,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 16:45:32,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 16:45:33,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 16:45:33,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:33,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:33,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:45:33,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:45:33,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:45:33,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-08 16:45:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 493 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-08 16:45:33,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:45:33,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-08 16:45:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:33,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478579045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:45:33,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:45:33,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 16 [2025-03-08 16:45:33,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791925489] [2025-03-08 16:45:33,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:45:33,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:45:33,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:33,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:45:33,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:45:33,507 INFO L87 Difference]: Start difference. First operand 814 states and 900 transitions. Second operand has 16 states, 13 states have (on average 8.307692307692308) internal successors, (108), 16 states have internal predecessors, (108), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-08 16:45:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:33,862 INFO L93 Difference]: Finished difference Result 1350 states and 1494 transitions. [2025-03-08 16:45:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:45:33,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.307692307692308) internal successors, (108), 16 states have internal predecessors, (108), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) Word has length 204 [2025-03-08 16:45:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:33,865 INFO L225 Difference]: With dead ends: 1350 [2025-03-08 16:45:33,865 INFO L226 Difference]: Without dead ends: 606 [2025-03-08 16:45:33,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-03-08 16:45:33,867 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 284 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:33,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 935 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:45:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-08 16:45:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 538. [2025-03-08 16:45:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 478 states have (on average 1.0878661087866108) internal successors, (520), 479 states have internal predecessors, (520), 38 states have call successors, (38), 21 states have call predecessors, (38), 21 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:45:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 596 transitions. [2025-03-08 16:45:33,944 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 596 transitions. Word has length 204 [2025-03-08 16:45:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:33,944 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 596 transitions. [2025-03-08 16:45:33,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.307692307692308) internal successors, (108), 16 states have internal predecessors, (108), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-08 16:45:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 596 transitions. [2025-03-08 16:45:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 16:45:33,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:45:33,945 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:33,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 16:45:34,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-03-08 16:45:34,146 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:45:34,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:45:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash 588323007, now seen corresponding path program 1 times [2025-03-08 16:45:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:45:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184178807] [2025-03-08 16:45:34,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:45:34,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 16:45:34,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 16:45:34,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:34,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:34,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:45:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184178807] [2025-03-08 16:45:34,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184178807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:45:34,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825209865] [2025-03-08 16:45:34,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:45:34,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:34,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:45:34,411 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:45:34,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 16:45:34,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 16:45:34,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 16:45:34,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:45:34,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:45:34,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 16:45:34,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:45:34,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:45:34,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-08 16:45:34,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 16:45:34,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 16:45:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 17 proven. 411 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-03-08 16:45:34,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:45:35,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-08 16:45:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 16:45:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825209865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:45:35,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:45:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15 [2025-03-08 16:45:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216912003] [2025-03-08 16:45:35,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:45:35,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:45:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:45:35,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:45:35,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:45:35,170 INFO L87 Difference]: Start difference. First operand 538 states and 596 transitions. Second operand has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 15 states have internal predecessors, (126), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-08 16:45:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:45:35,903 INFO L93 Difference]: Finished difference Result 1040 states and 1152 transitions. [2025-03-08 16:45:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 16:45:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 15 states have internal predecessors, (126), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) Word has length 204 [2025-03-08 16:45:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:45:35,905 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 16:45:35,905 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 16:45:35,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=316, Invalid=1016, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 16:45:35,906 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 397 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:45:35,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1245 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:45:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 16:45:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 16:45:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-08 16:45:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 16:45:35,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2025-03-08 16:45:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:45:35,908 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 16:45:35,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 15 states have internal predecessors, (126), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-08 16:45:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 16:45:35,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 16:45:35,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:45:35,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 16:45:36,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:45:36,113 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-08 16:45:36,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.