./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:22:18,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:22:18,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:22:18,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:22:18,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:22:18,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:22:18,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:22:18,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:22:18,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:22:18,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:22:18,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:22:18,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:22:18,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:22:18,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:22:18,767 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:22:18,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:22:18,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:22:18,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:22:18,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:22:18,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:22:18,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:22:18,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:22:18,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:22:18,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:22:18,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:22:18,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:22:18,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:22:18,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:22:18,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:22:18,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:22:18,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:22:18,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:22:18,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:22:18,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:22:18,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:22:18,771 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:22:18,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:22:18,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:22:18,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:22:18,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:22:18,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:22:18,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:22:18,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:22:18,772 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2025-02-06 03:22:19,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:22:19,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:22:19,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:22:19,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:22:19,062 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:22:19,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2025-02-06 03:22:20,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17dc97d2d/3e8fcdb1c07840e78b3ea1a2e039519f/FLAG0b1dd380d [2025-02-06 03:22:20,614 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:22:20,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2025-02-06 03:22:20,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17dc97d2d/3e8fcdb1c07840e78b3ea1a2e039519f/FLAG0b1dd380d [2025-02-06 03:22:20,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17dc97d2d/3e8fcdb1c07840e78b3ea1a2e039519f [2025-02-06 03:22:20,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:22:20,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:22:20,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:22:20,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:22:20,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:22:20,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:20,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eefd90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20, skipping insertion in model container [2025-02-06 03:22:20,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:20,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:22:20,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2025-02-06 03:22:20,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:22:20,884 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:22:20,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2025-02-06 03:22:20,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:22:20,959 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:22:20,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20 WrapperNode [2025-02-06 03:22:20,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:22:20,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:22:20,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:22:20,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:22:20,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:20,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,006 INFO L138 Inliner]: procedures = 29, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 347 [2025-02-06 03:22:21,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:22:21,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:22:21,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:22:21,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:22:21,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,037 INFO L175 MemorySlicer]: Split 86 memory accesses to 6 slices as follows [2, 6, 22, 8, 17, 31]. 36 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 2, 1, 2, 3]. The 13 writes are split as follows [0, 1, 2, 1, 3, 6]. [2025-02-06 03:22:21,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:22:21,059 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:22:21,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:22:21,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:22:21,060 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (1/1) ... [2025-02-06 03:22:21,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:22:21,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:21,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:22:21,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:22:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:22:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:22:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:22:21,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:22:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:22:21,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:22:21,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:22:21,235 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:22:21,237 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:22:21,582 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: havoc property_#t~mem45#1;havoc property_#t~ite63#1;havoc property_#t~mem47#1;havoc property_#t~mem46#1;havoc property_#t~mem48#1;havoc property_#t~mem49#1;havoc property_#t~ite52#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~mem53#1;havoc property_#t~ite62#1;havoc property_#t~mem54#1;havoc property_#t~ite59#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~mem58#1;havoc property_#t~mem57#1;havoc property_#t~mem61#1;havoc property_#t~mem60#1;havoc property_#t~mem64#1;havoc property_#t~bitwise65#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~short72#1;havoc property_#t~mem73#1;havoc property_#t~short74#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~short77#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1; [2025-02-06 03:22:21,627 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-02-06 03:22:21,627 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:22:21,645 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:22:21,645 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:22:21,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:21 BoogieIcfgContainer [2025-02-06 03:22:21,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:22:21,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:22:21,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:22:21,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:22:21,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:22:20" (1/3) ... [2025-02-06 03:22:21,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a75ba54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:22:21, skipping insertion in model container [2025-02-06 03:22:21,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:20" (2/3) ... [2025-02-06 03:22:21,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a75ba54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:22:21, skipping insertion in model container [2025-02-06 03:22:21,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:21" (3/3) ... [2025-02-06 03:22:21,655 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2025-02-06 03:22:21,667 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:22:21,670 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-9.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:22:21,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:22:21,738 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;@4b96a9ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:22:21,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:22:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:21,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:21,752 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:21,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:21,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1849599051, now seen corresponding path program 1 times [2025-02-06 03:22:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:21,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366531945] [2025-02-06 03:22:21,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:21,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:21,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:21,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:21,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 03:22:22,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:22,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366531945] [2025-02-06 03:22:22,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366531945] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:22,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330522954] [2025-02-06 03:22:22,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:22,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:22,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:22:22,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:22:22,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:22,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:22,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:22,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:22,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:22:22,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 03:22:22,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:22,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330522954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:22:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:22:22,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152652646] [2025-02-06 03:22:22,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:22,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:22:22,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:22,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:22:22,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:22:22,310 INFO L87 Difference]: Start difference. First operand has 75 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:22,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:22,333 INFO L93 Difference]: Finished difference Result 144 states and 210 transitions. [2025-02-06 03:22:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:22:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-02-06 03:22:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:22,339 INFO L225 Difference]: With dead ends: 144 [2025-02-06 03:22:22,339 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 03:22:22,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 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-02-06 03:22:22,346 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:22,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 03:22:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-06 03:22:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2025-02-06 03:22:22,389 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 62 [2025-02-06 03:22:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:22,390 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-02-06 03:22:22,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2025-02-06 03:22:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:22,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:22,394 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:22,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:22:22,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:22:22,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:22,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash 472600554, now seen corresponding path program 1 times [2025-02-06 03:22:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:22,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14881185] [2025-02-06 03:22:22,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:22,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:22,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:22,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:22,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:22,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:22,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:22,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14881185] [2025-02-06 03:22:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14881185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:22,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:22:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921160354] [2025-02-06 03:22:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:22,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:22:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:22,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:22:22,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:22:22,904 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:22,954 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2025-02-06 03:22:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:22:22,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 03:22:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:22,958 INFO L225 Difference]: With dead ends: 144 [2025-02-06 03:22:22,958 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 03:22:22,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:22:22,961 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:22,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 03:22:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-02-06 03:22:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2025-02-06 03:22:22,973 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 62 [2025-02-06 03:22:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:22,974 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2025-02-06 03:22:22,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2025-02-06 03:22:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:22,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:22,976 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:22,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:22:22,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:22,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1324350805, now seen corresponding path program 1 times [2025-02-06 03:22:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:22,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287755790] [2025-02-06 03:22:22,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:22,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:22,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:23,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:23,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:23,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 03:22:23,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:23,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287755790] [2025-02-06 03:22:23,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287755790] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:23,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280270232] [2025-02-06 03:22:23,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:23,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:23,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:23,403 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:22:23,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:22:23,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:23,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:23,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:23,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:23,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:22:23,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:23,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:23,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280270232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:23,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:22:23,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-06 03:22:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017268552] [2025-02-06 03:22:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:23,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:22:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:23,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:22:23,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:22:23,633 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:23,682 INFO L93 Difference]: Finished difference Result 148 states and 205 transitions. [2025-02-06 03:22:23,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:22:23,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 03:22:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:23,684 INFO L225 Difference]: With dead ends: 148 [2025-02-06 03:22:23,684 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 03:22:23,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:22:23,686 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:23,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 275 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 03:22:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-02-06 03:22:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2025-02-06 03:22:23,692 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 62 [2025-02-06 03:22:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:23,692 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2025-02-06 03:22:23,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2025-02-06 03:22:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:23,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:23,694 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:23,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:22:23,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:23,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:23,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1163162028, now seen corresponding path program 1 times [2025-02-06 03:22:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:23,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921304876] [2025-02-06 03:22:23,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:23,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:23,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:23,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:23,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:23,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 03:22:24,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:24,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921304876] [2025-02-06 03:22:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921304876] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:24,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034699928] [2025-02-06 03:22:24,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:24,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:24,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:24,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:22:24,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:22:24,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:24,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:24,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:24,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:24,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:22:24,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:24,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034699928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:24,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:22:24,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-06 03:22:24,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994616954] [2025-02-06 03:22:24,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:24,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:22:24,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:24,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:22:24,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:22:24,398 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:24,429 INFO L93 Difference]: Finished difference Result 152 states and 209 transitions. [2025-02-06 03:22:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:22:24,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 03:22:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:24,431 INFO L225 Difference]: With dead ends: 152 [2025-02-06 03:22:24,431 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 03:22:24,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:22:24,435 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:24,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 276 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 03:22:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-02-06 03:22:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2025-02-06 03:22:24,444 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 62 [2025-02-06 03:22:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:24,444 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2025-02-06 03:22:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2025-02-06 03:22:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:24,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:24,449 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:24,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:22:24,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:24,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:24,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1164085549, now seen corresponding path program 1 times [2025-02-06 03:22:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033491099] [2025-02-06 03:22:24,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:24,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:24,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:24,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:24,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:24,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 03:22:24,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:24,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033491099] [2025-02-06 03:22:24,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033491099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:24,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296065929] [2025-02-06 03:22:24,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:24,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:24,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:24,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:22:24,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:22:25,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:25,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:25,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:25,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:25,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:22:25,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:25,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 11 [2025-02-06 03:22:25,407 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 15 treesize of output 7 [2025-02-06 03:22:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:25,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:25,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296065929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:25,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:22:25,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-02-06 03:22:25,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349204764] [2025-02-06 03:22:25,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:25,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:22:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:25,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:22:25,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:22:25,424 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:25,535 INFO L93 Difference]: Finished difference Result 228 states and 312 transitions. [2025-02-06 03:22:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:22:25,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 03:22:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:25,537 INFO L225 Difference]: With dead ends: 228 [2025-02-06 03:22:25,537 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 03:22:25,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:22:25,539 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 71 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:25,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 318 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 03:22:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-02-06 03:22:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 03:22:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 204 transitions. [2025-02-06 03:22:25,558 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 204 transitions. Word has length 62 [2025-02-06 03:22:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:25,559 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 204 transitions. [2025-02-06 03:22:25,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 204 transitions. [2025-02-06 03:22:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 03:22:25,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:25,561 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:25,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:22:25,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:25,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:25,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1097037465, now seen corresponding path program 1 times [2025-02-06 03:22:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574540522] [2025-02-06 03:22:25,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:25,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 03:22:25,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 03:22:25,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:25,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:26,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574540522] [2025-02-06 03:22:26,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574540522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:26,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:26,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:22:26,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644839927] [2025-02-06 03:22:26,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:26,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:22:26,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:26,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:22:26,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:22:26,385 INFO L87 Difference]: Start difference. First operand 149 states and 204 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:26,532 INFO L93 Difference]: Finished difference Result 320 states and 436 transitions. [2025-02-06 03:22:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:22:26,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2025-02-06 03:22:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:26,534 INFO L225 Difference]: With dead ends: 320 [2025-02-06 03:22:26,534 INFO L226 Difference]: Without dead ends: 174 [2025-02-06 03:22:26,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:22:26,535 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 68 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:26,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 437 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-06 03:22:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2025-02-06 03:22:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 156 states have internal predecessors, (206), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:22:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 232 transitions. [2025-02-06 03:22:26,548 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 232 transitions. Word has length 63 [2025-02-06 03:22:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:26,548 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 232 transitions. [2025-02-06 03:22:26,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 232 transitions. [2025-02-06 03:22:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 03:22:26,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:26,550 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:26,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:22:26,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:26,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:26,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2006630123, now seen corresponding path program 1 times [2025-02-06 03:22:26,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:26,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687825395] [2025-02-06 03:22:26,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:26,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:26,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 03:22:26,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 03:22:26,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:26,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:26,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687825395] [2025-02-06 03:22:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687825395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:26,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:26,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:22:26,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119789291] [2025-02-06 03:22:26,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:26,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:22:26,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:26,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:22:26,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:22:26,667 INFO L87 Difference]: Start difference. First operand 173 states and 232 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:26,765 INFO L93 Difference]: Finished difference Result 447 states and 593 transitions. [2025-02-06 03:22:26,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:22:26,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2025-02-06 03:22:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:26,769 INFO L225 Difference]: With dead ends: 447 [2025-02-06 03:22:26,770 INFO L226 Difference]: Without dead ends: 289 [2025-02-06 03:22:26,770 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-02-06 03:22:26,771 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 69 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:26,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 321 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-06 03:22:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 228. [2025-02-06 03:22:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3103448275862069) internal successors, (266), 205 states have internal predecessors, (266), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:22:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 302 transitions. [2025-02-06 03:22:26,800 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 302 transitions. Word has length 67 [2025-02-06 03:22:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:26,801 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 302 transitions. [2025-02-06 03:22:26,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 302 transitions. [2025-02-06 03:22:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 03:22:26,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:26,803 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:26,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:22:26,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:26,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1166006978, now seen corresponding path program 1 times [2025-02-06 03:22:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:26,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111174572] [2025-02-06 03:22:26,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:26,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 03:22:26,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 03:22:26,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:26,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 03:22:27,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:27,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111174572] [2025-02-06 03:22:27,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111174572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:27,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721668075] [2025-02-06 03:22:27,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:27,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:27,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:27,024 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:22:27,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:22:27,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 03:22:27,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 03:22:27,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:27,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:27,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:22:27,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:27,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 11 [2025-02-06 03:22:27,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 03:22:27,383 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 15 treesize of output 7 [2025-02-06 03:22:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:27,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:27,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721668075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:27,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:22:27,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-02-06 03:22:27,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927207280] [2025-02-06 03:22:27,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:27,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:22:27,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:27,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:22:27,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:22:27,395 INFO L87 Difference]: Start difference. First operand 228 states and 302 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:27,498 INFO L93 Difference]: Finished difference Result 445 states and 587 transitions. [2025-02-06 03:22:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:22:27,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2025-02-06 03:22:27,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:27,500 INFO L225 Difference]: With dead ends: 445 [2025-02-06 03:22:27,500 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 03:22:27,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:22:27,501 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 70 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:27,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 318 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 03:22:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2025-02-06 03:22:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3004926108374384) internal successors, (264), 205 states have internal predecessors, (264), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:22:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 300 transitions. [2025-02-06 03:22:27,517 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 300 transitions. Word has length 67 [2025-02-06 03:22:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:27,518 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 300 transitions. [2025-02-06 03:22:27,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2025-02-06 03:22:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 03:22:27,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:27,519 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:27,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:22:27,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:27,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:27,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash -855173085, now seen corresponding path program 1 times [2025-02-06 03:22:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:27,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477178831] [2025-02-06 03:22:27,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:27,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 03:22:27,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 03:22:27,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:27,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:22:27,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316932007] [2025-02-06 03:22:27,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:27,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:27,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:27,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:22:27,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:22:27,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 03:22:27,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 03:22:27,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:27,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:22:27,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:22:28,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 03:22:28,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 03:22:28,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:28,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:22:28,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:22:28,131 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:22:28,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:22:28,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 03:22:28,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 03:22:28,337 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:28,413 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:22:28,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:22:28 BoogieIcfgContainer [2025-02-06 03:22:28,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:22:28,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:22:28,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:22:28,416 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:22:28,417 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:21" (3/4) ... [2025-02-06 03:22:28,419 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:22:28,419 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:22:28,420 INFO L158 Benchmark]: Toolchain (without parser) took 7772.29ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 109.1MB in the beginning and 119.4MB in the end (delta: -10.3MB). Peak memory consumption was 147.6MB. Max. memory is 16.1GB. [2025-02-06 03:22:28,420 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:22:28,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.03ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 95.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:22:28,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.45ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:22:28,421 INFO L158 Benchmark]: Boogie Preprocessor took 51.41ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:22:28,421 INFO L158 Benchmark]: IcfgBuilder took 586.56ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 61.7MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:22:28,421 INFO L158 Benchmark]: TraceAbstraction took 6767.39ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 61.7MB in the beginning and 119.5MB in the end (delta: -57.8MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2025-02-06 03:22:28,422 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 302.0MB. Free memory was 119.5MB in the beginning and 119.4MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:22:28,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.03ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 95.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.45ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.41ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 586.56ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 61.7MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6767.39ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 61.7MB in the beginning and 119.5MB in the end (delta: -57.8MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 302.0MB. Free memory was 119.5MB in the beginning and 119.4MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 51, overapproximation of shiftLeft at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[2] = { 9.2, 0.975 }; [L25-L27] double double_Array_0[2] = { 9.2, 0.975 }; [L25-L27] double double_Array_0[2] = { 9.2, 0.975 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -16 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -16 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L37] double last_1_double_Array_0_0_ = 9.2; [L38] signed long int last_1_signed_long_int_Array_0_0_ = -16; [L39] signed short int last_1_signed_short_int_Array_0_0_ = 1; [L40] unsigned char last_1_unsigned_char_Array_0_2_ = 10; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L81] EXPR double_Array_0[0] [L81] last_1_double_Array_0_0_ = double_Array_0[0] [L82] EXPR signed_long_int_Array_0[0] [L82] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L83] EXPR signed_short_int_Array_0[0] [L83] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L84] EXPR unsigned_char_Array_0[2] [L84] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] double_Array_0[1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L77] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L44] unsigned char stepLocal_0 = last_1_double_Array_0_0_ > last_1_double_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=0, unsigned_char_Array_0={8:0}] [L45] COND FALSE !(((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || stepLocal_0) [L48] signed_short_int_Array_0[0] = last_1_signed_short_int_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L50] EXPR signed_short_int_Array_0[0] [L50] signed_long_int_Array_0[0] = signed_short_int_Array_0[0] [L51] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] EXPR 10 << signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] COND TRUE (10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0]) [L52] EXPR signed_short_int_Array_0[0] [L52] EXPR signed_long_int_Array_0[0] [L52] signed_short_int_Array_0[1] = (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]) [L54] unsigned_char_Array_0[0] = 64 [L55] EXPR double_Array_0[1] [L55] double_Array_0[0] = double_Array_0[1] [L56] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] COND TRUE signed_short_int_Array_0[0] <= 16 [L57] EXPR unsigned_char_Array_0[1] [L57] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) [L87] EXPR unsigned_char_Array_0[2] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) [L87] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR 10 << signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1 [L87] EXPR signed_short_int_Array_0[1] [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR ((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) [L87] EXPR unsigned_char_Array_0[0] [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) [L87] EXPR double_Array_0[0] [L87] EXPR double_Array_0[1] [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87-L88] return ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 2317 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1580 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 737 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 73 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 958 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 2386 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1471 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 464/520 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:22:28,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:22:30,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:22:30,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:22:30,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:22:30,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:22:30,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:22:30,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:22:30,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:22:30,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:22:30,811 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:22:30,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:22:30,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:22:30,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:22:30,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:22:30,812 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:22:30,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:22:30,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:22:30,813 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:22:30,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:22:30,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:22:30,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:22:30,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:22:30,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:22:30,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:22:30,814 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:22:30,814 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:22:30,814 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:22:30,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:22:30,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:22:30,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:22:30,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:22:30,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:22:30,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:22:30,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:22:30,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:22:30,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:22:30,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:22:30,816 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:22:30,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:22:30,816 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:22:30,817 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:22:30,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:22:30,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:22:30,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:22:30,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:22:30,817 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2025-02-06 03:22:31,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:22:31,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:22:31,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:22:31,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:22:31,138 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:22:31,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2025-02-06 03:22:32,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38f84b997/ced7155cfc2944b3a10c8218d182fd75/FLAG97748c32f [2025-02-06 03:22:32,791 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:22:32,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2025-02-06 03:22:32,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38f84b997/ced7155cfc2944b3a10c8218d182fd75/FLAG97748c32f [2025-02-06 03:22:32,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38f84b997/ced7155cfc2944b3a10c8218d182fd75 [2025-02-06 03:22:32,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:22:32,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:22:32,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:22:32,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:22:32,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:22:32,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:22:32" (1/1) ... [2025-02-06 03:22:32,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cae0bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:32, skipping insertion in model container [2025-02-06 03:22:32,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:22:32" (1/1) ... [2025-02-06 03:22:32,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:22:32,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2025-02-06 03:22:33,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:22:33,076 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:22:33,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2025-02-06 03:22:33,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:22:33,163 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:22:33,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33 WrapperNode [2025-02-06 03:22:33,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:22:33,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:22:33,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:22:33,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:22:33,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,219 INFO L138 Inliner]: procedures = 36, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 333 [2025-02-06 03:22:33,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:22:33,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:22:33,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:22:33,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:22:33,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,260 INFO L175 MemorySlicer]: Split 86 memory accesses to 6 slices as follows [2, 6, 22, 8, 17, 31]. 36 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 2, 1, 2, 3]. The 13 writes are split as follows [0, 1, 2, 1, 3, 6]. [2025-02-06 03:22:33,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:22:33,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:22:33,313 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:22:33,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:22:33,314 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (1/1) ... [2025-02-06 03:22:33,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:22:33,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:33,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:22:33,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:22:33,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:22:33,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:22:33,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:22:33,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:22:33,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:22:33,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:22:33,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:22:33,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:22:33,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:22:33,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:22:33,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:22:33,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:22:33,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:22:33,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:22:33,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:22:33,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:22:33,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:22:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:22:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:22:33,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:22:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:22:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:22:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:22:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:22:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:22:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:22:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:22:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:22:33,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:22:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:22:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:22:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:22:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:22:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:22:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:22:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:22:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:22:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:22:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:22:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:22:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:22:33,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:22:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:22:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:22:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:22:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:22:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:22:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:22:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:22:33,570 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:22:33,572 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:22:34,105 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: havoc property_#t~mem44#1;havoc property_#t~ite62#1;havoc property_#t~mem46#1;havoc property_#t~mem45#1;havoc property_#t~mem47#1;havoc property_#t~mem48#1;havoc property_#t~ite51#1;havoc property_#t~mem49#1;havoc property_#t~mem50#1;havoc property_#t~mem52#1;havoc property_#t~ite61#1;havoc property_#t~mem53#1;havoc property_#t~ite58#1;havoc property_#t~mem55#1;havoc property_#t~mem54#1;havoc property_#t~mem57#1;havoc property_#t~mem56#1;havoc property_#t~mem60#1;havoc property_#t~mem59#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~short70#1;havoc property_#t~mem71#1;havoc property_#t~short72#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~short75#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~short82#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~short85#1; [2025-02-06 03:22:34,137 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-02-06 03:22:34,138 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:22:34,150 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:22:34,151 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:22:34,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:34 BoogieIcfgContainer [2025-02-06 03:22:34,151 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:22:34,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:22:34,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:22:34,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:22:34,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:22:32" (1/3) ... [2025-02-06 03:22:34,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592e874d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:22:34, skipping insertion in model container [2025-02-06 03:22:34,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:22:33" (2/3) ... [2025-02-06 03:22:34,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592e874d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:22:34, skipping insertion in model container [2025-02-06 03:22:34,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:22:34" (3/3) ... [2025-02-06 03:22:34,159 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2025-02-06 03:22:34,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:22:34,173 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-9.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:22:34,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:22:34,254 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;@5790b36d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:22:34,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:22:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 03:22:34,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:34,266 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:34,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:34,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2010662330, now seen corresponding path program 1 times [2025-02-06 03:22:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:34,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103467927] [2025-02-06 03:22:34,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:34,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:34,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:34,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:34,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:22:34,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 03:22:34,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 03:22:34,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:34,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:34,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:22:34,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 03:22:34,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:34,648 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103467927] [2025-02-06 03:22:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103467927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:34,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:22:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059593560] [2025-02-06 03:22:34,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:34,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:22:34,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:34,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:22:34,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:22:34,674 INFO L87 Difference]: Start difference. First operand has 69 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:34,693 INFO L93 Difference]: Finished difference Result 132 states and 194 transitions. [2025-02-06 03:22:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:22:34,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-06 03:22:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:34,701 INFO L225 Difference]: With dead ends: 132 [2025-02-06 03:22:34,701 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 03:22:34,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-02-06 03:22:34,705 INFO L435 NwaCegarLoop]: 92 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, 92 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-02-06 03:22:34,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 03:22:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-06 03:22:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-02-06 03:22:34,739 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2025-02-06 03:22:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:34,740 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-02-06 03:22:34,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2025-02-06 03:22:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 03:22:34,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:34,742 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:34,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:22:34,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:34,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:34,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1709788441, now seen corresponding path program 1 times [2025-02-06 03:22:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320557650] [2025-02-06 03:22:34,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:34,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:34,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:34,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:34,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:22:35,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 03:22:35,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 03:22:35,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:35,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:35,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:22:35,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:35,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:35,258 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:35,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320557650] [2025-02-06 03:22:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320557650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:35,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:35,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:22:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050677586] [2025-02-06 03:22:35,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:35,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:22:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:35,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:22:35,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:22:35,263 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:35,312 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2025-02-06 03:22:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:22:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-06 03:22:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:35,315 INFO L225 Difference]: With dead ends: 132 [2025-02-06 03:22:35,316 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 03:22:35,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:22:35,317 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:35,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 03:22:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-02-06 03:22:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-02-06 03:22:35,332 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2025-02-06 03:22:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:35,333 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-02-06 03:22:35,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-02-06 03:22:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 03:22:35,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:35,334 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:35,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:22:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:35,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:35,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash -87162918, now seen corresponding path program 1 times [2025-02-06 03:22:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582357829] [2025-02-06 03:22:35,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:35,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:35,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:35,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:35,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:22:35,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 03:22:35,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 03:22:35,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:35,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:35,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:22:35,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:35,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:35,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582357829] [2025-02-06 03:22:35,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582357829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:35,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:35,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:22:35,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534014873] [2025-02-06 03:22:35,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:35,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:22:35,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:35,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:22:35,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:22:35,820 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:35,877 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2025-02-06 03:22:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:22:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-06 03:22:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:35,880 INFO L225 Difference]: With dead ends: 136 [2025-02-06 03:22:35,880 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 03:22:35,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:22:35,881 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:35,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 03:22:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-02-06 03:22:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2025-02-06 03:22:35,891 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2025-02-06 03:22:35,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:35,892 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2025-02-06 03:22:35,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2025-02-06 03:22:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 03:22:35,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:35,895 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:35,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:22:36,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:36,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:36,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1894617381, now seen corresponding path program 1 times [2025-02-06 03:22:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606719095] [2025-02-06 03:22:36,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:36,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:36,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:36,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:36,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:22:36,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 03:22:36,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 03:22:36,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:36,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:36,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:22:36,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:36,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:36,357 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:36,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606719095] [2025-02-06 03:22:36,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606719095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:36,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:36,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:22:36,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053609442] [2025-02-06 03:22:36,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:36,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:22:36,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:36,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:22:36,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:22:36,359 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:36,434 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2025-02-06 03:22:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:22:36,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-06 03:22:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:36,438 INFO L225 Difference]: With dead ends: 142 [2025-02-06 03:22:36,438 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 03:22:36,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:22:36,439 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:36,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 03:22:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-02-06 03:22:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-02-06 03:22:36,445 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 60 [2025-02-06 03:22:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:36,445 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-02-06 03:22:36,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-02-06 03:22:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 03:22:36,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:36,447 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:36,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:22:36,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:36,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:36,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1893693860, now seen corresponding path program 1 times [2025-02-06 03:22:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279983201] [2025-02-06 03:22:36,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:36,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:36,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:36,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:36,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:22:36,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 03:22:36,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 03:22:36,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:36,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:36,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:22:36,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:37,065 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 14 treesize of output 10 [2025-02-06 03:22:37,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 14 [2025-02-06 03:22:37,313 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 28 treesize of output 16 [2025-02-06 03:22:37,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 52 treesize of output 34 [2025-02-06 03:22:37,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 58 treesize of output 45 [2025-02-06 03:22:37,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:37,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2025-02-06 03:22:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 03:22:37,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:37,600 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279983201] [2025-02-06 03:22:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279983201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:37,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:37,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:22:37,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920932372] [2025-02-06 03:22:37,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:37,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:22:37,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:37,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:22:37,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:22:37,603 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:38,599 INFO L93 Difference]: Finished difference Result 296 states and 401 transitions. [2025-02-06 03:22:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:22:38,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-02-06 03:22:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:38,601 INFO L225 Difference]: With dead ends: 296 [2025-02-06 03:22:38,602 INFO L226 Difference]: Without dead ends: 225 [2025-02-06 03:22:38,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:22:38,603 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 404 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:38,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 551 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:22:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-06 03:22:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 201. [2025-02-06 03:22:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 184 states have (on average 1.3532608695652173) internal successors, (249), 185 states have internal predecessors, (249), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 03:22:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 275 transitions. [2025-02-06 03:22:38,638 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 275 transitions. Word has length 60 [2025-02-06 03:22:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:38,638 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 275 transitions. [2025-02-06 03:22:38,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 275 transitions. [2025-02-06 03:22:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 03:22:38,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:38,642 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:38,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:22:38,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:38,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:38,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1049221989, now seen corresponding path program 1 times [2025-02-06 03:22:38,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:38,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398073814] [2025-02-06 03:22:38,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:38,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:38,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:38,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:38,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:22:38,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 03:22:39,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 03:22:39,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:39,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:39,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:22:39,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:39,068 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 14 treesize of output 10 [2025-02-06 03:22:39,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 14 [2025-02-06 03:22:39,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2025-02-06 03:22:39,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:39,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 34 [2025-02-06 03:22:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 03:22:39,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:39,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:39,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398073814] [2025-02-06 03:22:39,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398073814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:39,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:39,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:22:39,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505290015] [2025-02-06 03:22:39,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:39,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:22:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:39,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:22:39,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:22:39,263 INFO L87 Difference]: Start difference. First operand 201 states and 275 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:39,521 INFO L93 Difference]: Finished difference Result 428 states and 581 transitions. [2025-02-06 03:22:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:22:39,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-02-06 03:22:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:39,525 INFO L225 Difference]: With dead ends: 428 [2025-02-06 03:22:39,525 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:22:39,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:22:39,526 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 137 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:39,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 294 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:22:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:22:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 80. [2025-02-06 03:22:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 03:22:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2025-02-06 03:22:39,549 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 60 [2025-02-06 03:22:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:39,549 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2025-02-06 03:22:39,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2025-02-06 03:22:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:39,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:39,552 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:39,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:22:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:39,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1588336472, now seen corresponding path program 1 times [2025-02-06 03:22:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503687588] [2025-02-06 03:22:39,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:39,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:39,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:39,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:39,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:22:39,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:39,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:39,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:39,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:39,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:22:39,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:40,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:40,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2025-02-06 03:22:40,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:22:40,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:40,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 58 [2025-02-06 03:22:40,540 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 55 treesize of output 43 [2025-02-06 03:22:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:40,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:40,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:40,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503687588] [2025-02-06 03:22:40,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503687588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:40,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:40,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:22:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749460168] [2025-02-06 03:22:40,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:40,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:22:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:40,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:22:40,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:22:40,577 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:41,024 INFO L93 Difference]: Finished difference Result 267 states and 351 transitions. [2025-02-06 03:22:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:22:41,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 03:22:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:41,027 INFO L225 Difference]: With dead ends: 267 [2025-02-06 03:22:41,027 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 03:22:41,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:22:41,028 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 199 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:41,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 483 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:22:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 03:22:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 154. [2025-02-06 03:22:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 139 states have internal predecessors, (184), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 03:22:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 204 transitions. [2025-02-06 03:22:41,045 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 204 transitions. Word has length 62 [2025-02-06 03:22:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:41,045 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 204 transitions. [2025-02-06 03:22:41,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2025-02-06 03:22:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:41,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:41,047 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:41,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:22:41,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:41,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2016069350, now seen corresponding path program 1 times [2025-02-06 03:22:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:41,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089671011] [2025-02-06 03:22:41,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:41,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:41,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:41,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:41,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:22:41,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:41,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:41,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:41,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:41,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:22:41,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:41,591 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 14 treesize of output 10 [2025-02-06 03:22:41,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 14 [2025-02-06 03:22:41,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:22:41,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 52 treesize of output 34 [2025-02-06 03:22:41,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 58 treesize of output 45 [2025-02-06 03:22:42,114 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 42 treesize of output 30 [2025-02-06 03:22:42,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:42,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 15 [2025-02-06 03:22:42,138 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 51 treesize of output 31 [2025-02-06 03:22:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 03:22:42,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:42,160 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089671011] [2025-02-06 03:22:42,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089671011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:42,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:42,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:22:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857821802] [2025-02-06 03:22:42,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:42,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:22:42,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:42,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:22:42,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:22:42,161 INFO L87 Difference]: Start difference. First operand 154 states and 204 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:43,152 INFO L93 Difference]: Finished difference Result 461 states and 612 transitions. [2025-02-06 03:22:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:22:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-02-06 03:22:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:43,155 INFO L225 Difference]: With dead ends: 461 [2025-02-06 03:22:43,157 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 03:22:43,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:22:43,158 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 335 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:43,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 423 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:22:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 03:22:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 172. [2025-02-06 03:22:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 157 states have (on average 1.3439490445859872) internal successors, (211), 157 states have internal predecessors, (211), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 03:22:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2025-02-06 03:22:43,178 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 62 [2025-02-06 03:22:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:43,178 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2025-02-06 03:22:43,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2025-02-06 03:22:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:43,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:43,180 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:43,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:22:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:43,380 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1082777847, now seen corresponding path program 1 times [2025-02-06 03:22:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582441778] [2025-02-06 03:22:43,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:43,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:43,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:43,385 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:43,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:22:43,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:43,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:43,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:43,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:43,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:22:43,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:43,675 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 8 treesize of output 1 [2025-02-06 03:22:43,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:43,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 98 [2025-02-06 03:22:44,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:44,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 131 [2025-02-06 03:22:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 03:22:44,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:22:44,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:44,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582441778] [2025-02-06 03:22:44,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582441778] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:44,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1801690625] [2025-02-06 03:22:44,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:44,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:22:44,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:22:44,559 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:22:44,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-02-06 03:22:44,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:45,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:45,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:45,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:45,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 03:22:45,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:45,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-02-06 03:22:46,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:46,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 96 [2025-02-06 03:22:46,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:46,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 135 [2025-02-06 03:22:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 03:22:46,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:22:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1801690625] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:46,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:22:46,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-02-06 03:22:46,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896308238] [2025-02-06 03:22:46,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:22:46,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:22:46,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:46,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:22:46,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:22:46,644 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-06 03:22:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:47,733 INFO L93 Difference]: Finished difference Result 512 states and 683 transitions. [2025-02-06 03:22:47,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:22:47,735 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 62 [2025-02-06 03:22:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:47,737 INFO L225 Difference]: With dead ends: 512 [2025-02-06 03:22:47,738 INFO L226 Difference]: Without dead ends: 343 [2025-02-06 03:22:47,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:22:47,739 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 386 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:47,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 655 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:22:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-06 03:22:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2025-02-06 03:22:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 308 states have (on average 1.3311688311688312) internal successors, (410), 310 states have internal predecessors, (410), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:22:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 450 transitions. [2025-02-06 03:22:47,769 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 450 transitions. Word has length 62 [2025-02-06 03:22:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:47,769 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 450 transitions. [2025-02-06 03:22:47,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-06 03:22:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 450 transitions. [2025-02-06 03:22:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:47,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:47,771 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:47,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-02-06 03:22:47,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:22:48,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:48,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:48,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:48,172 INFO L85 PathProgramCache]: Analyzing trace with hash -724676616, now seen corresponding path program 1 times [2025-02-06 03:22:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:48,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882475873] [2025-02-06 03:22:48,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:48,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:48,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:48,174 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:48,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:22:48,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:48,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:48,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:48,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:48,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:22:48,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:48,349 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 12 treesize of output 8 [2025-02-06 03:22:48,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:48,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-02-06 03:22:48,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:48,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 27 [2025-02-06 03:22:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:48,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:48,417 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:48,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882475873] [2025-02-06 03:22:48,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882475873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:48,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:48,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:22:48,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927368103] [2025-02-06 03:22:48,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:48,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:22:48,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:48,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:22:48,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:22:48,418 INFO L87 Difference]: Start difference. First operand 339 states and 450 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:48,629 INFO L93 Difference]: Finished difference Result 738 states and 976 transitions. [2025-02-06 03:22:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:22:48,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 03:22:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:48,633 INFO L225 Difference]: With dead ends: 738 [2025-02-06 03:22:48,633 INFO L226 Difference]: Without dead ends: 402 [2025-02-06 03:22:48,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:22:48,634 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 80 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:48,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 398 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:22:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-06 03:22:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 339. [2025-02-06 03:22:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 308 states have (on average 1.3181818181818181) internal successors, (406), 310 states have internal predecessors, (406), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:22:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 446 transitions. [2025-02-06 03:22:48,672 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 446 transitions. Word has length 62 [2025-02-06 03:22:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:48,672 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 446 transitions. [2025-02-06 03:22:48,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 446 transitions. [2025-02-06 03:22:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:48,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:48,674 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:48,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-02-06 03:22:48,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:48,875 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:48,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:48,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1773339321, now seen corresponding path program 1 times [2025-02-06 03:22:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:48,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581235456] [2025-02-06 03:22:48,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:48,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:48,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:48,878 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:48,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:22:48,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:49,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:49,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:49,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:49,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:22:49,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:49,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:49,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581235456] [2025-02-06 03:22:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581235456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:49,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:49,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:22:49,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940169686] [2025-02-06 03:22:49,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:49,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:22:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:49,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:22:49,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:22:49,050 INFO L87 Difference]: Start difference. First operand 339 states and 446 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:49,114 INFO L93 Difference]: Finished difference Result 687 states and 905 transitions. [2025-02-06 03:22:49,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:22:49,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 03:22:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:49,117 INFO L225 Difference]: With dead ends: 687 [2025-02-06 03:22:49,117 INFO L226 Difference]: Without dead ends: 351 [2025-02-06 03:22:49,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:22:49,118 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 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-02-06 03:22:49,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-02-06 03:22:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-02-06 03:22:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 320 states have (on average 1.30625) internal successors, (418), 322 states have internal predecessors, (418), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:22:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 458 transitions. [2025-02-06 03:22:49,154 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 458 transitions. Word has length 62 [2025-02-06 03:22:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:49,155 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 458 transitions. [2025-02-06 03:22:49,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 458 transitions. [2025-02-06 03:22:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:49,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:49,158 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:49,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 03:22:49,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:49,359 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:49,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2067547033, now seen corresponding path program 1 times [2025-02-06 03:22:49,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574554568] [2025-02-06 03:22:49,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:49,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:49,361 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:49,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:22:49,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:49,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:49,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:49,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:49,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:22:49,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:49,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 14 [2025-02-06 03:22:49,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:22:49,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 49 treesize of output 40 [2025-02-06 03:22:49,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:49,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 67 [2025-02-06 03:22:49,836 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 75 treesize of output 55 [2025-02-06 03:22:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:22:49,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:49,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:49,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574554568] [2025-02-06 03:22:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574554568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:49,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:49,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:22:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318933423] [2025-02-06 03:22:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:49,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:22:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:49,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:22:49,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:22:49,869 INFO L87 Difference]: Start difference. First operand 351 states and 458 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:50,487 INFO L93 Difference]: Finished difference Result 908 states and 1176 transitions. [2025-02-06 03:22:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:22:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 03:22:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:50,496 INFO L225 Difference]: With dead ends: 908 [2025-02-06 03:22:50,497 INFO L226 Difference]: Without dead ends: 560 [2025-02-06 03:22:50,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:22:50,498 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 273 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:50,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 847 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:22:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-02-06 03:22:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 345. [2025-02-06 03:22:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 314 states have (on average 1.305732484076433) internal successors, (410), 316 states have internal predecessors, (410), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:22:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 450 transitions. [2025-02-06 03:22:50,543 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 450 transitions. Word has length 62 [2025-02-06 03:22:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:50,544 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 450 transitions. [2025-02-06 03:22:50,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:22:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 450 transitions. [2025-02-06 03:22:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 03:22:50,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:50,546 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:50,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-02-06 03:22:50,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:50,746 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:50,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash -617962632, now seen corresponding path program 1 times [2025-02-06 03:22:50,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:50,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734775447] [2025-02-06 03:22:50,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:50,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:50,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:50,750 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:50,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-02-06 03:22:50,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 03:22:50,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 03:22:50,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:50,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:50,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:22:50,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 03:22:50,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:50,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734775447] [2025-02-06 03:22:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734775447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:50,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:50,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:22:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059131558] [2025-02-06 03:22:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:50,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:22:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:50,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:22:50,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:22:50,913 INFO L87 Difference]: Start difference. First operand 345 states and 450 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:50,980 INFO L93 Difference]: Finished difference Result 687 states and 897 transitions. [2025-02-06 03:22:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:22:50,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-02-06 03:22:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:50,983 INFO L225 Difference]: With dead ends: 687 [2025-02-06 03:22:50,983 INFO L226 Difference]: Without dead ends: 345 [2025-02-06 03:22:50,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:22:50,985 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:50,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:22:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-06 03:22:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-02-06 03:22:51,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 314 states have (on average 1.2993630573248407) internal successors, (408), 316 states have internal predecessors, (408), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:22:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 448 transitions. [2025-02-06 03:22:51,022 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 448 transitions. Word has length 62 [2025-02-06 03:22:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:51,022 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 448 transitions. [2025-02-06 03:22:51,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 03:22:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 448 transitions. [2025-02-06 03:22:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 03:22:51,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:51,024 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:51,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-02-06 03:22:51,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:51,225 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:51,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:51,226 INFO L85 PathProgramCache]: Analyzing trace with hash -863601932, now seen corresponding path program 1 times [2025-02-06 03:22:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343116918] [2025-02-06 03:22:51,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:51,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:51,231 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:51,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-02-06 03:22:51,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 03:22:51,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 03:22:51,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:51,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:51,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:22:51,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 03:22:51,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:22:51,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:51,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343116918] [2025-02-06 03:22:51,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343116918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:51,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:51,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:22:51,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264427279] [2025-02-06 03:22:51,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:51,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:22:51,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:51,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:22:51,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:22:51,468 INFO L87 Difference]: Start difference. First operand 345 states and 448 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 03:22:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:51,559 INFO L93 Difference]: Finished difference Result 707 states and 915 transitions. [2025-02-06 03:22:51,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:22:51,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 64 [2025-02-06 03:22:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:51,561 INFO L225 Difference]: With dead ends: 707 [2025-02-06 03:22:51,561 INFO L226 Difference]: Without dead ends: 361 [2025-02-06 03:22:51,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:22:51,563 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:51,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-06 03:22:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 345. [2025-02-06 03:22:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 314 states have (on average 1.2929936305732483) internal successors, (406), 316 states have internal predecessors, (406), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:22:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 446 transitions. [2025-02-06 03:22:51,600 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 446 transitions. Word has length 64 [2025-02-06 03:22:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:51,600 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 446 transitions. [2025-02-06 03:22:51,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 03:22:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 446 transitions. [2025-02-06 03:22:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 03:22:51,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:51,601 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:22:51,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-02-06 03:22:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:51,806 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:51,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:51,806 INFO L85 PathProgramCache]: Analyzing trace with hash 161091989, now seen corresponding path program 1 times [2025-02-06 03:22:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:22:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656950609] [2025-02-06 03:22:51,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:51,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:22:51,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:22:51,809 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:22:51,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-02-06 03:22:51,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 03:22:52,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 03:22:52,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:52,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:52,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:22:52,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:52,066 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 25 treesize of output 10 [2025-02-06 03:22:54,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:54,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 100 [2025-02-06 03:22:55,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:55,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 389 treesize of output 133 [2025-02-06 03:22:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 03:22:55,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:22:56,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:56,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656950609] [2025-02-06 03:22:56,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656950609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:56,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773413565] [2025-02-06 03:22:56,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:56,447 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:22:56,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:22:56,449 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:22:56,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-02-06 03:22:56,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 03:22:57,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 03:22:57,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:57,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:57,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:22:57,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:59,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-02-06 03:23:05,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:23:05,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 94 [2025-02-06 03:23:05,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:23:05,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 313 treesize of output 133 [2025-02-06 03:23:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 03:23:05,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:23:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [773413565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:23:05,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:23:05,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-02-06 03:23:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412679200] [2025-02-06 03:23:05,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:23:05,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 03:23:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:23:05,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 03:23:05,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=541, Unknown=3, NotChecked=0, Total=650 [2025-02-06 03:23:05,797 INFO L87 Difference]: Start difference. First operand 345 states and 446 transitions. Second operand has 24 states, 22 states have (on average 4.0) internal successors, (88), 21 states have internal predecessors, (88), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-06 03:23:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:23:07,989 INFO L93 Difference]: Finished difference Result 719 states and 919 transitions. [2025-02-06 03:23:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:23:07,990 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.0) internal successors, (88), 21 states have internal predecessors, (88), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) Word has length 64 [2025-02-06 03:23:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:23:07,993 INFO L225 Difference]: With dead ends: 719 [2025-02-06 03:23:07,993 INFO L226 Difference]: Without dead ends: 377 [2025-02-06 03:23:07,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=366, Invalid=1353, Unknown=3, NotChecked=0, Total=1722 [2025-02-06 03:23:07,996 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 872 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:23:07,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 826 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 03:23:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-06 03:23:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 187. [2025-02-06 03:23:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 170 states have (on average 1.276470588235294) internal successors, (217), 170 states have internal predecessors, (217), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 03:23:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2025-02-06 03:23:08,029 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 64 [2025-02-06 03:23:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:23:08,029 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2025-02-06 03:23:08,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.0) internal successors, (88), 21 states have internal predecessors, (88), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-06 03:23:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2025-02-06 03:23:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 03:23:08,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:23:08,030 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:23:08,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2025-02-06 03:23:08,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-02-06 03:23:08,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:08,431 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:23:08,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:23:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash 324680888, now seen corresponding path program 1 times [2025-02-06 03:23:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:23:08,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005001357] [2025-02-06 03:23:08,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:08,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:08,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:23:08,433 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:23:08,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-02-06 03:23:08,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 03:23:08,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 03:23:08,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:23:08,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:23:08,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:23:08,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:23:08,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 03:23:08,662 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 17 treesize of output 9 [2025-02-06 03:23:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:23:08,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:23:08,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:23:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005001357] [2025-02-06 03:23:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005001357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:23:08,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:23:08,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:23:08,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594516017] [2025-02-06 03:23:08,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:23:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:23:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:23:08,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:23:08,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:23:08,769 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:23:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:23:09,068 INFO L93 Difference]: Finished difference Result 470 states and 597 transitions. [2025-02-06 03:23:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:23:09,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2025-02-06 03:23:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:23:09,071 INFO L225 Difference]: With dead ends: 470 [2025-02-06 03:23:09,071 INFO L226 Difference]: Without dead ends: 286 [2025-02-06 03:23:09,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:23:09,073 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 82 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:23:09,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 280 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:23:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-06 03:23:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2025-02-06 03:23:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 243 states have (on average 1.2839506172839505) internal successors, (312), 243 states have internal predecessors, (312), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:23:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 342 transitions. [2025-02-06 03:23:09,105 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 342 transitions. Word has length 64 [2025-02-06 03:23:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:23:09,106 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 342 transitions. [2025-02-06 03:23:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:23:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 342 transitions. [2025-02-06 03:23:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 03:23:09,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:23:09,107 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:23:09,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-02-06 03:23:09,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:09,308 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:23:09,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:23:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash 3588128, now seen corresponding path program 1 times [2025-02-06 03:23:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:23:09,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293591403] [2025-02-06 03:23:09,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:09,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:09,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:23:09,311 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:23:09,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-02-06 03:23:09,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 03:23:09,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 03:23:09,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:23:09,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:23:09,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:23:09,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:23:09,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 14 [2025-02-06 03:23:09,612 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 17 treesize of output 9 [2025-02-06 03:23:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:23:09,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:23:09,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:23:09,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293591403] [2025-02-06 03:23:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293591403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:23:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:23:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:23:09,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275102981] [2025-02-06 03:23:09,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:23:09,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:23:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:23:09,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:23:09,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:23:09,618 INFO L87 Difference]: Start difference. First operand 268 states and 342 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:23:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:23:09,862 INFO L93 Difference]: Finished difference Result 442 states and 559 transitions. [2025-02-06 03:23:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:23:09,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2025-02-06 03:23:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:23:09,864 INFO L225 Difference]: With dead ends: 442 [2025-02-06 03:23:09,864 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 03:23:09,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:23:09,865 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:23:09,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 219 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:23:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 03:23:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2025-02-06 03:23:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 203 states have internal predecessors, (252), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:23:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 282 transitions. [2025-02-06 03:23:09,901 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 282 transitions. Word has length 64 [2025-02-06 03:23:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:23:09,901 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 282 transitions. [2025-02-06 03:23:09,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:23:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 282 transitions. [2025-02-06 03:23:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 03:23:09,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:23:09,902 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:23:09,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2025-02-06 03:23:10,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:10,102 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:23:10,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:23:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1883386288, now seen corresponding path program 1 times [2025-02-06 03:23:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:23:10,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383344213] [2025-02-06 03:23:10,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:10,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:10,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:23:10,105 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:23:10,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2025-02-06 03:23:10,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 03:23:10,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 03:23:10,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:23:10,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:23:10,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:23:10,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:23:10,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 14 [2025-02-06 03:23:10,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:23:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:23:10,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:23:10,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:23:10,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383344213] [2025-02-06 03:23:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383344213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:23:10,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:23:10,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:23:10,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724141526] [2025-02-06 03:23:10,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:23:10,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:23:10,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:23:10,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:23:10,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:23:10,559 INFO L87 Difference]: Start difference. First operand 228 states and 282 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:23:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:23:10,813 INFO L93 Difference]: Finished difference Result 237 states and 291 transitions. [2025-02-06 03:23:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:23:10,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2025-02-06 03:23:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:23:10,815 INFO L225 Difference]: With dead ends: 237 [2025-02-06 03:23:10,815 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 03:23:10,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:23:10,815 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 101 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:23:10,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 532 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:23:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 03:23:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2025-02-06 03:23:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 206 states have (on average 1.2378640776699028) internal successors, (255), 206 states have internal predecessors, (255), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:23:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 285 transitions. [2025-02-06 03:23:10,854 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 285 transitions. Word has length 64 [2025-02-06 03:23:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:23:10,854 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 285 transitions. [2025-02-06 03:23:10,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:23:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 285 transitions. [2025-02-06 03:23:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 03:23:10,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:23:10,855 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:23:10,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2025-02-06 03:23:11,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:11,056 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:23:11,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:23:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1882462767, now seen corresponding path program 1 times [2025-02-06 03:23:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:23:11,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398304339] [2025-02-06 03:23:11,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:11,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:11,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:23:11,059 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:23:11,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-02-06 03:23:11,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 03:23:11,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 03:23:11,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:23:11,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:23:11,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:23:11,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:23:11,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 17 [2025-02-06 03:23:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 03:23:11,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:23:11,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:23:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398304339] [2025-02-06 03:23:11,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398304339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:23:11,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:23:11,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:23:11,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735340711] [2025-02-06 03:23:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:23:11,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:23:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:23:11,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:23:11,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:23:11,467 INFO L87 Difference]: Start difference. First operand 231 states and 285 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:23:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:23:11,630 INFO L93 Difference]: Finished difference Result 401 states and 496 transitions. [2025-02-06 03:23:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:23:11,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2025-02-06 03:23:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:23:11,632 INFO L225 Difference]: With dead ends: 401 [2025-02-06 03:23:11,632 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 03:23:11,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:23:11,632 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 70 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:23:11,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 364 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:23:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 03:23:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2025-02-06 03:23:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 209 states have (on average 1.2344497607655502) internal successors, (258), 209 states have internal predecessors, (258), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:23:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2025-02-06 03:23:11,673 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 64 [2025-02-06 03:23:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:23:11,675 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2025-02-06 03:23:11,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:23:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2025-02-06 03:23:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:23:11,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:23:11,676 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:23:11,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2025-02-06 03:23:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:11,877 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:23:11,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:23:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1644938968, now seen corresponding path program 1 times [2025-02-06 03:23:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:23:11,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150137775] [2025-02-06 03:23:11,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:11,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:11,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:23:11,882 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:23:11,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2025-02-06 03:23:12,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:23:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:23:12,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:23:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:23:12,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:23:12,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:23:12,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 14 [2025-02-06 03:23:12,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:23:12,729 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 19 treesize of output 1 [2025-02-06 03:23:12,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 87 treesize of output 59 [2025-02-06 03:23:12,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 20 [2025-02-06 03:23:13,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 47 [2025-02-06 03:23:13,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 71 treesize of output 58 [2025-02-06 03:23:13,149 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 58 treesize of output 42 [2025-02-06 03:23:13,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:23:13,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 86 [2025-02-06 03:23:13,161 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 23 [2025-02-06 03:23:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 9 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-06 03:23:13,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:23:18,047 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:23:18,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150137775] [2025-02-06 03:23:18,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150137775] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:23:18,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2051978664] [2025-02-06 03:23:18,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:18,048 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:23:18,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:23:18,050 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:23:18,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2025-02-06 03:23:18,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:23:19,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:23:19,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:23:19,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:23:19,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 03:23:19,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:23:19,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 14 [2025-02-06 03:23:20,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:23:20,962 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-02-06 03:23:21,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 78 treesize of output 50 [2025-02-06 03:23:22,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 20 [2025-02-06 03:23:22,525 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 50 treesize of output 34 [2025-02-06 03:23:22,993 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 52 treesize of output 43 [2025-02-06 03:23:23,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-06 03:23:23,277 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 52 treesize of output 36 [2025-02-06 03:23:23,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:23:23,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2025-02-06 03:23:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 141 proven. 9 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-06 03:23:23,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:23:30,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2051978664] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:23:30,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:23:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2025-02-06 03:23:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10862112] [2025-02-06 03:23:30,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:23:30,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 03:23:30,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:23:30,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 03:23:30,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1126, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:23:30,469 INFO L87 Difference]: Start difference. First operand 234 states and 288 transitions. Second operand has 27 states, 26 states have (on average 5.846153846153846) internal successors, (152), 26 states have internal predecessors, (152), 5 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-06 03:23:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:23:36,163 INFO L93 Difference]: Finished difference Result 498 states and 606 transitions. [2025-02-06 03:23:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:23:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.846153846153846) internal successors, (152), 26 states have internal predecessors, (152), 5 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 125 [2025-02-06 03:23:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:23:36,165 INFO L225 Difference]: With dead ends: 498 [2025-02-06 03:23:36,165 INFO L226 Difference]: Without dead ends: 412 [2025-02-06 03:23:36,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=402, Invalid=2048, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 03:23:36,167 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 439 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:23:36,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 2204 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 03:23:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-06 03:23:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 253. [2025-02-06 03:23:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 228 states have (on average 1.25) internal successors, (285), 228 states have internal predecessors, (285), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:23:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 315 transitions. [2025-02-06 03:23:36,205 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 315 transitions. Word has length 125 [2025-02-06 03:23:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:23:36,205 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 315 transitions. [2025-02-06 03:23:36,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.846153846153846) internal successors, (152), 26 states have internal predecessors, (152), 5 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-06 03:23:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 315 transitions. [2025-02-06 03:23:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:23:36,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:23:36,207 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:23:36,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2025-02-06 03:23:36,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2025-02-06 03:23:36,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:36,608 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:23:36,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:23:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1711945721, now seen corresponding path program 1 times [2025-02-06 03:23:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:23:36,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871656576] [2025-02-06 03:23:36,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:23:36,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:23:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:23:36,610 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:23:36,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2025-02-06 03:23:36,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:23:36,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:23:36,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:23:36,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:23:36,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 03:23:36,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:23:37,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 14 [2025-02-06 03:23:37,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:23:37,507 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 19 treesize of output 1 [2025-02-06 03:23:37,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 77 treesize of output 53 [2025-02-06 03:23:37,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 20 [2025-02-06 03:23:38,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 27 [2025-02-06 03:23:38,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 38 [2025-02-06 03:23:38,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-02-06 03:23:38,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:23:38,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 27 [2025-02-06 03:23:38,310 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 20 treesize of output 12 [2025-02-06 03:23:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 9 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-06 03:23:38,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:23:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-02-06 03:23:38,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:23:38,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871656576] [2025-02-06 03:23:38,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871656576] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:23:38,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:23:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2025-02-06 03:23:38,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624378736] [2025-02-06 03:23:38,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:23:38,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:23:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:23:38,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:23:38,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:23:38,965 INFO L87 Difference]: Start difference. First operand 253 states and 315 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 03:23:43,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:23:47,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []