./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.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 d023369b57015b0448fa000adefc11450489c47a7d6ec713392eb13d9ca97ac2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:21:18,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:21:18,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:21:18,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:21:18,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:21:18,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:21:18,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:21:18,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:21:18,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:21:18,898 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:21:18,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:21:18,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:21:18,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:21:18,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:21:18,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:21:18,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:21:18,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:21:18,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:21:18,900 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 -> d023369b57015b0448fa000adefc11450489c47a7d6ec713392eb13d9ca97ac2 [2025-03-04 01:21:19,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:21:19,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:21:19,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:21:19,139 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:21:19,139 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:21:19,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i [2025-03-04 01:21:20,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bc9786b/610b016393074a1484480d044d86b4c7/FLAGc053cb1df [2025-03-04 01:21:20,566 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:21:20,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i [2025-03-04 01:21:20,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bc9786b/610b016393074a1484480d044d86b4c7/FLAGc053cb1df [2025-03-04 01:21:20,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bc9786b/610b016393074a1484480d044d86b4c7 [2025-03-04 01:21:20,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:21:20,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:21:20,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:21:20,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:21:20,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:21:20,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c71521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20, skipping insertion in model container [2025-03-04 01:21:20,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:21:20,731 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-ap_file-76.i[917,930] [2025-03-04 01:21:20,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:21:20,786 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:21:20,795 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-ap_file-76.i[917,930] [2025-03-04 01:21:20,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:21:20,843 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:21:20,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20 WrapperNode [2025-03-04 01:21:20,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:21:20,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:21:20,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:21:20,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:21:20,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,885 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 427 [2025-03-04 01:21:20,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:21:20,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:21:20,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:21:20,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:21:20,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,911 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 40, 15, 38, 6, 6]. 37 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 2, 6, 1, 1]. [2025-03-04 01:21:20,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:21:20,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:21:20,928 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:21:20,928 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:21:20,929 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (1/1) ... [2025-03-04 01:21:20,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:21:20,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:21:20,959 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-04 01:21:20,964 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-04 01:21:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:21:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:21:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:21:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:21:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:21:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:21:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:21:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:21:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:21:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:21:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:21:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:21:20,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:21:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:21:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:21:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:21:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:21:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:21:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:21:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:21:20,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:21:21,107 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:21:21,108 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:21:21,430 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~ite66#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem65#1;havoc property_#t~mem64#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~ite75#1;havoc property_#t~mem69#1;havoc property_#t~ite74#1;havoc property_#t~mem73#1;havoc property_#t~mem70#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~short76#1;havoc property_#t~mem77#1;havoc property_#t~ite93#1;havoc property_#t~mem83#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short94#1;havoc property_#t~mem95#1;havoc property_#t~ite108#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short101#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1; [2025-03-04 01:21:21,464 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-03-04 01:21:21,464 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:21:21,474 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:21:21,475 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:21:21,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:21:21 BoogieIcfgContainer [2025-03-04 01:21:21,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:21:21,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:21:21,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:21:21,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:21:21,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:21:20" (1/3) ... [2025-03-04 01:21:21,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c72b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:21:21, skipping insertion in model container [2025-03-04 01:21:21,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:21:20" (2/3) ... [2025-03-04 01:21:21,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c72b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:21:21, skipping insertion in model container [2025-03-04 01:21:21,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:21:21" (3/3) ... [2025-03-04 01:21:21,483 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-76.i [2025-03-04 01:21:21,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:21:21,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-76.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:21:21,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:21:21,548 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;@7ea9ca40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:21:21,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:21:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:21:21,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:21,561 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:21,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:21,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash -969698127, now seen corresponding path program 1 times [2025-03-04 01:21:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:21,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242976039] [2025-03-04 01:21:21,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:21,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:21:21,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:21:21,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:21,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:21:21,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:21,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242976039] [2025-03-04 01:21:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242976039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:21:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517783140] [2025-03-04 01:21:21,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:21:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:21:21,812 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-04 01:21:21,815 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-04 01:21:21,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:21:21,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:21:21,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:21,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:21,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:21:21,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:21:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:21:22,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:21:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517783140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:22,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:21:22,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:21:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546451582] [2025-03-04 01:21:22,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:22,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:21:22,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:22,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:21:22,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:21:22,042 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:21:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:22,058 INFO L93 Difference]: Finished difference Result 192 states and 298 transitions. [2025-03-04 01:21:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:21:22,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-03-04 01:21:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:22,064 INFO L225 Difference]: With dead ends: 192 [2025-03-04 01:21:22,064 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 01:21:22,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-04 01:21:22,068 INFO L435 NwaCegarLoop]: 133 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, 133 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-04 01:21:22,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:21:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 01:21:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 01:21:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2025-03-04 01:21:22,098 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2025-03-04 01:21:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:22,098 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2025-03-04 01:21:22,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:21:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2025-03-04 01:21:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:21:22,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:22,101 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:22,108 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-04 01:21:22,305 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-04 01:21:22,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:22,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:22,306 INFO L85 PathProgramCache]: Analyzing trace with hash 907459641, now seen corresponding path program 1 times [2025-03-04 01:21:22,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:22,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649592844] [2025-03-04 01:21:22,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:22,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:22,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:21:22,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:21:22,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:22,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:22,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:22,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649592844] [2025-03-04 01:21:22,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649592844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:22,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:22,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:21:22,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510518537] [2025-03-04 01:21:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:22,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:21:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:22,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:21:22,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:21:22,581 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:22,609 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2025-03-04 01:21:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:21:22,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-03-04 01:21:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:22,611 INFO L225 Difference]: With dead ends: 185 [2025-03-04 01:21:22,611 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 01:21:22,611 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-04 01:21:22,612 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:22,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:21:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 01:21:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 01:21:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2025-03-04 01:21:22,619 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 119 [2025-03-04 01:21:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:22,620 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2025-03-04 01:21:22,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2025-03-04 01:21:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:21:22,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:22,622 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:22,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:21:22,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:22,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash 498635416, now seen corresponding path program 1 times [2025-03-04 01:21:22,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:22,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39752059] [2025-03-04 01:21:22,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:22,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:22,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:21:22,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:21:22,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:22,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:22,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:22,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39752059] [2025-03-04 01:21:22,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39752059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:22,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:22,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:21:22,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591786411] [2025-03-04 01:21:22,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:22,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:21:22,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:22,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:21:22,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:21:22,778 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:22,796 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2025-03-04 01:21:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:21:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-03-04 01:21:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:22,802 INFO L225 Difference]: With dead ends: 185 [2025-03-04 01:21:22,802 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 01:21:22,803 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-04 01:21:22,805 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:22,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:21:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 01:21:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 01:21:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2025-03-04 01:21:22,817 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 119 [2025-03-04 01:21:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:22,818 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2025-03-04 01:21:22,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2025-03-04 01:21:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:21:22,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:22,819 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:22,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:21:22,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:22,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1859840926, now seen corresponding path program 1 times [2025-03-04 01:21:22,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:22,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914803183] [2025-03-04 01:21:22,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:22,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:21:22,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:21:22,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:22,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914803183] [2025-03-04 01:21:23,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914803183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:23,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:23,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:21:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232861979] [2025-03-04 01:21:23,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:23,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:21:23,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:23,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:21:23,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:21:23,856 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:24,050 INFO L93 Difference]: Finished difference Result 187 states and 261 transitions. [2025-03-04 01:21:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:21:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2025-03-04 01:21:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:24,053 INFO L225 Difference]: With dead ends: 187 [2025-03-04 01:21:24,053 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 01:21:24,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:21:24,054 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 198 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:24,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 414 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:21:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 01:21:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-03-04 01:21:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2025-03-04 01:21:24,062 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 120 [2025-03-04 01:21:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:24,062 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2025-03-04 01:21:24,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2025-03-04 01:21:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:21:24,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:24,063 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:24,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:21:24,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:24,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1323394649, now seen corresponding path program 1 times [2025-03-04 01:21:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:24,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149518467] [2025-03-04 01:21:24,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:24,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:21:24,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:21:24,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:24,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:21:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149518467] [2025-03-04 01:21:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149518467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:21:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380843515] [2025-03-04 01:21:24,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:24,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:21:24,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:21:24,269 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-04 01:21:24,271 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-04 01:21:24,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:21:24,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:21:24,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:24,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:24,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:21:24,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:21:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:24,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:21:24,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380843515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:24,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:21:24,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:21:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811744313] [2025-03-04 01:21:24,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:24,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:21:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:24,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:21:24,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:21:24,475 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:24,505 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2025-03-04 01:21:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:21:24,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-04 01:21:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:24,507 INFO L225 Difference]: With dead ends: 188 [2025-03-04 01:21:24,507 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 01:21:24,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:21:24,507 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:24,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 492 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:21:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 01:21:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 01:21:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2025-03-04 01:21:24,518 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 122 [2025-03-04 01:21:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:24,519 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2025-03-04 01:21:24,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2025-03-04 01:21:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:21:24,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:24,521 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:24,528 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-04 01:21:24,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:21:24,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:24,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash -346145633, now seen corresponding path program 1 times [2025-03-04 01:21:24,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:24,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138573182] [2025-03-04 01:21:24,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:24,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:24,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:21:24,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:21:24,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:24,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:21:24,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:24,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138573182] [2025-03-04 01:21:24,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138573182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:21:24,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70138759] [2025-03-04 01:21:24,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:24,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:21:24,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:21:24,903 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-04 01:21:24,905 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-04 01:21:25,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:21:25,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:21:25,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:25,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:25,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:21:25,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:21:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:25,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:21:25,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70138759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:25,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:21:25,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-04 01:21:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957953037] [2025-03-04 01:21:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:25,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:21:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:25,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:21:25,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:21:25,089 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:25,130 INFO L93 Difference]: Finished difference Result 195 states and 268 transitions. [2025-03-04 01:21:25,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:21:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-04 01:21:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:25,131 INFO L225 Difference]: With dead ends: 195 [2025-03-04 01:21:25,131 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:21:25,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:21:25,134 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:25,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 610 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:21:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:21:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2025-03-04 01:21:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2025-03-04 01:21:25,147 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 124 [2025-03-04 01:21:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:25,147 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2025-03-04 01:21:25,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2025-03-04 01:21:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:21:25,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:25,148 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:25,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:21:25,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:21:25,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:25,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash 821934077, now seen corresponding path program 1 times [2025-03-04 01:21:25,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:25,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722538772] [2025-03-04 01:21:25,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:25,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:21:25,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:21:25,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:25,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:25,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:25,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722538772] [2025-03-04 01:21:25,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722538772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:25,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:25,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:21:25,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979838818] [2025-03-04 01:21:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:25,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:21:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:25,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:21:25,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:21:25,806 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:25,982 INFO L93 Difference]: Finished difference Result 232 states and 317 transitions. [2025-03-04 01:21:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:21:25,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-04 01:21:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:25,984 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:21:25,984 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 01:21:25,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:21:25,985 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 178 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:25,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 434 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:21:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 01:21:25,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2025-03-04 01:21:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 151 transitions. [2025-03-04 01:21:25,992 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 151 transitions. Word has length 126 [2025-03-04 01:21:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:25,992 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 151 transitions. [2025-03-04 01:21:25,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2025-03-04 01:21:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:21:25,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:25,993 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:21:25,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:25,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash 278633230, now seen corresponding path program 1 times [2025-03-04 01:21:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887501055] [2025-03-04 01:21:25,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:25,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:26,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:21:26,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:21:26,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:26,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:26,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887501055] [2025-03-04 01:21:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887501055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:26,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:21:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882206462] [2025-03-04 01:21:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:26,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:21:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:26,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:21:26,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:21:26,117 INFO L87 Difference]: Start difference. First operand 110 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:26,152 INFO L93 Difference]: Finished difference Result 217 states and 299 transitions. [2025-03-04 01:21:26,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:21:26,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-04 01:21:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:26,155 INFO L225 Difference]: With dead ends: 217 [2025-03-04 01:21:26,155 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:21:26,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:21:26,156 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:26,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:21:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:21:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 01:21:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2025-03-04 01:21:26,167 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 126 [2025-03-04 01:21:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:26,167 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2025-03-04 01:21:26,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2025-03-04 01:21:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:21:26,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:26,168 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:26,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:21:26,168 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:26,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1028082555, now seen corresponding path program 1 times [2025-03-04 01:21:26,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:26,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89104277] [2025-03-04 01:21:26,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:26,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:26,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:21:26,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:21:26,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:26,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:26,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:26,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89104277] [2025-03-04 01:21:26,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89104277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:26,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:26,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:21:26,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300101410] [2025-03-04 01:21:26,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:26,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:21:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:26,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:21:26,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:21:26,310 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:26,392 INFO L93 Difference]: Finished difference Result 219 states and 297 transitions. [2025-03-04 01:21:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:21:26,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-03-04 01:21:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:26,394 INFO L225 Difference]: With dead ends: 219 [2025-03-04 01:21:26,395 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:21:26,395 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-04 01:21:26,396 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 11 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:26,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 452 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:21:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:21:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-04 01:21:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 93 states have internal predecessors, (118), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2025-03-04 01:21:26,407 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 128 [2025-03-04 01:21:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:26,410 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2025-03-04 01:21:26,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2025-03-04 01:21:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:21:26,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:26,411 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:26,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:21:26,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:26,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:26,412 INFO L85 PathProgramCache]: Analyzing trace with hash -627581356, now seen corresponding path program 1 times [2025-03-04 01:21:26,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:26,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452837826] [2025-03-04 01:21:26,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:26,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:26,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:21:26,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:21:26,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:26,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:27,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:27,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452837826] [2025-03-04 01:21:27,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452837826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:27,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:27,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:21:27,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791968913] [2025-03-04 01:21:27,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:27,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:21:27,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:27,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:21:27,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:21:27,450 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:21:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:27,790 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2025-03-04 01:21:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:21:27,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-03-04 01:21:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:27,792 INFO L225 Difference]: With dead ends: 302 [2025-03-04 01:21:27,792 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 01:21:27,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:21:27,793 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 347 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:27,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 776 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:21:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 01:21:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2025-03-04 01:21:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 170 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:21:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 257 transitions. [2025-03-04 01:21:27,811 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 257 transitions. Word has length 128 [2025-03-04 01:21:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:27,811 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 257 transitions. [2025-03-04 01:21:27,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:21:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 257 transitions. [2025-03-04 01:21:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:21:27,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:27,813 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:27,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:21:27,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:27,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash -66151289, now seen corresponding path program 1 times [2025-03-04 01:21:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127131374] [2025-03-04 01:21:27,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:27,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:21:27,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:21:27,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127131374] [2025-03-04 01:21:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127131374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:28,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:28,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:21:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260559612] [2025-03-04 01:21:28,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:28,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:21:28,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:28,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:21:28,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:21:28,072 INFO L87 Difference]: Start difference. First operand 192 states and 257 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:21:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:28,285 INFO L93 Difference]: Finished difference Result 388 states and 516 transitions. [2025-03-04 01:21:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:21:28,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-03-04 01:21:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:28,286 INFO L225 Difference]: With dead ends: 388 [2025-03-04 01:21:28,286 INFO L226 Difference]: Without dead ends: 199 [2025-03-04 01:21:28,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:21:28,287 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 332 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:28,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 535 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:21:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-04 01:21:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 159. [2025-03-04 01:21:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 208 transitions. [2025-03-04 01:21:28,300 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 208 transitions. Word has length 129 [2025-03-04 01:21:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:28,300 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 208 transitions. [2025-03-04 01:21:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:21:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2025-03-04 01:21:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:21:28,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:28,302 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:28,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:21:28,302 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:28,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1616618887, now seen corresponding path program 1 times [2025-03-04 01:21:28,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:28,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886601227] [2025-03-04 01:21:28,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:28,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:21:28,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:21:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:28,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:28,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886601227] [2025-03-04 01:21:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886601227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:28,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:21:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872764089] [2025-03-04 01:21:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:28,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:21:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:28,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:21:28,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:21:28,581 INFO L87 Difference]: Start difference. First operand 159 states and 208 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:28,809 INFO L93 Difference]: Finished difference Result 366 states and 473 transitions. [2025-03-04 01:21:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:21:28,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-04 01:21:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:28,810 INFO L225 Difference]: With dead ends: 366 [2025-03-04 01:21:28,810 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 01:21:28,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:21:28,811 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 151 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:28,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 543 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:21:28,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 01:21:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 161. [2025-03-04 01:21:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 143 states have internal predecessors, (178), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 208 transitions. [2025-03-04 01:21:28,823 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 208 transitions. Word has length 130 [2025-03-04 01:21:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:28,824 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 208 transitions. [2025-03-04 01:21:28,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 208 transitions. [2025-03-04 01:21:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:21:28,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:28,825 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:28,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:21:28,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:28,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1915968873, now seen corresponding path program 1 times [2025-03-04 01:21:28,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:28,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148914004] [2025-03-04 01:21:28,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:28,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:28,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:21:28,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:21:28,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:28,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:29,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148914004] [2025-03-04 01:21:29,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148914004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:29,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:29,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:21:29,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898073060] [2025-03-04 01:21:29,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:29,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:21:29,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:29,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:21:29,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:21:29,198 INFO L87 Difference]: Start difference. First operand 161 states and 208 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:29,368 INFO L93 Difference]: Finished difference Result 216 states and 270 transitions. [2025-03-04 01:21:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:21:29,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-04 01:21:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:29,370 INFO L225 Difference]: With dead ends: 216 [2025-03-04 01:21:29,370 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:21:29,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:21:29,371 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:29,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 620 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:21:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:21:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200. [2025-03-04 01:21:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 182 states have (on average 1.2142857142857142) internal successors, (221), 182 states have internal predecessors, (221), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 251 transitions. [2025-03-04 01:21:29,385 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 251 transitions. Word has length 130 [2025-03-04 01:21:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:29,385 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 251 transitions. [2025-03-04 01:21:29,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 251 transitions. [2025-03-04 01:21:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:21:29,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:29,386 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:29,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:21:29,387 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:29,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1002248265, now seen corresponding path program 1 times [2025-03-04 01:21:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981538144] [2025-03-04 01:21:29,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:29,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:21:29,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:21:29,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:29,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:29,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:29,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981538144] [2025-03-04 01:21:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981538144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:29,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:29,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:21:29,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623113271] [2025-03-04 01:21:29,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:29,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:21:29,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:29,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:21:29,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:21:29,573 INFO L87 Difference]: Start difference. First operand 200 states and 251 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:21:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:29,786 INFO L93 Difference]: Finished difference Result 438 states and 553 transitions. [2025-03-04 01:21:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:21:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-04 01:21:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:29,788 INFO L225 Difference]: With dead ends: 438 [2025-03-04 01:21:29,788 INFO L226 Difference]: Without dead ends: 241 [2025-03-04 01:21:29,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:21:29,789 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 212 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:29,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 457 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:21:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-04 01:21:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 200. [2025-03-04 01:21:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 182 states have (on average 1.2032967032967032) internal successors, (219), 182 states have internal predecessors, (219), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 249 transitions. [2025-03-04 01:21:29,807 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 249 transitions. Word has length 130 [2025-03-04 01:21:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:29,809 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 249 transitions. [2025-03-04 01:21:29,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:21:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 249 transitions. [2025-03-04 01:21:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:21:29,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:29,811 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:29,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:21:29,811 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:29,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1661134122, now seen corresponding path program 1 times [2025-03-04 01:21:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514739561] [2025-03-04 01:21:29,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:29,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:21:29,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:21:29,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:29,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:30,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514739561] [2025-03-04 01:21:30,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514739561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:30,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:30,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:21:30,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15598418] [2025-03-04 01:21:30,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:30,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:21:30,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:30,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:21:30,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:21:30,055 INFO L87 Difference]: Start difference. First operand 200 states and 249 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:30,318 INFO L93 Difference]: Finished difference Result 514 states and 642 transitions. [2025-03-04 01:21:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:21:30,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-04 01:21:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:30,320 INFO L225 Difference]: With dead ends: 514 [2025-03-04 01:21:30,320 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 01:21:30,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:21:30,321 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 151 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:30,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1211 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:21:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 01:21:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 258. [2025-03-04 01:21:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 240 states have (on average 1.2083333333333333) internal successors, (290), 240 states have internal predecessors, (290), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 320 transitions. [2025-03-04 01:21:30,345 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 320 transitions. Word has length 131 [2025-03-04 01:21:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:30,345 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 320 transitions. [2025-03-04 01:21:30,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 320 transitions. [2025-03-04 01:21:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:21:30,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:30,347 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:30,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:21:30,347 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:30,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1406397577, now seen corresponding path program 1 times [2025-03-04 01:21:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:30,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314868006] [2025-03-04 01:21:30,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:30,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:30,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:21:30,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:21:30,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:30,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:30,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314868006] [2025-03-04 01:21:30,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314868006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:30,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:21:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363405099] [2025-03-04 01:21:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:30,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:21:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:30,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:21:30,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:21:30,493 INFO L87 Difference]: Start difference. First operand 258 states and 320 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:30,579 INFO L93 Difference]: Finished difference Result 536 states and 665 transitions. [2025-03-04 01:21:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:21:30,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-04 01:21:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:30,581 INFO L225 Difference]: With dead ends: 536 [2025-03-04 01:21:30,581 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 01:21:30,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-04 01:21:30,581 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 26 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:30,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 443 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:21:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 01:21:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 226. [2025-03-04 01:21:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 208 states have (on average 1.2067307692307692) internal successors, (251), 208 states have internal predecessors, (251), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 281 transitions. [2025-03-04 01:21:30,604 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 281 transitions. Word has length 131 [2025-03-04 01:21:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:30,604 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 281 transitions. [2025-03-04 01:21:30,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 281 transitions. [2025-03-04 01:21:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:21:30,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:30,606 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:30,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:21:30,606 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:30,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:30,606 INFO L85 PathProgramCache]: Analyzing trace with hash 164151671, now seen corresponding path program 1 times [2025-03-04 01:21:30,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:30,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210052926] [2025-03-04 01:21:30,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:30,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:30,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:21:30,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:21:30,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:30,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:30,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210052926] [2025-03-04 01:21:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210052926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:30,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:30,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:21:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587873666] [2025-03-04 01:21:30,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:30,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:21:30,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:30,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:21:30,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:21:30,753 INFO L87 Difference]: Start difference. First operand 226 states and 281 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:30,814 INFO L93 Difference]: Finished difference Result 472 states and 587 transitions. [2025-03-04 01:21:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:21:30,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-04 01:21:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:30,815 INFO L225 Difference]: With dead ends: 472 [2025-03-04 01:21:30,815 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 01:21:30,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:21:30,816 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:30,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:21:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 01:21:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 234. [2025-03-04 01:21:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 216 states have (on average 1.1990740740740742) internal successors, (259), 216 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:21:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 289 transitions. [2025-03-04 01:21:30,835 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 289 transitions. Word has length 132 [2025-03-04 01:21:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:30,835 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 289 transitions. [2025-03-04 01:21:30,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 289 transitions. [2025-03-04 01:21:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:21:30,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:30,837 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:30,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:21:30,838 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:30,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:30,838 INFO L85 PathProgramCache]: Analyzing trace with hash -244672554, now seen corresponding path program 1 times [2025-03-04 01:21:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102006051] [2025-03-04 01:21:30,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:30,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:21:30,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:21:30,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:30,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:21:31,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102006051] [2025-03-04 01:21:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102006051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:21:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227493858] [2025-03-04 01:21:31,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:31,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:21:31,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:21:31,228 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-04 01:21:31,229 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-04 01:21:31,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:21:31,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:21:31,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:31,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 01:21:31,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:21:31,672 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-04 01:21:32,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:21:32,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2025-03-04 01:21:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 177 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-04 01:21:33,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:21:33,300 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 31 treesize of output 27 [2025-03-04 01:21:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:21:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227493858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:21:33,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:21:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-03-04 01:21:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402411171] [2025-03-04 01:21:33,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:21:33,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 01:21:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:33,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 01:21:33,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:21:33,347 INFO L87 Difference]: Start difference. First operand 234 states and 289 transitions. Second operand has 25 states, 22 states have (on average 6.863636363636363) internal successors, (151), 24 states have internal predecessors, (151), 11 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 8 states have call predecessors, (45), 11 states have call successors, (45) [2025-03-04 01:21:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:34,467 INFO L93 Difference]: Finished difference Result 455 states and 557 transitions. [2025-03-04 01:21:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 01:21:34,467 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.863636363636363) internal successors, (151), 24 states have internal predecessors, (151), 11 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 8 states have call predecessors, (45), 11 states have call successors, (45) Word has length 132 [2025-03-04 01:21:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:34,469 INFO L225 Difference]: With dead ends: 455 [2025-03-04 01:21:34,469 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 01:21:34,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=543, Invalid=1809, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 01:21:34,471 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 338 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 109 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:34,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 832 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 817 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:21:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 01:21:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 184. [2025-03-04 01:21:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 157 states have (on average 1.1146496815286624) internal successors, (175), 158 states have internal predecessors, (175), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:21:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 215 transitions. [2025-03-04 01:21:34,490 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 215 transitions. Word has length 132 [2025-03-04 01:21:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:34,490 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 215 transitions. [2025-03-04 01:21:34,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.863636363636363) internal successors, (151), 24 states have internal predecessors, (151), 11 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 8 states have call predecessors, (45), 11 states have call successors, (45) [2025-03-04 01:21:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 215 transitions. [2025-03-04 01:21:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:21:34,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:34,492 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:34,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:21:34,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 01:21:34,692 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:34,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:34,693 INFO L85 PathProgramCache]: Analyzing trace with hash -525605657, now seen corresponding path program 1 times [2025-03-04 01:21:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:34,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569801560] [2025-03-04 01:21:34,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:34,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:21:34,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:21:34,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:34,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:34,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:34,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569801560] [2025-03-04 01:21:34,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569801560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:34,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:34,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:21:34,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183185735] [2025-03-04 01:21:34,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:34,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:21:34,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:34,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:21:34,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:21:34,800 INFO L87 Difference]: Start difference. First operand 184 states and 215 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:34,852 INFO L93 Difference]: Finished difference Result 300 states and 353 transitions. [2025-03-04 01:21:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:21:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-04 01:21:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:34,854 INFO L225 Difference]: With dead ends: 300 [2025-03-04 01:21:34,854 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 01:21:34,854 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-04 01:21:34,855 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:34,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 390 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:21:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 01:21:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-04 01:21:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 116 states have (on average 1.1120689655172413) internal successors, (129), 117 states have internal predecessors, (129), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:21:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2025-03-04 01:21:34,876 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 132 [2025-03-04 01:21:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:34,877 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2025-03-04 01:21:34,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2025-03-04 01:21:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:21:34,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:21:34,878 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:21:34,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:21:34,878 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:21:34,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:21:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1701993565, now seen corresponding path program 1 times [2025-03-04 01:21:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:21:34,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221600050] [2025-03-04 01:21:34,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:21:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:21:34,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:21:34,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:21:34,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:21:34,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:21:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:21:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:21:35,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221600050] [2025-03-04 01:21:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221600050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:21:35,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:21:35,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:21:35,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513780761] [2025-03-04 01:21:35,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:21:35,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:21:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:21:35,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:21:35,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:21:35,018 INFO L87 Difference]: Start difference. First operand 143 states and 169 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:21:35,069 INFO L93 Difference]: Finished difference Result 248 states and 291 transitions. [2025-03-04 01:21:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:21:35,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-03-04 01:21:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:21:35,070 INFO L225 Difference]: With dead ends: 248 [2025-03-04 01:21:35,070 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:21:35,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-04 01:21:35,071 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 22 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:21:35,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 255 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:21:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:21:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:21:35,071 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-04 01:21:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:21:35,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2025-03-04 01:21:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:21:35,072 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:21:35,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:21:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:21:35,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:21:35,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:21:35,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:21:35,078 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] [2025-03-04 01:21:35,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 01:21:39,245 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:21:39,251 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base [2025-03-04 01:21:39,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base [2025-03-04 01:21:39,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base [2025-03-04 01:21:39,253 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!base [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!offset [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!base [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:21:39,254 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:21:39,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base,GLOBAL]]] [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!base [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset [2025-03-04 01:21:39,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!offset [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-03-04 01:21:39,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!base [2025-03-04 01:21:39,258 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!offset [2025-03-04 01:21:39,258 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset [2025-03-04 01:21:39,258 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-03-04 01:21:39,258 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base [2025-03-04 01:21:39,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:21:39 BoogieIcfgContainer [2025-03-04 01:21:39,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:21:39,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:21:39,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:21:39,259 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:21:39,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:21:21" (3/4) ... [2025-03-04 01:21:39,261 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 01:21:39,266 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 01:21:39,271 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 01:21:39,272 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 01:21:39,272 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 01:21:39,272 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 01:21:39,367 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 01:21:39,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 01:21:39,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:21:39,369 INFO L158 Benchmark]: Toolchain (without parser) took 18766.76ms. Allocated memory was 201.3MB in the beginning and 662.7MB in the end (delta: 461.4MB). Free memory was 159.1MB in the beginning and 363.6MB in the end (delta: -204.5MB). Peak memory consumption was 254.9MB. Max. memory is 16.1GB. [2025-03-04 01:21:39,369 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:21:39,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.36ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 144.2MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:21:39,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.81ms. Allocated memory is still 201.3MB. Free memory was 144.2MB in the beginning and 141.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:21:39,371 INFO L158 Benchmark]: Boogie Preprocessor took 38.60ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 137.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:21:39,372 INFO L158 Benchmark]: IcfgBuilder took 547.71ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 107.1MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:21:39,372 INFO L158 Benchmark]: TraceAbstraction took 17781.28ms. Allocated memory was 201.3MB in the beginning and 662.7MB in the end (delta: 461.4MB). Free memory was 106.5MB in the beginning and 372.2MB in the end (delta: -265.6MB). Peak memory consumption was 256.7MB. Max. memory is 16.1GB. [2025-03-04 01:21:39,372 INFO L158 Benchmark]: Witness Printer took 110.26ms. Allocated memory is still 662.7MB. Free memory was 372.2MB in the beginning and 363.6MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:21:39,373 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.36ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 144.2MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.81ms. Allocated memory is still 201.3MB. Free memory was 144.2MB in the beginning and 141.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.60ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 137.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 547.71ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 107.1MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17781.28ms. Allocated memory was 201.3MB in the beginning and 662.7MB in the end (delta: 461.4MB). Free memory was 106.5MB in the beginning and 372.2MB in the end (delta: -265.6MB). Peak memory consumption was 256.7MB. Max. memory is 16.1GB. * Witness Printer took 110.26ms. Allocated memory is still 662.7MB. Free memory was 372.2MB in the beginning and 363.6MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2121 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2121 mSDsluCounter, 9820 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7231 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2670 IncrementalHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 2589 mSDtfsCounter, 2670 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 663 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=15, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 348 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 3038 NumberOfCodeBlocks, 3038 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3145 ConstructedInterpolants, 13 QuantifiedInterpolants, 13208 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1891 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 10157/10500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 01:21:39,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE